{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:23Z","timestamp":1750307363260,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2010,10]]},"abstract":"<jats:p>Real-world applications often involve complex data that can be interpreted in many different ways. When clustering such data, there may exist multiple groupings that are reasonable and interesting from different perspectives. This is especially true for high-dimensional data, where different feature subspaces may reveal different structures of the data. However, traditional clustering is restricted to finding only one single clustering of the data. In this article, we propose a new clustering paradigm for exploratory data analysis: find all non-redundant clustering solutions of the data, where data points in the same cluster in one solution can belong to different clusters in other partitioning solutions. We present a framework to solve this problem and suggest two approaches within this framework: (1) orthogonal clustering, and (2) clustering in orthogonal subspaces. In essence, both approaches find alternative ways to partition the data by projecting it to a space that is orthogonal to the current solution. The first approach seeks orthogonality in the cluster space, while the second approach seeks orthogonality in the feature space. We study the relationship between the two approaches. We also combine our framework with techniques for automatically finding the number of clusters in the different solutions, and study stopping criteria for determining when all meaningful solutions are discovered. We test our framework on both synthetic and high-dimensional benchmark data sets, and the results show that indeed our approaches were able to discover varied clustering solutions that are interesting and meaningful.<\/jats:p>","DOI":"10.1145\/1839490.1839496","type":"journal-article","created":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T12:36:24Z","timestamp":1287491784000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Learning multiple nonredundant clusterings"],"prefix":"10.1145","volume":"4","author":[{"given":"Ying","family":"Cui","sequence":"first","affiliation":[{"name":"Yahoo! Labs, Sunnyvale, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoli Z.","family":"Fern","sequence":"additional","affiliation":[{"name":"Oregon State University, Corvallis, OR"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer G.","family":"Dy","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100705"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.37"},{"key":"e_1_2_1_4_1","unstructured":"Bay S. D. 1999. The UCI KDD archive. http:\/\/kdd.ics.uci.edu\/.  Bay S. D. 1999. The UCI KDD archive. http:\/\/kdd.ics.uci.edu\/."},{"key":"e_1_2_1_5_1","unstructured":"Blake C. and Merz C. 1998. UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html.  Blake C. and Merz C. 1998. UCI repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.103"},{"volume-title":"Proceedings of the Advances in Neural Information Processing Systems 15 (NIPS).","author":"Chechik G.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","unstructured":"CMU. 1997. CMU 4 universities WebKB data.  CMU. 1997. CMU 4 universities WebKB data."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.94"},{"volume-title":"Proceedings of the IEEE International Conference on Data Mining. 147--154","author":"Ding C.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460797.1460800"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0060-8"},{"key":"e_1_2_1_13_1","unstructured":"Duda R. O. and Hart P. E. 1973. Pattern Classification and Scene Analysis. Wiley &amp; Sons NY.  Duda R. O. and Hart P. E. 1973. Pattern Classification and Scene Analysis. Wiley &amp; Sons NY."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2014.11.006"},{"volume-title":"Proceedings of the International Conference on Machine Learning. 186--193","author":"Fern X. Z.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015414"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.990138"},{"key":"e_1_2_1_18_1","first-page":"768","article-title":"Cluster analysis of multivariate data: Efficiency vs. interpretability of classifications","volume":"21","author":"Forgy E.","year":"1965","journal-title":"Biometrics"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.113"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.754"},{"key":"e_1_2_1_21_1","unstructured":"Fukunaga K. 1990. Statistical Pattern Recognition (second edition). Academic Press San Diego CA.  Fukunaga K. 1990. Statistical Pattern Recognition (second edition). Academic Press San Diego CA."},{"key":"e_1_2_1_22_1","unstructured":"Gondek D. 2005. Non-redundant clustering. Ph.D. dissertation Brown University.   Gondek D. 2005. Non-redundant clustering. Ph.D. dissertation Brown University."},{"volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining, Workshop on Clustering Large Data Sets.","author":"Gondek D.","key":"e_1_2_1_23_1"},{"volume-title":"Proceedings of the 4th IEEE International Conference on Data Mining.","author":"Gondek D.","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081882"},{"volume-title":"Proceedings of SIAM International Conference on Data Mining.","author":"Gondek D.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"volume-title":"Proceedings of the 7th SIAM International Conference on Data Mining. 858--869","author":"Jain P.","key":"e_1_2_1_28_1"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Jolliffe I. T. 1986. Principal Component Analysis. Springer-Verlag New-York.  Jolliffe I. T. 1986. Principal Component Analysis. Springer-Verlag New-York.","DOI":"10.1007\/978-1-4757-1904-8"},{"volume-title":"Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). 97--100","author":"Kohonen T.","key":"e_1_2_1_30_1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.71"},{"volume-title":"Proceedings of the 5th Symposium on Mathematical Statistics and Probability, 1, 281--297","year":"1967","author":"Macqueen J.","key":"e_1_2_1_32_1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023949509487"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(83)90064-X"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"volume-title":"Proceedings of the 17th International Conference on Machine Learning. 727--734","year":"2000","author":"Pelleg D.","key":"e_1_2_1_36_1"},{"volume-title":"Proceedings of the International Conference on Computational Statistics. 123--129","author":"Roth V.","key":"e_1_2_1_37_1"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244303321897735"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244303321897735"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00293"},{"volume-title":"Proceedings of the 1st International Joint Conference Pattern Recognition. 25--32","author":"Watanabe L.","key":"e_1_2_1_42_1"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1839490.1839496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1839490.1839496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:35Z","timestamp":1750245755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1839490.1839496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["10.1145\/1839490.1839496"],"URL":"https:\/\/doi.org\/10.1145\/1839490.1839496","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2010,10]]},"assertion":[{"value":"2008-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}