Spectral clustering for multi-type relational data

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 585-592

  Long, Bo ^a   Zhang, Zhongfei ^a   Wu, Xiaoyun ^b   Yu, Philip S ^c  

^a State University of New York at Binghamton   (United States)

^b YAHOO INC   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MULTI-TYPE RELATIONAL DATA CLUSTERING; RELATIONAL DATA; SPECTRAL RELATIONAL CLUSTERING;

ALGORITHMS; DATA MINING; ELECTRONIC COMMERCE; ITERATIVE METHODS; MATHEMATICAL MODELS; SPECTRUM ANALYSIS; WORLD WIDE WEB;

RELATIONAL DATABASE SYSTEMS;

EID: 33749235905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Bach, F. R., & Jordan, M. I. (2004). Learning spectral clustering. Advances in Neural Information Processing Systems 16.
2. Banerjee, A., Dhillon, I. S., Ghosh, J., Merugu, S., & Modha, D. S. (2004). A generalized maximum entropy approach to bregman co-clustering and matrix approximation. KDD (pp. 509-514).
3. Bhatia, R. (1997). Matrix analysis. New York: Springeer-Cerlag.
4. Chan, P. K., Schlag, M. D. F., & Zien, J. Y. (1993). Spectral k-way ratio-cut partitioning and clustering. DAC '93 (pp. 749-754).
5. D.D.Lee, & H.S.Seung (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401, 788-791.
6. Dhillon, I. S. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. KDD (pp. 269-274).
7. Dhillon, I. S., Mallela, S., & Modha, D. S. (2003). Information-theoretic co-clustering. KDD'03 (pp. 89-98).
8. Ding, C., He, X., & Simon, H. (2005). On the equivalence of non-negative matrix factorization and spectral clustering. SDM'05.
9. Ding, C. H. Q., & He, X. (2004). Linearized cluster assignment via spectral ordering. ICML.
10. Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D. (2001). A min-max cut algorithm for graph partitioning and data clustering. Proceedings of ICDM 2001 (pp. 107-114).
11. El-Yaniv, R., & Souroujon, O. (2001). Iterative double clustering for unsupervised and semi-supervised learning. ECML (pp. 121-132).
12. Gao, B., Liu, T.-Y, Zheng, X., Cheng, Q.-S., & Ma, W.-Y (2005). Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. KDD '05 (pp. 41-50).
13. G.Golub, & Loan, C. (1989). Matrix computations. Johns Hopkins University Press.
14. Hofmann, T. (1999). Probabilistic latent semantic analysis. Proc. of Uncertainty in Artificial Intelligence, UAI'99, Stockholm.
15. Hofmann, T., & Puzicha, J. (1999). Latent class models for collaborative filtering. IJCAI'99. Stockholm.
16. H.Zha, C.Ding, M. X., & H.Simon (2001). Bi-partite graph partitioning and data clustering. ACM CIKM'01.
17. Lang, K. (1995). News weeder: Learning to filter netnews. ICML.
18. Li, T. (2005). A general model for clustering binary data. KDD'05.
19. Long, B., Zhang, Z. M., & Yu, P. S. (2005). Co-clustering by block value decomposition. KDD'05.
20. Ng, A., Jordan, M., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems 14.
21. R.O.Duda, P.E.Hart, & D.G.Stork. (2000). Pattern classification. New York: John Wiley & Sons.
22. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888-905.
23. Strehl, A., & Ghosh, J. (2002). Cluster ensembles - a knowledge reuse framework for combining partitionings. AAAI 2002 (pp. 93-98). AAAI/MIT Press.
24. Taskar, B., Segal, E., & Koller, D. (2001). Probabilistic classification and clustering in relational data. Proceeding of IJCAI-01.
25. Tishby, N., Pereira, P., & Bialek, W. (1999). The information bottleneck method. Proceedings of the 37-th Annual Allerton Conference on Communication, Control and Computing (pp. 368-377).
26. Wang, J., Zeng, H., Chen, Z., Lu, H., Tao, L., & Ma, W.-Y. (2003). Recom: reinforcement clustering of multi-type interrelated data objects. SIGIR '03 (pp. 274-281).
27. Zeng, H.-J., Chen, Z., & Ma, W.-Y. (2002). A unified framework for clustering heterogeneous web objects. WISE '02 (pp. 161-172).
28. Zha, H., Ding, C., Gu, M., He, X., & Simon, H. (2002). Spectral relaxation for k-means clustering. Advances in Neural Information Processing Systems, 14.