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.
Cited By
- Layne J, Carpenter J, Serra E and Gullo F (2023). Temporal SIR-GN: Efficient and Effective Structural Representation Learning for Temporal Graphs, Proceedings of the VLDB Endowment, 16:9, (2075-2089), Online publication date: 1-May-2023.
- Rossi R, Jin D, Kim S, Ahmed N, Koutra D and Lee J (2020). On Proximity and Structural Role-based Embeddings in Networks, ACM Transactions on Knowledge Discovery from Data, 14:5, (1-37), Online publication date: 21-Aug-2020.
- Yan Y, Zhu J, Duda M, Solarz E, Sripada C and Koutra D GroupINN Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (772-782)
- Liu Y, Safavi T, Dighe A and Koutra D (2018). Graph Summarization Methods and Applications, ACM Computing Surveys, 51:3, (1-34), Online publication date: 31-May-2019.
- Safavi T, Davoodi M and Koutra D Career Transitions and Trajectories Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (675-684)
- Heimann M, Shen H, Safavi T and Koutra D REGAL Proceedings of the 27th ACM International Conference on Information and Knowledge Management, (117-126)
Index Terms
- Individual and Collective Graph Mining: Principles, Algorithms, and Applications
Recommendations
Collapsible subgraphs of a 4-edge-connected graph
AbstractJaeger in 1979 showed that every 4-edge-connected graph is supereulerian, graphs that have spanning eulerian subgraphs. Catlin in 1988 sharpened Jaeger’s result by showing that every 4-edge-connected graph is collapsible, graphs that ...