Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cohesive Subgraph Search Over Large Heterogeneous Information NetworksCSS on Bipartite Networks

Cohesive Subgraph Search Over Large Heterogeneous Information Networks: CSS on Bipartite Networks [In many real-world applications, relationships between two different types of entities (e.g., user-item people-location and author-paper) are naturally modeled as bipartite networks. When analyzing bipartite networks, CSMs and CSS techniques play an important role in many aspects including network measurement, dense region discovering, and network reinforcement. To meet the high demands in the era of big data, novel CSMs and CSS solutions over bipartite networks have been proposed recently. In this chapter, we extensively review existing studies of CSS over bipartite networks in the literature. Specifically, we discuss the core-, truss-, clique-, connectivity-, and density-based models and the solutions to search subgraphs following these models over bipartite networks.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Cohesive Subgraph Search Over Large Heterogeneous Information NetworksCSS on Bipartite Networks

Download PDF
15 pages

Loading next page...
 
/lp/springer-journals/cohesive-subgraph-search-over-large-heterogeneous-information-networks-sYanaSq2Lx
Publisher
Springer International Publishing
Copyright
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
ISBN
978-3-030-97567-8
Pages
11 –26
DOI
10.1007/978-3-030-97568-5_3
Publisher site
See Chapter on Publisher Site

Abstract

[In many real-world applications, relationships between two different types of entities (e.g., user-item people-location and author-paper) are naturally modeled as bipartite networks. When analyzing bipartite networks, CSMs and CSS techniques play an important role in many aspects including network measurement, dense region discovering, and network reinforcement. To meet the high demands in the era of big data, novel CSMs and CSS solutions over bipartite networks have been proposed recently. In this chapter, we extensively review existing studies of CSS over bipartite networks in the literature. Specifically, we discuss the core-, truss-, clique-, connectivity-, and density-based models and the solutions to search subgraphs following these models over bipartite networks.]

Published: Feb 23, 2022

There are no references for this article.