Summarization-based mining bipartite graphs

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1249-1257

  Feng, Jing ^a   He, Xiao ^a   Konte, Bettina ^a   Böhm, Christian ^a   Plant, Claudia ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b FLORIDA STATE UNIVERSITY   (United States)

Author keywords

bipartite graph; clustering; link prediction; summarization

Indexed keywords

BIPARTITE GRAPHS; CLUSTERING; CO-CLUSTERING; COMPACT REPRESENTATION; COMPRESSION SCHEME; DATA MINING TASKS; GRAPH CLUSTERING; HIDDEN STRUCTURES; INPUT GRAPHS; INPUT PARAMETER; LINK PREDICTION; NOVEL ALGORITHM; RELATIONAL DATA; SUMMARIZATION; SYNTHETIC AND REAL DATA;

ALGORITHMS; DATA COMPRESSION; DATA MINING; FORECASTING;

GRAPH THEORY;

EID: 84866005812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339725     Document Type: Conference Paper

References (22)

1. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, pages 79-88, 2004.
2. H. Cho, I. S. Dhillon, Y. Guan, and S. Sra. Minimum sum-squared residue co-clustering of gene expression data. In SDM, 2004.
3. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD, pages 269-274, 2001.
4. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD, pages 89-98, 2003.
5. T. George and S. Merugu. A scalable collaborative filtering framework based on co-clustering. In ICDM, pages 625-628, 2005.
6. M. A. Hasan, V. Chaoji, S. Salem, and M. Zaki. Link prediction using supervised learning. In Proc. of SDM Workshop on Link Analysis, 2006.
7. L. B. Holder, D. J. Cook, and S. Djoko. Substucture discovery in the subdue system. In KDD Workshop, pages 169-180, 1994.
8. L. Katz. A new status index derived from sociometric analysis. PSYCHOMETRIKA, 18(1):39-43, 1953.
9. J. Kunegis, E. W. D. Luca, and S. Albayrak. The link prediction problem in bipartite networks. CoRR, abs/1006.5367, 2010.
10. D. Liben-Nowell and J. M. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556-559, 2003.
11. R. Lichtenwalter, J. T. Lussier, and N. V. Chawla. New perspectives and methods in link prediction. In KDD, pages 243-252, 2010.
12. B. Long, X. Wu, Z. M. Zhang, P. S. Yu, and P. S. Yu. Unsupervised learning on k-partite graphs. In KDD, pages 317-326, 2006.
13. B. Long, Z. M. Zhang, P. S. Yu, and P. S. Yu. Co-clustering by block value decomposition. In KDD, pages 635-640, 2005.
14. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In SIGMOD, pages 419-432, 2008.
15. M. E. J. Newman. Clustering and preferential attachment in growing networks. PHYS.REV.E, 64:025102, 2001.
16. J. Rissanen. Information and Complexity in Statistical Modeling. Springer, 2007.
17. H. Shan and A. Banerjee. Bayesian co-clustering. In ICDM, pages 530-539, 2008.
18. A. Stolcke and S. M. Omohundro. Hidden markov model induction by bayesian model merging. In NIPS, pages 11-18, 1992.
19. A. Stolcke and S. M. Omohundro. Inducing probabilistic grammars by bayesian model merging. In ICGI, pages 106-118, 1994.
20. Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD, pages 567-580, 2008.
21. N. X. Vinh, J. Epps, and J. Bailey. Information theoretic measures for clusterings comparison: is a correction for chance necessary? In ICML, pages 1073-1080, 2009.
22. N. Zhang, Y. Tian, and J. M. Patel. Discovery-driven graph summarization. In ICDE, pages 880-891, 2010.