1 option
Cohesive Subgraph Search Over Large Heterogeneous Information Networks / by Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang.
- Format:
- Book
- Author/Creator:
- Fang, Yixiang., Author.
- Wang, Kai, Author.
- Lin, Xuemin, Author.
- Zhang, Wenjie, Author.
- Series:
- Computer Science (SpringerNature-11645)
- SpringerBriefs in computer science 2191-5776
- SpringerBriefs in Computer Science, 2191-5776
- Language:
- English
- Subjects (All):
- Information storage and retrieval systems.
- Computer science-Mathematics.
- Discrete mathematics.
- Graph theory.
- Information Storage and Retrieval.
- Discrete Mathematics in Computer Science.
- Graph Theory.
- Local Subjects:
- Information Storage and Retrieval.
- Discrete Mathematics in Computer Science.
- Graph Theory.
- Physical Description:
- 1 online resource (XIX, 74 pages) : 20 illustrations, 5 illustrations in color.
- Edition:
- 1st ed. 2022.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2022.
- System Details:
- text file PDF
- Summary:
- This SpringerBrief provides the first systematic review of the existing works of cohesive subgraph search (CSS) over large heterogeneous information 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 works of CSS over HINs according to the classic cohesiveness metrics such as core, truss, clique, connectivity, density, et cetera, and then extensively review the specific models and their corresponding search solutions in each group. Note that since the bipartite network is a special case of HINs, all the models developed for general HINs can be directly applied to bipartite networks, but the models customized for bipartite networks may not be easily extended for other general HINs due to their restricted settings. The authors also analyze and compare these cohesive subgraph models (CSMs) and solutions systematically. Specifically, the authors compare different groups of CSMs and analyze both their similarities and differences, from multiple perspectives such as cohesiveness constraints, shared properties, and computational efficiency. Then, for the CSMs in each group, the authors further analyze and compare their model properties and high-level algorithm ideas. This SpringerBrief targets researchers, professors, engineers and graduate students, who are working in the areas of graph data management and graph mining. Undergraduate students who are majoring in computer science, databases, data and knowledge engineering, and data science will also want to read this SpringerBrief.
- Contents:
- Introduction
- Preliminaries
- CSS on Bipartite Networks
- CSS on Other General HINs
- Comparison Analysis
- Related Work on CSMs and solutions
- Future Work and Conclusion.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-97568-5
- 9783030975685
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.