Graph Summarization Methods and Applications: A Survey

December 14, 2016 ยท The Cartographer ยท ๐Ÿ› ACM Computing Surveys

๐Ÿ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper โ€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: Graph Summarization Methods and Applications: A Survey"

Evidence collected by the PWNC Scanner

Authors Yike Liu, Tara Safavi, Abhilash Dighe, Danai Koutra arXiv ID 1612.04883 Category cs.IR: Information Retrieval Cross-listed cs.AI, cs.DB, cs.SI Citations 151 Venue ACM Computing Surveys Last Checked 8 days ago
Abstract
While advances in computing resources have made processing enormous amounts of data possible, human ability to identify patterns in such data has not scaled accordingly. Efficient computational methods for condensing and simplifying data are thus becoming vital for extracting actionable insights. In particular, while data summarization techniques have been studied extensively, only recently has summarizing interconnected data, or graphs, become popular. This survey is a structured, comprehensive overview of the state-of-the-art methods for summarizing graph data. We first broach the motivation behind, and the challenges of, graph summarization. We then categorize summarization approaches by the type of graphs taken as input and further organize each category by core methodology. Finally, we discuss applications of summarization on real-world graphs and conclude by describing some open problems in the field.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Retrieval