Producing accurate interpretable clusters from high-dimensional data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3721 LNAI, Issue , 2005, Pages 486-494

  Greene, Derek ^a   Cunningham, Pádraig ^a  

^a TRINITY COLLEGE DUBLIN   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STATISTICAL METHODS; TEXT PROCESSING; WORD PROCESSING;

CLUSTER ANALYSIS; CO-CLUSTERING MODEL; HIGH-DIMENSIONAL DATA;

DATA REDUCTION;

EID: 33646417616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564126_49     Document Type: Conference Paper

References (9)

1. Greene, D., Cunningham, P.: Producing accurate interpretable clusters from highdimensional data. Technical Report CS-2005-42, Trinity College Dublin (2005)
2. Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: Analysis and an algorithm. In: Proc. Advances in Neural Information Processing. (2001)
3. Brand, M., Huang, K.: A unifying theorem for spectral embedding and clustering. In: Proc. 9th Int. Workshop on AI and Statistics. (2003)
4. Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Knowledge Discovery and Data Mining. (2001) 269-274
5. Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401 (1999) 788-91
6. Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proc. 26th Int. ACM SIGIR. (2003) 267-273
7. Dhillon, I.S., Modha, D.S.: Concept decompositions for large sparse text data using clustering. Machine Learning 42 (2001) 143-175
8. Zhao, Y., Karypis, G.: Soft clustering criterion functions for partitional document clustering: a summary of results. In: Proc. 13th ACM Conf. on Information and Knowledge Management. (2004) 246-247
9. Strehl, A., Ghosh, J.: Cluster ensembles - a knowledge reuse framework for combining multiple partitions. JMLR 3 (2002) 583-617