Cohesive Subgraph Search Over Large Heterogeneous Information NetworksComparison Analysis
Cohesive Subgraph Search Over Large Heterogeneous Information Networks: Comparison Analysis
Fang, Yixiang; Wang, Kai; Lin, Xuemin; Zhang, Wenjie
2022-02-23 00:00:00
[In the previous two chapters, we have extensively introduced the CSMs and solutions for the bipartite networks and other general HINs, such as core-, truss-, clique-, connectivity-, and density-based models and solutions. These works focus on different types of specific HINs and formulate CSMs in different manners, so a natural question is which CSMs perform better on which graphs? To answer this question, it is desirable to have a comprehensive comparison of these works. In this chapter, we perform an in-depth comparison analysis of all the CSMs and solutions for bipartite networks and other general HINs respectively. We carefully analyze the advantages and disadvantages of these CSMs and solutions, in terms of their computational complexities and application scenarios.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/cohesive-subgraph-search-over-large-heterogeneous-information-networks-fL0Wa6ARza
Cohesive Subgraph Search Over Large Heterogeneous Information NetworksComparison Analysis
[In the previous two chapters, we have extensively introduced the CSMs and solutions for the bipartite networks and other general HINs, such as core-, truss-, clique-, connectivity-, and density-based models and solutions. These works focus on different types of specific HINs and formulate CSMs in different manners, so a natural question is which CSMs perform better on which graphs? To answer this question, it is desirable to have a comprehensive comparison of these works. In this chapter, we perform an in-depth comparison analysis of all the CSMs and solutions for bipartite networks and other general HINs respectively. We carefully analyze the advantages and disadvantages of these CSMs and solutions, in terms of their computational complexities and application scenarios.]
Published: Feb 23, 2022
Recommended Articles
Loading...
There are no references for this article.
Share the Full Text of this Article with up to 5 Colleagues for FREE
Sign up for your 14-Day Free Trial Now!
Read and print from thousands of top scholarly journals.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.