{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:33:24Z","timestamp":1764304404319,"version":"3.40.4"},"publisher-location":"Cham","reference-count":85,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078205"},{"type":"electronic","value":"9783319078212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07821-2_16","type":"book-chapter","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T06:36:06Z","timestamp":1409294166000},"page":"403-423","source":"Crossref","is-referenced-by-count":7,"title":["Frequent Pattern Mining Algorithms for Data Clustering"],"prefix":"10.1007","author":[{"given":"Arthur","family":"Zimek","sequence":"first","affiliation":[]},{"given":"Ira","family":"Assent","sequence":"additional","affiliation":[]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,30]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"E. Achtert, C. B\u00f6hm, H.-P. Kriegel, P. Kr\u00f6ger, I. M\u00fcller-Gorman, and A. Zimek. Detection and visualization of subspace cluster hierarchies. In 12th International Conference on Database Systems for Advanced Applications (DASFAA), Bangkok, Thailand, pages\u00a0152\u2013163, 2007.","DOI":"10.1007\/978-3-540-71703-4_15"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"E. Achtert, C. B\u00f6hm, H.-P. Kriegel, P. Kr\u00f6ger, and A. Zimek. Robust, complete, and efficient correlation clustering. In 7th SIAM International Conference on Data Mining (SDM), Minneapolis, MN, pages\u00a0413\u2013418, 2007.","DOI":"10.1137\/1.9781611972771.37"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for projected clustering. In ACM International Conference on Management of Data (SIGMOD), Philadelphia, PA, pages\u00a061\u201372, 1999.","DOI":"10.1145\/304182.304188"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"C. C. Aggarwal, A. Hinneburg, and D. Keim. On the surprising behavior of distance metrics in high dimensional space. In 8th International Conference on Database Theory (ICDT), London, UK, pages\u00a0420\u2013434, 2001.","DOI":"10.1007\/3-540-44503-X_27"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"C. C. Aggarwal, N. Ta, J. Wang, J. Feng, and M. Zaki. Xproj: a framework for projected structural clustering of xml documents. In 13th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Jose, CA, pages\u00a046\u201355, 2007.","DOI":"10.1145\/1281192.1281201"},{"key":"16_CR6","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In 20th International Conference on Very Large Data Bases (VLDB), Santiago de Chile, Chile, pages\u00a0487\u2013499, 1994."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In ACM International Conference on Management of Data (SIGMOD), Seattle, WA, pages\u00a094\u2013105, 1998.","DOI":"10.1145\/276304.276314"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: Ordering points to identify the clustering structure. In ACM International Conference on Management of Data (SIGMOD), Philadelphia, PA, pages\u00a049\u201360, 1999.","DOI":"10.1145\/304181.304187"},{"issue":"4","key":"16_CR9","first-page":"340","volume":"2","author":"I. Assent","year":"2012","unstructured":"I. Assent. Clustering high dimensional data. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 2(4):340\u2013350, 2012.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"I. Assent, R. Krieger, E. M\u00fcller, and T. Seidl. DUSC: dimensionality unbiased subspace clustering. In 7th IEEE International Conference on Data Mining (ICDM), Omaha, NE, pages\u00a0409\u2013414, 2007.","DOI":"10.1109\/ICDM.2007.49"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"I. Assent, R. Krieger, E. M\u00fcller, and T. Seidl. EDSC: efficient density-based subspace clustering. In 17th ACM Conference on Information and Knowledge Management (CIKM), Napa Valley, CA, pages\u00a01093\u20131102, 2008.","DOI":"10.1145\/1458082.1458227"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"I. Assent, R. Krieger, E. M\u00fcller, and T. Seidl. INSCY: indexing subspace clusters with in-process-removal of redundancy. In 8th IEEE International Conference on Data Mining (ICDM), Pisa, Italy, pages\u00a0719\u2013724, 2008.","DOI":"10.1109\/ICDM.2008.46"},{"key":"16_CR13","volume-title":"Less is more: Non-redundant subspace clustering","author":"I. Assent","year":"2010","unstructured":"I. Assent, E. M\u00fcller, S. G\u00fcnnemann, R. Krieger, and T. Seidl. Less is more: Non-redundant subspace clustering. In MultiClust: 1st International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC, 2010."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"E. Bae and J. Bailey. COALA: a novel approach for the extraction of an alternate clustering of high quality and high dissimilarity. In 6th IEEE International Conference on Data Mining (ICDM), Hong Kong, China, pages\u00a053\u201362, 2006.","DOI":"10.1109\/ICDM.2006.37"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"C. Baumgartner, K. Kailing, H.-P. Kriegel, P. Kr\u00f6ger, and C. Plant. Subspace selection for clustering high-dimensional data. In 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK, pages\u00a011\u201318, 2004.","DOI":"10.1109\/ICDM.2004.10112"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"R. Bayardo. Efficiently mining long patterns from databases. In ACM International Conference on Management of Data (SIGMOD), Seattle, WA, pages\u00a085\u201393, 1998.","DOI":"10.1145\/276304.276313"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"K. P. Bennett, U. Fayyad, and D. Geiger. Density-based indexing for approximate nearest-neighbor queries. In 5th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, pages\u00a0233\u2013243, 1999.","DOI":"10.1145\/312129.312236"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is \u201cnearest neighbor\u201d meaningful? In 7th International Conference on Database Theory (ICDT), Jerusalem, Israel, pages\u00a0217\u2013235, 1999.","DOI":"10.1007\/3-540-49257-7_15"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"S. Bickel and T. Scheffer. Multi-view clustering. In 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK, pages\u00a019\u201326, 2004.","DOI":"10.1109\/ICDM.2004.10095"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"R. J. G. B. Campello, D. Moulavi, and J. Sander. Density-based clustering based on hierarchical density estimates. In 17th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Gold Coast, Australia, pages\u00a0160\u2013172, 2013.","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"C. H. Cheng, A. W.-C. Fu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In 5th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, pages\u00a084\u201393, 1999.","DOI":"10.1145\/312129.312199"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Y. Cui, X. Z. Fern, and J. G. Dy. Non-redundant multi-view clustering via orthogonalization. In 7th IEEE International Conference on Data Mining (ICDM), Omaha, NE, pages\u00a0133\u2013142, 2007.","DOI":"10.1109\/ICDM.2007.94"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"X. H. Dang and J. Bailey. Generation of alternative clusterings using the CAMI approach. In 10th SIAM International Conference on Data Mining (SDM), Columbus, OH, pages\u00a0118\u2013129, 2010.","DOI":"10.1137\/1.9781611972801.11"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"I. Davidson and Z. Qi. Finding alternative clusterings using constraints. In 8th IEEE International Conference on Data Mining (ICDM), Pisa, Italy, pages\u00a0773\u2013778, 2008.","DOI":"10.1109\/ICDM.2008.141"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"I. Davidson, S. S. Ravi, and L. Shamis. A SAT-based framework for efficient constrained clustering. In 10th SIAM International Conference on Data Mining (SDM), Columbus, OH, pages\u00a094\u2013105, 2010.","DOI":"10.1137\/1.9781611972801.9"},{"issue":"1","key":"16_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. P. Dempster","year":"1977","unstructured":"A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 39(1):1\u201331, 1977.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"4","key":"16_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jco.2009.02.011","volume":"25","author":"R. J. Durrant","year":"2009","unstructured":"R. J. Durrant and A. Kaban. When is \u2018nearest neighbour\u2019 meaningful: A converse theorem and implications. Journal of Complexity, 25(4):385\u2013397, 2009.","journal-title":"Journal of Complexity"},{"key":"16_CR28","unstructured":"M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In 2nd ACM International Conference on Knowledge Discovery and Data Mining (KDD), Portland, OR, pages\u00a0226\u2013231, 1996."},{"key":"16_CR29","unstructured":"I. F\u00e4rber, S. G\u00fcnnemann, H.-P. Kriegel, P. Kr\u00f6ger, E. M\u00fcller, E. Schubert, T. Seidl, and A. Zimek. On using class-labels in evaluation of clusterings. In MultiClust: 1st International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC, 2010."},{"issue":"7","key":"16_CR30","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/TKDE.2007.1037","volume":"19","author":"D. Fran\u00e7ois","year":"2007","unstructured":"D. Fran\u00e7ois, V. Wertz, and M. Verleysen. The concentration of fractional distances. IEEE Transactions on Knowledge and Data Engineering, 19(7):873\u2013886, 2007.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"G. Gan, C. Ma, and J. Wu. Data Clustering. Theory, Algorithms, and Applications. Society for Industrial and Applied Mathematics (SIAM), 2007.","DOI":"10.1137\/1.9780898718348"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"D. Gondek and T. Hofmann. Non-redundant data clustering. In 4th IEEE International Conference on Data Mining (ICDM), Brighton, UK, pages\u00a075\u201382, 2004.","DOI":"10.1109\/ICDM.2004.10104"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"D. Gondek and T. Hofmann. Non-redundant clustering with conditional ensembles. In 11th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Chicago, IL, pages\u00a070\u201377, 2005.","DOI":"10.1145\/1081870.1081882"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"S. G\u00fcnnemann, E. M\u00fcller, I. F\u00e4rber, and T. Seidl. Detection of orthogonal concepts in subspaces of high dimensional data. In 18th ACM Conference on Information and Knowledge Management (CIKM), Hong Kong, China, pages\u00a01317\u20131326, 2009.","DOI":"10.1145\/1645953.1646120"},{"key":"16_CR35","volume-title":"E","author":"S. G\u00fcnnemann","year":"2010","unstructured":"S. G\u00fcnnemann, I. F\u00e4rber, E. M\u00fcller, and T. Seidl. ASCLU: alternative subspace clustering. In MultiClust: 1st International Workshop on Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with KDD 2010, Washington, DC, 2010."},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"S. G\u00fcnnemann, I. F\u00e4rber, E. M\u00fcller, I. Assent, and T. Seidl. External evaluation measures for subspace clustering. In 20th ACM Conference on Information and Knowledge Management (CIKM), Glasgow, UK, pages\u00a01363\u20131372, 2011.","DOI":"10.1145\/2063576.2063774"},{"issue":"2","key":"16_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J. Han","year":"2000","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2):1\u201312, 2000.","journal-title":"ACM SIGMOD Record"},{"key":"16_CR38","unstructured":"J. Han, M. Kamber, and J. Pei. Data Mining: Concepts and Techniques. Morgan Kaufmann, 3rd\u00a0edition, 2011."},{"key":"16_CR39","unstructured":"J. A. Hartigan. Clustering Algorithms. John Wiley & Sons, New York, London, Sydney, Toronto, 1975."},{"key":"16_CR40","unstructured":"A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In 4th ACM International Conference on Knowledge Discovery and Data Mining (KDD), New York City, NY, pages\u00a058\u201365, 1998."},{"key":"16_CR41","unstructured":"A. Hinneburg, C. C. Aggarwal, and D. A. Keim. What is the nearest neighbor in high dimensional spaces? In 26th International Conference on Very Large Data Bases (VLDB), Cairo, Egypt, pages\u00a0506\u2013515, 2000."},{"key":"16_CR42","doi-asserted-by":"crossref","unstructured":"M. E. Houle, H.-P. Kriegel, P. Kr\u00f6ger, E. Schubert, and A. Zimek. Can shared-neighbor distances defeat the curse of dimensionality? In 22nd International Conference on Scientific and Statistical Database Management (SSDBM), Heidelberg, Germany, pages\u00a0482\u2013500, 2010.","DOI":"10.1007\/978-3-642-13818-8_34"},{"issue":"8","key":"16_CR43","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"A. K. Jain","year":"2010","unstructured":"A. K. Jain. Data clustering: 50 years beyond k-means. Pattern Recognition Letters, 31(8):651\u2013666, 2010.","journal-title":"Pattern Recognition Letters"},{"key":"16_CR44","unstructured":"A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, 1988."},{"issue":"3","key":"16_CR45","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A. K. Jain","year":"1999","unstructured":"A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264\u2013323, 1999.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"16_CR46","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/sam.10007","volume":"1","author":"P. Jain","year":"2008","unstructured":"P. Jain, R. Meka, and I. S. Dhillon. Simultaneous unsupervised learning of disparate clusterings. Statistical Analysis and Data Mining, 1(3):195\u2013210, 2008.","journal-title":"Statistical Analysis and Data Mining"},{"key":"16_CR47","doi-asserted-by":"crossref","unstructured":"K. Kailing, H.-P. Kriegel, P. Kr\u00f6ger, and S. Wanka. Ranking interesting subspaces for clustering high dimensional data. In 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Cavtat-Dubrovnik, Croatia, pages\u00a0241\u2013252, 2003.","DOI":"10.1007\/978-3-540-39804-2_23"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"K. Kailing, H.-P. Kriegel, and P. Kr\u00f6ger. Density-connected subspace clustering for high-dimensional data. In 4th SIAM International Conference on Data Mining (SDM), Lake Buena Vista, FL, pages\u00a0246\u2013257, 2004.","DOI":"10.1137\/1.9781611972740.23"},{"key":"16_CR49","doi-asserted-by":"crossref","unstructured":"L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: An Introduction to Cluster Analyis. John Wiley & Sons, 1990.","DOI":"10.1002\/9780470316801"},{"issue":"1","key":"16_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H.-P. Kriegel","year":"2009","unstructured":"H.-P. Kriegel, P. Kr\u00f6ger, and A. Zimek. 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, 2009.","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"3","key":"16_CR51","first-page":"231","volume":"1","author":"H.-P. Kriegel","year":"2011","unstructured":"H.-P. Kriegel, P. Kr\u00f6ger, J. Sander, and A. Zimek. Density-based clustering. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 1(3):231\u2013240, 2011.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"issue":"4","key":"16_CR52","first-page":"351","volume":"2","author":"H.-P. Kriegel","year":"2012","unstructured":"H.-P. Kriegel, P. Kr\u00f6ger, and A. Zimek. Subspace clustering. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 2(4):351\u2013364, 2012.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"P. Kr\u00f6ger and A. Zimek. Subspace clustering techniques. In L. Liu and M. T. Ozsu, editors, Encyclopedia of Database Systems, pages 2873\u20132875. Springer, 2009.","DOI":"10.1007\/978-0-387-39940-9_607"},{"key":"16_CR54","doi-asserted-by":"crossref","unstructured":"G. Liu, J. Li, K. Sim, and L. Wong. Distance based subspace clustering with flexible dimension partitioning. In 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey, pages\u00a01250\u20131254, 2007.","DOI":"10.1109\/ICDE.2007.368985"},{"issue":"2","key":"16_CR55","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S. P. Lloyd","year":"1982","unstructured":"S. P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129\u2013136, 1982.","journal-title":"IEEE Transactions on Information Theory"},{"key":"16_CR56","unstructured":"J. MacQueen. Some methods for classification and analysis of multivariate observations. In 5th Berkeley Symposium on Mathematics, Statistics, and Probabilistics, volume\u00a01, pages\u00a0281\u2013297, 1967."},{"key":"16_CR57","doi-asserted-by":"crossref","unstructured":"M. Mampaey, N. Tatti, and J. Vreeken. Tell me what I need to know: Succinctly summarizing data with itemsets. In 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, pages\u00a0573\u2013581, 2011.","DOI":"10.1145\/2020408.2020499"},{"key":"16_CR58","doi-asserted-by":"crossref","unstructured":"G. Moise, J. Sander, and M. Ester. P3C: A robust projected clustering algorithm. In 6th IEEE International Conference on Data Mining (ICDM), Hong Kong, China, pages\u00a0414\u2013425, 2006.","DOI":"10.1109\/ICDM.2006.123"},{"issue":"3","key":"16_CR59","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10115-007-0090-6","volume":"14","author":"G. Moise","year":"2008","unstructured":"G. Moise, J. Sander, and M. Ester. Robust projected clustering. Knowledge and Information Systems (KAIS), 14(3):273\u2013298, 2008.","journal-title":"Knowledge and Information Systems (KAIS)"},{"issue":"3","key":"16_CR60","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10115-009-0226-y","volume":"21","author":"G. Moise","year":"2009","unstructured":"G. Moise, A. Zimek, P. Kr\u00f6ger, H.-P. Kriegel, and J. Sander. Subspace and projected clustering: Experimental evaluation and analysis. Knowledge and Information Systems (KAIS), 21(3):299\u2013326, 2009.","journal-title":"Knowledge and Information Systems (KAIS)"},{"key":"16_CR61","doi-asserted-by":"crossref","unstructured":"E. M\u00fcller, I. Assent, S. G\u00fcnnemann, R. Krieger, and T. Seidl. Relevant subspace clustering: Mining the most interesting non-redundant concepts in high dimensional data. In 9th IEEE International Conference on Data Mining (ICDM), Miami, FL, pages\u00a0377\u2013386, 2009.","DOI":"10.1109\/ICDM.2009.10"},{"key":"16_CR62","doi-asserted-by":"crossref","unstructured":"E. M\u00fcller, I. Assent, R. Krieger, S. G\u00fcnnemann, and T. Seidl. Dens-Est:density estimation for data mining in high dimensional spaces. In 9th SIAM International Conference on Data Mining (SDM), Sparks, NV, pages\u00a0173\u2013184, 2009.","DOI":"10.1137\/1.9781611972795.16"},{"key":"16_CR63","doi-asserted-by":"crossref","unstructured":"E. M\u00fcller, S. G\u00fcnnemann, I. Assent, and T. Seidl. Evaluating clustering in subspace projections of high dimensional data. In 35th International Conference on Very Large Data Bases (VLDB), Lyon, France, pages\u00a01270\u20131281, 2009.","DOI":"10.14778\/1687627.1687770"},{"key":"16_CR64","doi-asserted-by":"crossref","unstructured":"E. M\u00fcller, I. Assent, S. G\u00fcnnemann, and T. Seidl. Scalable densitybased subspace clustering. In 20th ACM Conference on Information and Knowledge Management (CIKM), Glasgow, UK, pages\u00a01077\u20131086, 2011.","DOI":"10.1145\/2063576.2063733"},{"key":"16_CR65","doi-asserted-by":"crossref","unstructured":"H. S. Nagesh, S. Goil, and A. Choudhary. Adaptive grids for clustering massive data sets. In 1st SIAM International Conference on Data Mining (SDM), Chicago, IL, 2001.","DOI":"10.1137\/1.9781611972719.7"},{"key":"16_CR66","doi-asserted-by":"crossref","unstructured":"H. V. Nguyen, E. M\u00fcller, J. Vreeken, F. Keller, and K. B\u00f6hm. CMI: an information-theoretic contrast measure for enhancing subspace cluster and outlier detection. In 13th SIAM International Conference on Data Mining (SDM), Austin, TX, pages\u00a0198\u2013206, 2013.","DOI":"10.1137\/1.9781611972832.22"},{"issue":"1","key":"16_CR67","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L. Parsons","year":"2004","unstructured":"L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: A review. ACM SIGKDD Explorations, 6(1):90\u2013105, 2004.","journal-title":"ACM SIGKDD Explorations"},{"key":"16_CR68","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th International Conference on Database Theory (ICDT), Jerusalem, Israel, pages\u00a0398\u2013416, 1999.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"16_CR69","unstructured":"J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu. MaPle: A fast algorithm for maximal pattern-based clustering. In 3rd IEEE International Conference on Data Mining (ICDM), Melbourne, FL, pages\u00a0259\u2013266, 2003."},{"key":"16_CR70","unstructured":"J. M. Phillips, P. Raman, and S. Venkatasubramanian. Generating a diverse set of high-quality clusterings. In 2nd MultiClust Workshop: Discovering, Summarizing and Using Multiple Clusterings Held in Conjunction with ECML PKDD 2011, Athens, Greece, pages\u00a080\u201391, 2011."},{"key":"16_CR71","doi-asserted-by":"crossref","unstructured":"C. M. Procopiuc, M. Jones, P. K. Agarwal, and T. M. Murali. A Monte Carlo algorithm for fast projective clustering. In ACM International Conference on Management of Data (SIGMOD), Madison, WI, pages\u00a0418\u2013427, 2002.","DOI":"10.1145\/564691.564739"},{"key":"16_CR72","doi-asserted-by":"crossref","unstructured":"Z. J. Qi and I. Davidson. A principled and flexible framework for finding alternative clusterings. In 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, pages\u00a0717\u2013726, 2009.","DOI":"10.1145\/1557019.1557099"},{"key":"16_CR73","unstructured":"C. E. Shannon and W. Weaver. The Mathematical Theory of Communication. University of Illinois Press, 1949."},{"issue":"2","key":"16_CR74","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10618-012-0258-x","volume":"26","author":"K. Sim","year":"2013","unstructured":"K. Sim, V. Gopalkrishnan, A. Zimek, and G. Cong. A survey on enhanced subspace clustering. Data Mining and Knowledge Discovery, 26(2):332\u2013397, 2013.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"16_CR75","doi-asserted-by":"crossref","unstructured":"P. H. A. Sneath. The application of computers to taxonomy. Journal of General Microbiology, 17:201\u2013226, 1957.","DOI":"10.1099\/00221287-17-1-201"},{"key":"16_CR76","doi-asserted-by":"crossref","unstructured":"M. Verleysen and D. Fran\u00e7ois. The curse of dimensionality in data mining and time series prediction. In 8th International Work-Conference on Artificial Neural Networks (IWANN), Barcelona, Spain, pages\u00a0758\u2013770, 2005.","DOI":"10.1007\/11494669_93"},{"key":"16_CR77","unstructured":"D. Wishart. Mode analysis: A generalization of nearest neighbor which reduces chaining effects. In A. J. Cole, editor, Numerical Taxonomy, pages\u00a0282\u2013311, 1969."},{"key":"16_CR78","doi-asserted-by":"crossref","unstructured":"X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing itemset patterns: a profile-based approach. In 11th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Chicago, IL, pages\u00a0314\u2013323, 2005.","DOI":"10.1145\/1081870.1081907"},{"key":"16_CR79","unstructured":"M. L. Yiu and N. Mamoulis. Frequent-pattern based iterative projected clustering. In 3rd IEEE International Conference on Data Mining (ICDM), Melbourne, FL, pages\u00a0689\u2013692, 2003."},{"issue":"2","key":"16_CR80","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TKDE.2005.29","volume":"17","author":"M. L. Yiu","year":"2005","unstructured":"M. L. Yiu and N. Mamoulis. Iterative projected clustering by subspace mining. IEEE Transactions on Knowledge and Data Engineering, 17(2):176\u2013189, 2005.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"16_CR81","unstructured":"M. J. Zaki, M. Peters, I. Assent, and T. Seidl. CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. Data & Knowledge Engineering, 60(1):51\u201370, 2007."},{"key":"16_CR82","doi-asserted-by":"crossref","unstructured":"F. Zhu, X. Yan, J. Han, P. S. Yu, and H. Cheng. Mining colossal frequent patterns by core pattern fusion. In 23rd International Conference on Data Engineering (ICDE), Istanbul, Turkey, pages\u00a0706\u2013715, 2007.","DOI":"10.1109\/ICDE.2007.367916"},{"key":"16_CR83","doi-asserted-by":"crossref","unstructured":"A. Zimek. Clustering high-dimensional data. In C. C. Aggarwal and C. K. Reddy, editors, Data Clustering: Algorithms and Applications, chapter\u00a09, pages\u00a0201\u2013230. CRC Press, 2013.","DOI":"10.1201\/9781315373515-9"},{"key":"16_CR84","doi-asserted-by":"crossref","unstructured":"A. Zimek and J. Vreeken. The blind men and the elephant: On meeting the problem of multiple truths in data from clustering and pattern mining perspectives. Machine Learning, 2013.","DOI":"10.1007\/s10994-013-5334-y"},{"key":"16_CR85","doi-asserted-by":"crossref","unstructured":"A. Zimek, E. Schubert, and H.-P. Kriegel. A survey on unsupervised outlier detection in high-dimensional numerical data. Statistical Analysis and Data Mining, 5(5):363\u2013387, 2012.","DOI":"10.1002\/sam.11161"}],"container-title":["Frequent Pattern Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07821-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T11:33:55Z","timestamp":1746358435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07821-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078205","9783319078212"],"references-count":85,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07821-2_16","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}