Tracked shipping to South Africa with premium packaging for just R199 

Ship to
South Africa
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Cohesive Subgraph Search Over Large Heterogeneous Information Networks
Type
Physical Book
Author
Publisher
Language
English
Pages
74
Format
Paperback
Dimensions
23.4 x 15.6 x 0.5 cm
Weight
0.15 kg.
ISBN13
9783030975678
Categories

Cohesive Subgraph Search Over Large Heterogeneous Information Networks

Kai Wang (Author) · Xuemin Lin (Author) · Yixiang Fang (Author) · Springer · Paperback

Cohesive Subgraph Search Over Large Heterogeneous Information Networks - Fang, Yixiang ; Wang, Kai ; Lin, Xuemin

Cheaper New Book Imported to South Africa
Delivery: 21 Jul - 18 Aug Shipping: 12 to 16 business days.
R 869
Faster New Book Imported to South Africa
Delivery: 09 Jul - 03 Aug Shipping: 4 to 5 business days.
R 1,058
R 869

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Cohesive Subgraph Search Over Large Heterogeneous Information Networks"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews