{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:05:53Z","timestamp":1759133153118},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,6,29]],"date-time":"2013-06-29T00:00:00Z","timestamp":1372464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10994-013-5395-y","type":"journal-article","created":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T19:58:37Z","timestamp":1372449517000},"page":"181-216","source":"Crossref","is-referenced-by-count":11,"title":["Metacluster-based Projective Clustering Ensembles"],"prefix":"10.1007","volume":"98","author":[{"given":"Francesco","family":"Gullo","sequence":"first","affiliation":[]},{"given":"Carlotta","family":"Domeniconi","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Tagarelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,29]]},"reference":[{"key":"5395_CR1","first-page":"446","volume-title":"Proc. European conf. on principles and practice of knowledge discovery in databases (PKDD)","author":"E. Achtert","year":"2006","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H., Kr\u00f6ger, P., M\u00fcller-Gorman, I., & Zimek, A. (2006). Finding hierarchies of subspace clusters. In Proc. European conf. on principles and practice of knowledge discovery in databases (PKDD) (pp. 446\u2013453)."},{"key":"5395_CR2","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-540-71703-4_15","volume-title":"Proc. int. conf. on database systems for advanced applications (DASFAA)","author":"E. Achtert","year":"2007","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H., Kr\u00f6ger, P., M\u00fcller-Gorman, I., & Zimek, A. (2007). Detection and visualization of subspace cluster hierarchies. In Proc. int. conf. on database systems for advanced applications (DASFAA) (pp. 152\u2013163)."},{"key":"5395_CR3","first-page":"61","volume-title":"Proc. ACM SIGMOD int. conf. on management of data","author":"C. C. Aggarwal","year":"1999","unstructured":"Aggarwal, C. C., Procopiuc, C. M., Wolf, J. L., Yu, P. S., & Park, J. S. (1999). Fast algorithms for projected clustering. In Proc. ACM SIGMOD int. conf. on management of data (pp. 61\u201372)."},{"key":"5395_CR4","first-page":"94","volume-title":"Proc. ACM SIGMOD int. conf. on management of data","author":"R. Agrawal","year":"1998","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In Proc. ACM SIGMOD int. conf. on management of data (pp. 94\u2013105)."},{"key":"5395_CR5","unstructured":"Asuncion, A., & Newman, D. (2010). UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml\/ ."},{"key":"5395_CR6","first-page":"217","volume-title":"Proc. int. conf. on database theory (ICDT)","author":"K. S. Beyer","year":"1999","unstructured":"Beyer, K. S., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999). When is \u201cNearest neighbor\u201d meaningful? In Proc. int. conf. on database theory (ICDT) (pp. 217\u2013235)."},{"key":"5395_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/ICDM.2004.10087","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"C. B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Kailing, K., Kriegel, H. P., & Kr\u00f6ger, P. (2004). Density connected clustering with local subspace preferences. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 27\u201334)."},{"key":"5395_CR8","first-page":"63","volume-title":"Proc. European conf. on principles and practice of knowledge discovery in databases (PKDD)","author":"C. Boulis","year":"2004","unstructured":"Boulis, C., & Ostendorf, M. (2004). Combining multiple clustering systems. In Proc. European conf. on principles and practice of knowledge discovery in databases (PKDD) (pp. 63\u201374)."},{"key":"5395_CR9","first-page":"91","volume-title":"Proc. int. conf. on machine learning (ICML)","author":"P. S. Bradley","year":"1998","unstructured":"Bradley, P. S., & Fayyad, U. M. (1998). Refining initial points for K-means clustering. In Proc. int. conf. on machine learning (ICML) (pp. 91\u201399)."},{"key":"5395_CR10","first-page":"755","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"L. Chen","year":"2008","unstructured":"Chen, L., Jiang, Q., & Wang, S. (2008). A probability model for projective clustering on high dimensional data. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 755\u2013760)."},{"key":"5395_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1137\/1.9781611973075.25","volume-title":"Proc. ACM-SIAM symposium on discrete algorithms (SODA)","author":"F. Chierichetti","year":"2010","unstructured":"Chierichetti, F., Kumar, R., Pandey, S., & Vassilvitskii, S. (2010). Finding the Jaccard median. In Proc. ACM-SIAM symposium on discrete algorithms (SODA) (pp. 293\u2013311)."},{"issue":"4","key":"5395_CR12","doi-asserted-by":"crossref","DOI":"10.1145\/1460797.1460800","volume":"2","author":"C. Domeniconi","year":"2009","unstructured":"Domeniconi, C., & Al-Razgan, M. (2009). Weighted cluster ensembles: methods and analysis. ACM Transactions on Knowledge Discovery from Data (TKDD), 2(4), 17.","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"1","key":"5395_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10618-006-0060-8","volume":"14","author":"C. Domeniconi","year":"2007","unstructured":"Domeniconi, C., Gunopulos, D., Ma, S., Yan, B., Al-Razgan, M., & Papadopoulos, D. (2007). Locally adaptive metrics for clustering high dimensional data. Data Mining and Knowledge Discovery, 14(1), 63\u201397.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5395_CR14","series-title":"ASA-SIAM series on statistics and applied probability","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718348","volume-title":"Data clustering: theory, algorithms, and applications","author":"G. Gan","year":"2007","unstructured":"Gan, G., Ma, C., & Wu, J. (2007) Data clustering: theory, algorithms, and applications. ASA-SIAM series on statistics and applied probability."},{"issue":"4","key":"5395_CR15","first-page":"305","volume":"1","author":"J. Ghosh","year":"2011","unstructured":"Ghosh, J., Acharya, A.: (2011). Cluster ensembles. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 1(4), 305\u2013315.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"issue":"1","key":"5395_CR16","doi-asserted-by":"crossref","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A. Gionis","year":"2007","unstructured":"Gionis, A., Mannila, H., & Tsaparas, P. (2007). Clustering aggregation. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1), 4.","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"key":"5395_CR17","first-page":"794","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"F. Gullo","year":"2009","unstructured":"Gullo, F., Domeniconi, C., & Tagarelli, A. (2009). Projective clustering ensembles. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 794\u2013799)."},{"key":"5395_CR18","first-page":"833","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"F. Gullo","year":"2010","unstructured":"Gullo, F., Domeniconi, C., & Tagarelli, A. (2010). Enhancing single-objective projective clustering ensembles. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 833\u2013838)."},{"key":"5395_CR19","first-page":"733","volume-title":"Proc. ACM SIGMOD int. conf. on management of data","author":"F. Gullo","year":"2011","unstructured":"Gullo, F., Domeniconi, C., & Tagarelli, A. (2011). Advancing data clustering via projective clustering ensembles. In Proc. ACM SIGMOD int. conf. on management of data (pp. 733\u2013744)."},{"issue":"3","key":"5395_CR20","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/s10618-012-0266-x","volume":"26","author":"F. Gullo","year":"2013","unstructured":"Gullo, F., Domeniconi, C., & Tagarelli, A. (2013). Projective clustering ensembles. Data Mining and Knowledge Discovery (DAMI), 26(3), 452\u2013511.","journal-title":"Data Mining and Knowledge Discovery (DAMI)"},{"key":"5395_CR21","first-page":"506","volume-title":"Proc. int. conf. on very large data bases (VLDB)","author":"A. Hinneburg","year":"2000","unstructured":"Hinneburg, A., Aggarwal, C. C., & Keim, D. A. (2000). What is the nearest neighbor in high dimensional spaces? In Proc. int. conf. on very large data bases (VLDB) (pp. 506\u2013515)."},{"key":"5395_CR22","volume-title":"Algorithms for clustering data","author":"A. Jain","year":"1988","unstructured":"Jain, A., & Dubes, R. (1988). Algorithms for clustering data. New York: Prentice Hall."},{"key":"5395_CR23","unstructured":"Keogh, E., Xi, X., Wei, L., & Ratanamahatana, C. A. (2003). The UCR time series classification\/clustering page. http:\/\/www.cs.ucr.edu\/~eamonn\/time_series_data\/ ."},{"key":"5395_CR24","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T. G. Kolda","year":"2009","unstructured":"Kolda, T. G., & Bader, B. W. (2009). Tensor decompositions and applications. SIAM Review, 51, 455\u2013500.","journal-title":"SIAM Review"},{"key":"5395_CR25","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/ICDM.2005.5","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"H. Kriegel","year":"2005","unstructured":"Kriegel, H., Kroger, P., Renz, M., & Wurst, S. (2005). A generic framework for efficient subspace clustering of high-dimensional data. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 250\u2013257)."},{"issue":"1","key":"5395_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H. Kriegel","year":"2009","unstructured":"Kriegel, H., Kr\u00f6ger, P., & Zimek, A. (2009). Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery from Data (TKDD), 3(1), 1\u201358.","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"2","key":"5395_CR27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0165-0114(97)00126-7","volume":"102","author":"R. P. Li","year":"1999","unstructured":"Li, R. P., & Mukaidono, M. (1999). Gaussian clustering method based on maximum-fuzzy-entropy interpretation. Fuzzy Sets and Systems, 102(2), 253\u2013258.","journal-title":"Fuzzy Sets and Systems"},{"key":"5395_CR28","first-page":"20","volume-title":"Proc. int. conf. on information and knowledge management (CIKM)","author":"B. Liu","year":"2000","unstructured":"Liu, B., Xia, Y., & Yu, P. S. (2000). Clustering through decision tree construction. In Proc. int. conf. on information and knowledge management (CIKM) (pp. 20\u201329)."},{"issue":"3","key":"5395_CR29","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10115-007-0090-6","volume":"14","author":"G. Moise","year":"2008","unstructured":"Moise, G., Sander, J., & Ester, M. (2008). Robust projected clustering. Knowledge and Information Systems, 14(3), 273\u2013298.","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"5395_CR30","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10115-009-0226-y","volume":"21","author":"G. Moise","year":"2009","unstructured":"Moise, G., Zimek, A., Kr\u00f6ger, P., Kriegel, H. P., & Sander, J. (2009). Subspace and projected clustering: experimental evaluation and analysis. Knowledge and Information Systems (KAIS), 21(3), 299\u2013326.","journal-title":"Knowledge and Information Systems (KAIS)"},{"issue":"1","key":"5395_CR31","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.14778\/1687627.1687770","volume":"2","author":"E. M\u00fcller","year":"2009","unstructured":"M\u00fcller, E., G\u00fcnnemann, S., Assent, I., & Seidl, T. (2009). Evaluating clustering in subspace projections of high dimensional data. Proceedings of the VLDB Endowment (PVLDB), 2(1), 1270\u20131281. http:\/\/dme.rwth-aachen.de\/en\/OpenSubspace\/evaluation .","journal-title":"Proceedings of the VLDB Endowment (PVLDB)"},{"issue":"3","key":"5395_CR32","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TKDE.2005.47","volume":"17","author":"E. K. K. Ng","year":"2005","unstructured":"Ng, E. K. K., Fu, A. W. C., & Wong, R. C. W. (2005). Projective clustering by histograms. IEEE Transactions on Knowledge and Data Engineering (TKDE), 17(3), 369\u2013383.","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"5395_CR33","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1109\/ICDM.2007.73","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"N. Nguyen","year":"2007","unstructured":"Nguyen, N., & Caruana, R. (2007). Consensus clustering. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 607\u2013612)."},{"issue":"1","key":"5395_CR34","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L. Parsons","year":"2004","unstructured":"Parsons, L., Haque, E., & Liu, H. (2004). Subspace clustering for high dimensional data: a review. SIGKDD Explorations, 6(1), 90\u2013105.","journal-title":"SIGKDD Explorations"},{"key":"5395_CR35","first-page":"418","volume-title":"Proc. ACM SIGMOD int. conf. on management of data","author":"C. M. Procopiuc","year":"2002","unstructured":"Procopiuc, C. M., Jones, M., Agarwal, P. K., & Murali, T. M. (2002). A Monte Carlo algorithm for fast projective clustering. In Proc. ACM SIGMOD int. conf. on management of data (pp. 418\u2013427)."},{"key":"5395_CR36","volume-title":"Information retrieval","author":"C. Rijsbergen van","year":"1979","unstructured":"van Rijsbergen, C. (1979). Information retrieval. Stoneham: Butterworths."},{"key":"5395_CR37","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/ICDM.2004.10099","volume-title":"Proc. IEEE int. conf. on data mining (ICDM)","author":"K. Sequeira","year":"2004","unstructured":"Sequeira, K., & Zaki, M. (2004). SCHISM: a new approach for interesting subspace mining. In Proc. IEEE int. conf. on data mining (ICDM) (pp. 186\u2013193)."},{"key":"5395_CR38","first-page":"583","volume":"3","author":"A. Strehl","year":"2002","unstructured":"Strehl, A., & Ghosh, J. (2002). Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583\u2013617.","journal-title":"Journal of Machine Learning Research"},{"key":"5395_CR39","first-page":"58","volume-title":"Proc. of the AAAI workshop on artificial intelligence for web search","author":"A. Strehl","year":"2000","unstructured":"Strehl, A., Ghosh, J., & Mooney, R. (2000). Impact of similarity measures on web-page clustering. In Proc. of the AAAI workshop on artificial intelligence for web search (pp. 58\u201364)."},{"key":"5395_CR40","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-642-20841-6_16","volume-title":"Proc. Pacific-Asia conf. on advances in knowledge discovery and data mining (PAKDD)","author":"N. Tomasev","year":"2011","unstructured":"Tomasev, N., Radovanovic, M., Mladenic, D., & Ivanovic, M. (2011). The role of hubness in clustering high-dimensional data. In Proc. Pacific-Asia conf. on advances in knowledge discovery and data mining (PAKDD) (pp. 183\u2013195)."},{"issue":"12","key":"5395_CR41","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","volume":"27","author":"A. P. Topchy","year":"2005","unstructured":"Topchy, A. P., Jain, A. K., & Punch, W. F. (2005). Clustering ensembles: models of consensus and weak partitions. IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 27(12), 1866\u20131881.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI)"},{"issue":"4","key":"5395_CR42","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.infsof.2003.07.003","volume":"46","author":"K. Woo","year":"2004","unstructured":"Woo, K., Lee, J., Kim, M., & Lee, Y. (2004). FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting. Information and Software Technology, 46(4), 255\u2013271.","journal-title":"Information and Software Technology"},{"issue":"11","key":"5395_CR43","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1109\/TKDE.2004.74","volume":"16","author":"K. Y. Yip","year":"2004","unstructured":"Yip, K. Y., Cheung, D. W., & Ng, M. K. H. (2004). A practical projected clustering algorithm. IEEE Transactions on Knowledge and Data Engineering (TKDE), 16(11), 1387\u20131397.","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"5395_CR44","first-page":"329","volume-title":"Proc. IEEE int. conf. on data engineering (ICDE)","author":"K. Y. Yip","year":"2005","unstructured":"Yip, K. Y., Cheung, D. W., & Ng, M. K. (2005). On discovery of extremely low-dimensional clusters using semi-supervised projected clustering. In Proc. IEEE int. conf. on data engineering (ICDE) (pp. 329\u2013340)."},{"issue":"2","key":"5395_CR45","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TKDE.2005.29","volume":"17","author":"M. L. Yiu","year":"2005","unstructured":"Yiu, M. L., & Mamoulis, N. (2005). Iterative projected clustering by subspace mining. IEEE Transactions on Knowledge and Data Engineering (TKDE), 17(2), 176\u2013189.","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-013-5395-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5395-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:36Z","timestamp":1559353236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-013-5395-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,29]]},"references-count":45,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["5395"],"URL":"https:\/\/doi.org\/10.1007\/s10994-013-5395-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,29]]}}}