Graphs are widely used to model real-world objects and their relationships, and large graph data sets are common in many application domains. To understand the underlying characteristics of large graphs, graph summarization techniques are critical. Existing graph summarization methods are mostly statistical (studying statistics such as degree distributions, hop-plots, and clustering coefficients). These statistical methods are very useful, but the resolutions of the summaries are hard to control. In this chapter, we introduce database-style operations to summarize graphs. Like the OLAP-style aggregation methods that allow users to interactively drill-down or roll-up to control the resolution of summarization, the methods described in this chapter provide an analogous functionality for large graph data sets.
CITATION STYLE
Tian, Y., & Patel, J. M. (2010). Interactive graph summarization. In Link Mining: Models, Algorithms, and Applications (Vol. 9781441965158, pp. 389–409). Springer New York. https://doi.org/10.1007/978-1-4419-6515-8_15
Mendeley helps you to discover research relevant for your work.