Titlebook: Cohesive Subgraph Search Over Large Heterogeneous Information Networks; Yixiang Fang,Kai Wang,Wenjie Zhang Book 2022 The Author(s), under

性学院

978-3-030-97567-8The Author(s), under exclusive license to Springer Nature Switzerland AG 2022

Pigeon

Introduction, first show a list of example HINs and typical applications of CSS over large HINs, then discuss the two key challenges of conducting CSS over large HINs, and finally make a classification of existing works according to the classic cohesiveness metrics.

Consequence

MONY

Comparison Analysis,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.

使成波状

Future Work and Conclusion,cluding novel application-driven CSMs, efficient search algorithms, parameter optimization, and an online repository for collecting HIN datasets, tools, and algorithm codes, which can provide researchers some good starting points to work in this area. In addition, we draw a brief conclusion for the book.

Anthropoid

ascend

2191-5768 formation networks (HINs). It also covers the research breakthroughs of this area, including models, algorithms and comparison studies in recent years. This SpringerBrief offers a list of promising future research directions of performing CSS over large HINs..The authors first classify the existing

离开可分裂

Harry T. Lawless,Hildegarde Heymanndels of HINs and bipartite networks, and then review several typical classic CSMs on homogeneous networks, including .-core, .-truss, .-clique, .-edge-connectivity component (.-ECC), and the densest subgraphs.

预感

Timothy J. Cunningham,E. Hazel Murphyd to the these of CSS over large HINs. In this chapter, we thoroughly review the five groups of works on CSS on homogeneous networks, which are core-, truss-, clique-, connectivity-, and density-based CSMs and solutions. In addition, we also review the works on HIN clustering and compare it with the earlier version of this book.

小母马

Preliminaries,dels of HINs and bipartite networks, and then review several typical classic CSMs on homogeneous networks, including .-core, .-truss, .-clique, .-edge-connectivity component (.-ECC), and the densest subgraphs.