UnkClus: Efficient clustering via heterogeneous semantic links

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 427-438

  Yin, Xiaoxin ^a   Han, Jiawei ^a   Yu, Philip S ^b  

^a UIUC   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; BASED CLUSTERING; CLUSTERING METHODS; CLUSTERINGS; PROPERTY; RELATIONAL DATABASE; SEMANTIC LINK; SIMILARITY BETWEEN OBJECTS; SIMRANK; TYPED LINKS;

PURGING;

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

References (22)

1. C.C. Aggarwal, C. Procopiuc, J.L. Wolf, P.S. Yu, J.S. Park. Past algorithms for projected clustering. SIGMOD, 1999.
2. R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. SIGMOD, 1993.
3. R. Bekkerman, R. El-Yaniv, A. McCallum. Multi-way distributional clustering via pairwise interactions. ICML, 2005.
4. D. Chakrabarti, S. Papadimitriou, D.S. Modha, C. Paloutsos. Fully automatic cross-associations. KDD, 2004.
5. Y. Cheng, C. M. Church. Biclustering of expression data. ISMB, 2000.
6. DBLP Bibliography, www.informatik.uni-trier.de/~ley/db/
7. LS. Dhillon, S. Mallela, D.S. Modha. Information-theoretic co-clustering. KDD, 2003.
8. M. Faloutsos, P. Faloutsos, C. Faloutsos. On power-law relationships of the Internet topology. SIGCOMM, 1999.
9. D. Fogaras, B. Râcz. Scaling link-base similarity search. WWW, 2005.
10. S. Guha, R. Rastogi, K. Shim. CURE: an efficient clustering algorithm for large databases. SIGMOD, 1998.
11. J. Han, J. Wang, Y. Lu, P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. ICDM, 2002.
12. G. Jeh and J. Widom. SimRank: A measure of structural-context similarity. KDD, 2002.
13. M. Kirsten, S. Wrobel. Relational distance-based clustering - IIP, 1998.
14. J. MacQueen. Some methods for classification and analysis of multivariate observations. Berkeley Sym., 1967.
15. R.T. Ng, J. Han. Efficient and effective clustering methods for spatial data mining. VLDB, 1994.
16. F. Nielsen. Email dataset, http://www.imm.dtu.dk/~rem/data/Kmail-1431. zip.
17. R. Sibson. SLINK: An optimally efficient algorithm for the single-link cluster method. The Computer Journal, 16(1):30-34, 1973.
18. P.-N. Tan, M. Steinbach, W. Kumar. Introdution to data mining. Addison-Wesley, 2005.
19. J. Wang, J, Han, J. Pei. CLOSET+: searching for the best strategies for mining frequent closed itemsets. KDD, 2003.
20. J.D. Wang, H.J. Zeng, Z. Chen, H.J. Lu, L. Tao, W.Y. Ma. ReCoM: Reinforcement clustering of multi-type interrelated data objects. SIGIH, 2003.
21. X. Yin, J. Han, P.S. Yu. Cross-relational clustering with user's guidance. KDD, 2005.
22. T. Zhang, R. Ramakrishnan, M. Livny. BIRCH: An efficient data clustering method for very large databases. SIGMOD, 1996.