Advertisement

On Summarizing Graph Homogeneously

  • Zheng Liu
  • Jeffrey Xu Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6637)

Abstract

Graph summarization is to obtain a concise representation of a large graph, which is suitable for visualization and analysis. The main idea is to construct a super-graph by grouping similar nodes together. In this paper, we propose a new information-preserving approach for graph summarization, which consists of two parts: a super-graph and a list of probability distribution vectors affiliated to the super-nodes and super-edges. After a carefully analysis of the approximately homogenous grouping, we propose a unified model using information theory to relax all conditions and measure the quality of the summarization. We also develop a new lazy algorithm to compute the exactly homogenous grouping, as well as two algorithms to compute the approximate grouping. We conducted experiments and confirmed that our approaches can efficiently summarize attributed graphs homogeneously and achieve low entropy.

Keywords

Binary Vector Attribute Vector Categorical Attribute Approximate Algorithm Large Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: SODA, pp. 679–688 (2003)Google Scholar
  3. 3.
    Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley-Interscience, New York (1991)CrossRefzbMATHGoogle Scholar
  4. 4.
    Hofmann, T.: Probabilistic latent semantic indexing. In: SIGIR, pp. 50–57 (1999)Google Scholar
  5. 5.
    Maserrat, H., Pei, J.: Neighbor query friendly compression of social networks. In: KDD, pp. 533–542 (2010)Google Scholar
  6. 6.
    Navlakha, S., Rastogi, R., Shrivastava, N.: Graph summarization with bounded error. In: SIGMOD Conference, pp. 419–432 (2008)Google Scholar
  7. 7.
    Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: ICDE, pp. 405–416 (2003)Google Scholar
  9. 9.
    Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: SIGMOD Conference, pp. 567–580 (2008)Google Scholar
  10. 10.
    Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: KDD, pp. 314–323 (2005)Google Scholar
  11. 11.
    Zhai, C., Velivelli, A., Yu, B.: A cross-collection mixture model for comparative text mining. In: KDD, pp. 743–748 (2004)Google Scholar
  12. 12.
    Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: ICDE, pp. 880–891 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Zheng Liu
    • 1
  • Jeffrey Xu Yu
    • 1
  1. 1.The Chinese University of Hong KongHong Kong

Personalised recommendations