机读格式显示(MARC)
- 000 03295nam a2200301 a 4500
- 008 180131s2018 caua b 000 0 eng d
- 020 __ |a 9781681730394 (pbk.)
- 020 __ |a 9781681730400 (ebook)
- 100 1_ |a Koutra, Danai, |e author
- 245 10 |a Individual and Collective Graph Mining : |b Principles, Algorithms, and Applications / |c Danai Koutra, Christos Faloutsos.
- 260 __ |a San Rafael : |b Morgan & Claypool Publishers, |c 2018.
- 300 __ |a xi, 194 p. : |b ill ; |c 26 cm.
- 490 0_ |a Synthesis lectures on data mining and knowledge discovery, |x 2151-0075 ; |v # 14
- 490 0_ |a Synthesis digital library of engineering and computer science.
- 504 __ |a Includes bibliographical references (pages 171-192)
- 520 8_ |a Annotation |b Graphs naturally represent information ranging from links between web pages, to communication in email networks, to connections between neurons in our brains. These graphs often span billions of nodes and interactions between them. Within this deluge of interconnected data, how can we find the most important structures and summarize them? How can we efficiently visualize them? How can we detect anomalies that indicate critical events, such as an attack on a computer system, disease formation in the human brain, or the fall of a company?This book presents scalable, principled discovery algorithms that combine globality with locality to make sense of one or more graphs. In addition to fast algorithmic methodologies, we also contribute graph-theoretical ideas and models, and real-world applications in two main areas:*Individual Graph Mining: We show how to interpretably summarize a single graph by identifying its important graph structures. We complement summarization with inference, which leverages information about few entities (obtained via summarization or other methods) and the network structure to efficiently and effectively learn information about the unknown entities.*Collective Graph Mining: We extend the idea of individual-graph summarization to time-evolving graphs, and show how to scalably discover temporal patterns. Apart from summarization, we claim that graph similarity is often the underlying problem in a host of applications where multiple graphs occur (e.g., temporal anomaly detection, discovery of behavioral patterns), and we present principled, scalable algorithms for aligning networks and measuring their similarity.The methods that we present in this book leverage techniques from diverse areas, such as matrix algebra, graph theory, optimization, information theory, machine learning, finance, and social science, to solve real-world problems. We present applications of our exploration algorithms to massive datasets, including a Web graph of 6.6 billion edges, a Twitter graph of 1.8 billion edges, brain graphs with up to 90 million edges, collaboration, peer-to-peer networks, browser logs, all spanning millions of users and interactions.
- 650 _0 |a Graph theory |x Data processing.
- 650 _0 |a Graphic methods |x Data processing.
- 700 1_ |a Faloutsos, Christos, |e author
- 950 __ |a JHUL |b TP311.13 |c K88