bokomslag Community Search over Big Graphs
Data & IT

Community Search over Big Graphs

Xin Huang Laks V S Lakshmanan Jianliang Xu

Pocket

919:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-15 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 188 sidor
  • 2019
Communities serve as basic structural building blocks for understanding the organization of many real-world networks, including social, biological, collaboration, and communication networks. Recently, community search over graphs has attracted significantly increasing attention, from small, simple, and static graphs to big, evolving, attributed, and location-based graphs. In this book, we first review the basic concepts of networks, communities, and various kinds of dense subgraph models. We then survey the state of the art in community search techniques on various kinds of networks across different application areas. Specifically, we discuss cohesive community search, attributed community search, social circle discovery, and geo-social group search. We highlight the challenges posed by different community search problems. We present their motivations, principles, methodologies, algorithms, and applications, and provide a comprehensive comparison of the existing techniques. This book finally concludes by listing publicly available real-world datasets and useful tools for facilitating further research, and by offering further readings and future directions of research in this important and growing area.
  • Författare: Xin Huang, Laks V S Lakshmanan, Jianliang Xu
  • Format: Pocket/Paperback
  • ISBN: 9783031007460
  • Språk: Engelska
  • Antal sidor: 188
  • Utgivningsdatum: 2019-08-07
  • Förlag: Springer International Publishing AG