Graph Mining Laws, Tools, and Case Studies

[Prohibitive]

Deepayan Chakrabarti, Christos Faloutsos | 2012 | ISBN: 1608451151 | English | 208 pages | PDF | 7 MB
Series: Synthesis Lectures on Data Mining and Knowledge Discovery

What does the Web look like? How can we find patterns, communities, outliers, in a social network? Which are the most central nodes in a network? These are the questions that motivate this work. Networks and graphs appear in many diverse settings, for example in social networks, computer-communication networks (intrusion detection, traffic management), protein-protein interaction networks in biology, document-text bipartite graphs in text retrieval, person-account graphs in financial fraud detection, and others.

In this work, first we list several surprising patterns that real graphs tend to follow. Then we give a detailed list of generators that try to mirror these patterns. Generators are important, because they can help with "what if" scenarios, extrapolations, and anonymization. Then we provide a list of powerful tools for graph analysis, and specifically spectral methods (Singular Value Decomposition (SVD)), tensors, and case studies like the famous "pageRank" algorithm and the "HITS" algorithm for ranking web search results. Finally, we conclude with a survey of tools and observations from related fields like sociology, which provide complementary viewpoints.

https://rapidgator.net/file/fab716b524b02fb1dd6a59da730a10d6/Graph-Mining.pdf

or
https://uploadgig.com/file/download/C5e40513a62e410a/Graph-Mining.pdf