Individual and Collective Graph Mining: Principles, Algorithms, and Applications: Synthesis Lectures on Data Mining and Knowledge Discovery
Autor Danai Koutra, Christos Faloutsosen Limba Engleză Paperback – 26 oct 2017
- 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.
Din seria Synthesis Lectures on Data Mining and Knowledge Discovery
- 20% Preț: 173.73 lei
- 20% Preț: 339.50 lei
- 20% Preț: 325.73 lei
- 20% Preț: 345.06 lei
- 20% Preț: 341.06 lei
- 20% Preț: 372.45 lei
- 20% Preț: 369.43 lei
- 20% Preț: 161.83 lei
- 20% Preț: 216.41 lei
- 20% Preț: 215.47 lei
- 20% Preț: 163.23 lei
- 20% Preț: 214.04 lei
- 20% Preț: 220.41 lei
- 20% Preț: 220.86 lei
- 20% Preț: 287.30 lei
- 20% Preț: 199.72 lei
- 20% Preț: 159.13 lei
- 20% Preț: 171.21 lei
- 20% Preț: 315.30 lei
- 20% Preț: 369.58 lei
- Preț: 399.13 lei
Preț: 372.90 lei
Preț vechi: 466.13 lei
-20% Nou
Puncte Express: 559
Preț estimativ în valută:
71.37€ • 75.04$ • 59.36£
71.37€ • 75.04$ • 59.36£
Carte tipărită la comandă
Livrare economică 27 decembrie 24 - 10 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031007835
ISBN-10: 3031007832
Ilustrații: XI, 197 p.
Dimensiuni: 191 x 235 mm
Greutate: 0.37 kg
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Data Mining and Knowledge Discovery
Locul publicării:Cham, Switzerland
ISBN-10: 3031007832
Ilustrații: XI, 197 p.
Dimensiuni: 191 x 235 mm
Greutate: 0.37 kg
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Data Mining and Knowledge Discovery
Locul publicării:Cham, Switzerland
Cuprins
Acknowledgments.- Introduction.- Summarization of Static Graphs.- Inference in a Graph.- Summarization of Dynamic Graphs.- Graph Similarity.- Graph Alignment.- Conclusions and Further Research Problems.- Bibliography.- Authors' Biographies .
Notă biografică
Danai Koutra is an Assistant Professor in Computer Science and Engineering at University of Michigan, Ann Arbor. Her research interests include large-scale graph mining, graph similarity and matching, graph summarization, and anomaly detection. Danai’s research has been applied mainly to social, collaboration, and web networks, as well as brain connectivity graphs. She holds one ""rate-1"" patent and has six (pending) patents on bipartite graph alignment. Danai won the 2016 ACM SIGKDD Dissertation award, and an honorable mention for the SCS Doctoral Dissertation Award (CMU). She has multiple papers in top data mining conferences, including two award-winning papers, she has given three tutorials, and her work has been covered by the popular press, such as the MIT Technology Review. She has worked at IBM Watson, Microsoft Research, and Technicolor. She earned her Ph.D. and M.S. in Computer Science from CMU in 2015 and her diploma in Electrical and Computer Engineering at the National Technical University of Athens in 2010.Christos Faloutsos is a Professor at Carnegie Mellon University. He has received the Presidential Young Investigator Award by the National Science Foundation (1989), the Research Contributions Award in ICDM 2006, the SIGKDD Innovations Award (2010), 24 ""best paper"" awards (including 5 ""test of time"" awards), and 4 teaching awards. Six of his advisees have attracted KDD or SCS dissertation awards, He is an ACM Fellow, he has served as a member of the executive committee of SIGKDD; he has published over 350 refereed articles, 17 book chapters, and 2 monographs. He holds seven patents (and 2 pending), and he has given over 40 tutorials and over 20 invited distinguished lectures. His research interests include large-scale data mining with emphasis on graphs and time sequences; anomaly detection, tensors, and fractals.