作者: Danai Koutra , Christos Faloutsos
DOI:
关键词: Web page 、 Anomaly detection 、 Theoretical computer science 、 Automatic summarization 、 Visualization 、 Algorithm 、 Locality 、 Globality 、 Machine learning 、 Scalability 、 Artificial intelligence 、 Computer science 、 Inference
摘要: Abstract Graphs naturally represent information ranging from links between web pages, to communication in email networks, connections neurons our brains. These graphs often span billions of nodes and interactions them. Within this deluge interconnected data, how can we find the most important structures summarize them? How efficiently visualize detect anomalies that indicate critical events, such as an attack on a computer system, disease formation human brain, or fall company? This book presents scalable, principled discovery algorithms combine globality with locality make sense one more graphs. In addition fast algorithmic methodologies, also contribute graph-theoretical ideas models, real-world applications two main areas: •Individual Graph Mining: We show interpretably single graph by identifying its structures. complement summarization inference, which leverag...