Learning multiple nonredundant clusterings

ACM Transactions on Knowledge Discovery from Data

Volumn 4, Issue 3, 2010, Pages

  Cui, Ying ^a   Fern, Xiaoli Z ^b   Dy, Jennifer G ^c  

^a YAHOO INC   (United States)

^b Oregon State University   (United States)

^c Northeastern University   (United States)

Author keywords

Disparate clustering; Diverse clustering; Nonredundant clustering; Orthogonalization

Indexed keywords

BELONG TO; BENCHMARK DATA; CLUSTERING SOLUTIONS; CLUSTERINGS; COMPLEX DATA; DATA POINTS; DIFFERENT STRUCTURE; DISPARATE CLUSTERING; DIVERSE CLUSTERING; EXPLORATORY DATA ANALYSIS; FEATURE SPACE; FEATURE SUBSPACE; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; NON-REDUNDANT CLUSTERING; NUMBER OF CLUSTERS; ORTHOGONAL SUBSPACES; ORTHOGONALITY; ORTHOGONALIZATION; REAL-WORLD APPLICATION; STOPPING CRITERIA; TRADITIONAL CLUSTERING;

CLUSTER ANALYSIS;

EID: 78049323340     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1839490.1839496     Document Type: Article

References (43)

1. AGRAWAL, R., GEHRKE, J., GUNOPULOS, D., AND RAGHAVAN, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 94-105.
2. ACM Transactions on Knowledge Discovery from Data, Vol. 4, No. 3, Article 15, Pub. date: October 2010.
3. AKAIKE, H. 1974. A new look at the statistical model identification. IEEE Trans. Autom. Control 19, 6, 716-723.
4. BAE, E. AND BAILEY, J. 2006. Coala: A novel approach for the extraction of an alternate clustering of high quality and high dissimilarity. In Proceedings of the 6th International Conference on Data Mining. 53-62.
5. BAY, S. D. 1999. The UCI KDD archive. http://kdd.ics.uci.edu/.
6. BLAKE, C. AND MERZ, C. 1998. UCI repository of machine learning databases. http://www.ics.uci.edu/mlearn/MLRepository.html.
7. CARUANA, R., ELHAWARY, M., NGUYEN, N., AND SMITH, C. 2006. Meta clustering. In Proceedings of the 6th International Conference on Data Mining. Hong Kong, 107-118.
8. CHECHIK, G. AND TISHBY, N. 2003. Extracting relevant structures with side information. In Proceedings of the Advances in Neural Information Processing Systems 15 (NIPS).
9. CMU. 1997. CMU 4 universities WebKB data.
10. CUI, Y., FERN, X., AND DY, G. J. 2007. Non-redundant multi-view clustering via orthogonalization. In Proceedings of the IEEE International Conference on Data Mining. 133-142.
11. DING, C., HE, X., ZHA, H., AND SIMON, H. 2002. Adaptive dimension reduction for clustering high dimensional data. In Proceedings of the IEEE International Conference on Data Mining. 147-154.
12. DOMENICONI, C. AND AL-RAZGAN, M. 2009. Weighted cluster ensembles: Methods and analysis. ACM Trans. Knowl. Disc. Data 2, 4 (January), 1-40.
13. DOMENICONI, C., GUNOPULOS, D., MA, S., YAN, B., AL-RAZGAN, M., AND PAPADOPOULOS, D. 2007. Locally adaptive metrics for clustering high dimensional data. Data Mining and Knowledge Discovery Journal 14, 63-97.
14. DUDA, R. O. AND HART, P. E. 1973. Pattern Classification and Scene Analysis. Wiley & Sons, NY.
15. DY, J. G. AND BRODLEY, C. E. 2004. Feature selection for unsupervised learning. J. Mach. Learn. Res. 5, 845-889.
16. FERN, X. Z. AND BRODLEY, C. E. 2003. Random projection for high dimensional data clustering: A cluster ensemble approach. In Proceedings of the International Conference on Machine Learning. 186-193.
17. FERN, X. Z. AND BRODLEY, C. E. 2004. Solving cluster ensemble problems by bipartite graph partitioning. In Proceedings of the International Conference on Machine Learning.
18. FIGUEIREDO, M. A. T., AND JAIN, A. K. 2002. Unsupervised learning of finite mixture models. IEEE Trans. Patt. Anal. Mach. Intell. 24, 3 (Mar.), 381-396.
19. FORGY, E. 1965. Cluster analysis of multivariate data: Efficiency vs. interpretability of classifications. Biometrics 21, 768.
20. FRED, A. L. N. AND JAIN, A. K. 2005. Combining multiple clusterings using evidence accumulation. IEEE Trans. Patt. Anal. Mach. Intell. 27, 6 (June), 835-850.
21. FRED, A. L. N. AND JAIN, A. K. 2006. Learning pairwise similarity for data clustering. In Proceedings of the International Conference on Pattern Recognition (ICPR). Vol. 1. 925-928.
22. FUKUNAGA, K. 1990. Statistical Pattern Recognition (second edition). Academic Press, San Diego, CA.
23. GONDEK, D. 2005. Non-redundant clustering. Ph. D. dissertation, Brown University.
24. GONDEK, D. AND HOFMANN, T. 2003. Conditional information bottleneck clustering. In Proceedings of the 3rd IEEE International Conference on Data Mining, Workshop on Clustering Large Data Sets.
25. GONDEK, D. AND HOFMANN, T. 2004. Non-redundant data clustering. In Proceedings of the 4th IEEE International Conference on Data Mining.
26. GONDEK, D. AND HOFMANN, T. 2005. Non-redundant clustering with conditional ensembles. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'05). 70-77.
27. Gondek, D., VAITHYANATHAN, S., AND GARG, A. 2005. Clustering with model-level constraints. In Proceedings of SIAM International Conference on Data Mining.
28. JAIN, A. K., MURTY, M. N., AND FLYNN, P. J. 1999. Data clustering: A review. ACM Computing Surveys 31, 3, 264-323.
29. JAIN, P., MEKA, R., AND DHILLON, I. S. 2008. Simultaneous unsupervised learning of disparate clusterings. In Proceedings of the 7th SIAM International Conference on Data Mining. 858-869.
30. JOLLIFFE, I. T. 1986. Principal Component Analysis. Springer-Verlag, New-York.
31. KOHONEN, T., NEMETH, G., BRY, K. J., JALANKO, M., AND RIITTINEN, H. 1979. Spectral classification of phenomes by learning subspaces. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). 97-100.
32. LAW, M., FIGUEIREDO, M., AND JAIN, A. K. 2004. Simultaneous feature selection and clustering using a mixture model. IEEE Trans. Patt. Anal. Mach. Intell. 26, 9 (Sept.), 1154-1166.
33. MACQUEEN, J. 1967. Some methods for classifications and analysis of multivariate observations. Proceedings of the 5th Symposium on Mathematical Statistics and Probability, 1, 281-297.
34. MONTI, S., PABLO, T., MESIROV, J., AND GOLUB, T. 2003. Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data. Mach. Learn. 52, 91-118.
35. OJA, E. AND KUUSELA, M. 1983. The alsm algorithm-an improved subspace method of classification. Patt. Recog. 4, 16, 421-427.
36. PARSONS, L., HAQUE, E., AND LIU, H. 2004. Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl. 6, 1, 90-105.
37. PELLEG, D. 2000. X-means: Extending k-means with efficient estimation of the number of clusters. In Proceedings of the 17th International Conference on Machine Learning. 727-734.
38. ROTH, V., LANGE, T., BRAUN, M., AND BUHMANN, J. 2002. A resampling approach to cluster validation. In Proceedings of the International Conference on Computational Statistics. 123-129.
39. SCHWARZ, G. 1978. Estimating the dimension of a model. Ann. Stat. 6, 2, 461-464.
40. STREHL, A. AND GHOSH, J. 2002a. Cluster ensembles-a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 583-617.
41. STREHL, A. AND GHOSH, J. 2002b. Cluster ensembles-a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583-617.
42. TIBSHIRANI, R., WALTHER, G., AND HASTIE, T. 2001. Estimating the number of clusters in a dataset via the gap statistic. J. Roy. Statist. Soc. 63, 2, 411-423.
43. WATANABE, L. AND PAKVASA, N. 1973. Subspace method of pattern recognition. In Proceedings of the 1st International Joint Conference Pattern Recognition. 25-32.