0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Databases

Buy Now

Cohesive Subgraph Search Over Large Heterogeneous Information Networks (Paperback, 1st ed. 2022) Loot Price: R1,140
Discovery Miles 11 400
Cohesive Subgraph Search Over Large Heterogeneous Information Networks (Paperback, 1st ed. 2022): Yixiang Fang, Kai Wang,...

Cohesive Subgraph Search Over Large Heterogeneous Information Networks (Paperback, 1st ed. 2022)

Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang

Series: SpringerBriefs in Computer Science

 (sign in to rate)
Loot Price R1,140 Discovery Miles 11 400 | Repayment Terms: R107 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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, etc., 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.

General

Imprint: Springer Nature Switzerland AG
Country of origin: Switzerland
Series: SpringerBriefs in Computer Science
Release date: May 2022
First published: 2022
Authors: Yixiang Fang • Kai Wang • Xuemin Lin • Wenjie Zhang
Dimensions: 235 x 155mm (L x W)
Format: Paperback
Pages: 74
Edition: 1st ed. 2022
ISBN-13: 978-3-03-097567-8
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > Applications of computing > Databases > General
Promotions
LSN: 3-03-097567-3
Barcode: 9783030975678

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners