{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:03:52Z","timestamp":1778601832372,"version":"3.51.4"},"reference-count":112,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T00:00:00Z","timestamp":1330041600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10618-012-0258-x","type":"journal-article","created":{"date-parts":[[2012,2,23]],"date-time":"2012-02-23T06:56:23Z","timestamp":1329980183000},"page":"332-397","source":"Crossref","is-referenced-by-count":120,"title":["A survey on enhanced subspace clustering"],"prefix":"10.1007","volume":"26","author":[{"given":"Kelvin","family":"Sim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivekanand","family":"Gopalkrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gao","family":"Cong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,24]]},"reference":[{"key":"258_CR1","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kriegel HP, Kr\u00f6ger P, M\u00fcller-Gorman I, Zimek A (2006a) Finding hierarchies of subspace clusters. In: Proceedings of the 10th European conference on principles and practice of knowledge discovery in databases (PKDD), pp 446\u2013453","DOI":"10.1007\/11871637_42"},{"key":"258_CR2","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kriegel HP, Kr\u00f6ger P, Zimek A (2006b) Deriving quantitative models for correlation clusters. In: Proceedings of the 12th ACM international conference on knowledge discovery and data mining (KDD), pp 4\u201313","DOI":"10.1145\/1150402.1150408"},{"key":"258_CR3","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kriegel HP, Kr\u00f6ger P, M\u00fcller-Gorman I, Zimek A (2007) Detection and visualization of subspace cluster hierarchies. In: Proceedings of the 12th international conference on database systems for advanced applications (DASFAA), pp 152\u2013163","DOI":"10.1007\/978-3-540-71703-4_15"},{"key":"258_CR4","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th international conference on very large data bases (VLDB), pp 487\u2013499"},{"key":"258_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM international conference on management of data (SIGMOD), pp 94\u2013105","DOI":"10.1145\/276305.276314"},{"key":"258_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wolf JL, Yu PS, Procopiuc C, Park JS (1999) Fast algorithms for projected clustering. In: Proceedings of the ACM international conference on management of data (SIGMOD), pp 61\u201372","DOI":"10.1145\/304181.304188"},{"key":"258_CR7","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Hinneburg A, Keim D (2001) On the surprising behavior of distance metrics in high dimensional space. In: Proceedings of the 8th international conference on database theory (ICDT), pp 420\u2013434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"258_CR8","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J, Wang J, Yu PS (2004) A framework for projected clustering of high dimensional data streams. In: Proceedings of 30th international conference on very large data bases (VLDB), pp 852\u2013863","DOI":"10.1016\/B978-012088469-8.50075-9"},{"key":"258_CR9","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, M\u00fcller E, Seidl T (2007) DUSC: dimensionality unbiased subspace clustering. In: Proceedings of the 7th IEEE international conference on data mining (ICDM), pp 409\u2013414","DOI":"10.1109\/ICDM.2007.49"},{"key":"258_CR10","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, M\u00fcller E, Seidl T (2008a) EDSC: efficient density-based subspace clustering. In: Proceedings of the 17th ACM conference on information and knowledge management (CIKM), pp 1093\u20131102","DOI":"10.1145\/1458082.1458227"},{"key":"258_CR11","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, M\u00fcller E, Seidl T (2008b) INSCY: indexing subspace clusters with in-process-removal of redundancy. In: Proceedings of the 8th IEEE international conference on data mining (ICDM), pp 719\u2013724","DOI":"10.1109\/ICDM.2008.46"},{"issue":"1-3","key":"258_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis D, Fukuda K (1996) Reverse search for enumeration. Discr Appl Math 65(1-3): 21\u201346","journal-title":"Discr Appl Math"},{"key":"258_CR13","doi-asserted-by":"crossref","unstructured":"Bennett KP, Fayyad U, Geiger D (1999) Density-based indexing for approximate nearest-neighbor queries. In: Proceedings of the 5th ACM international conference on knowledge discovery and data mining KDD, pp 233\u2013243","DOI":"10.1145\/312129.312236"},{"key":"258_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-28349-8_2","volume-title":"Grouping multidimensional data, chap 2","author":"P Berkhin","year":"2006","unstructured":"Berkhin P (2006) A survey of clustering data mining techniques. In: Kogan J, Nicholas C, Teboulle M (eds) Grouping multidimensional data, chap 2. Springer, New York, pp 25\u201371"},{"key":"258_CR15","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful?. In: Proceedings of the 7th international conference on database theory (ICDT), pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"258_CR16","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kailing K, Kr\u00f6ger P, Zimek A (2004) Computing clusters of correlation connected objects. In: Proceedings of the ACM international conference on management of data (SIGMOD), pp 455\u2013466","DOI":"10.1145\/1007568.1007620"},{"issue":"3","key":"258_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1214\/ss\/1009213726","volume":"16","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Statistical modeling: the two cultures. Stat Sci 16(3): 199\u2013231","journal-title":"Stat Sci"},{"key":"258_CR18","doi-asserted-by":"crossref","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2008) Data peeler: contraint-based closed pattern mining in n-ary relations. In: Proceedings of the 8th SIAM international conference on data mining (SDM), pp 37\u201348","DOI":"10.1137\/1.9781611972788.4"},{"issue":"1","key":"258_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009) Closed patterns meet n-ary relations. Trans Knowl Discov Data 3(1): 1\u201336","journal-title":"Trans Knowl Discov Data"},{"issue":"5","key":"258_CR20","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.patcog.2003.11.003","volume":"37","author":"EY Chan","year":"2004","unstructured":"Chan EY, Ching WK, Ng MK, Huang JZ (2004) An optimization algorithm for clustering using weighted dissimilarity measures. Pattern Recog 37(5): 943\u2013952","journal-title":"Pattern Recog"},{"key":"258_CR21","doi-asserted-by":"crossref","unstructured":"Cheng CH, Fu AW, Zhang Y (1999) Entropy-based subspace clustering for mining numerical data. In: Proceedings of the 5th ACM international conference on knowledge discovery and data mining (KDD), pp 84\u201393","DOI":"10.1145\/312129.312199"},{"key":"258_CR22","unstructured":"Cheng Y, Church GM (2000) Biclustering of expression data. In: Proceedings of the 18th international conference on intelligent systems for molecular biology (ISMB), pp 93\u2013103"},{"key":"258_CR23","doi-asserted-by":"crossref","unstructured":"Chiaravalloti AD, Greco G, Guzzo A, Pontieri L (2006) An information-theoretic framework for process structure and data mining. In: Proceedings of the 8th international conference on data warehousing and knowledge discovery (DaWaK), pp 248\u2013259","DOI":"10.1007\/11823728_24"},{"key":"258_CR24","doi-asserted-by":"crossref","unstructured":"Dai W, Yang Q, Xue GR, Yu Y (2008) Self-taught clustering. In: Proceedings of the 25th international conference on machine learning (ICML), pp 200\u2013207","DOI":"10.1145\/1390156.1390182"},{"key":"258_CR25","doi-asserted-by":"crossref","unstructured":"Dash M, Choi K, Scheuermann P, Liu H (2002) Feature selection for clustering - a filter solution. In: Proceedings of the 2nd IEEE international conference on data mining (ICDM), pp 115\u2013122","DOI":"10.1109\/ICDM.2002.1183893"},{"key":"258_CR26","doi-asserted-by":"crossref","unstructured":"Dhillon IS (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the 7th ACM international conference on knowledge discovery and data mining (KDD), pp 269\u2013274","DOI":"10.1145\/502512.502550"},{"key":"258_CR27","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Mallela S, Modha DS (2003) Information-theoretic co-clustering. In: Proceedings of the 9th ACM international conference on knowledge discovery and data mining (KDD), pp 89\u201398","DOI":"10.1145\/956750.956764"},{"key":"258_CR28","doi-asserted-by":"crossref","unstructured":"Ding CHQ, He X, Zha H, Simon HD (2002) Adaptive dimension reduction for clustering high dimensional data. In: Proceedings of the 2nd IEEE international conference on data mining (ICDM), pp 147\u2013154","DOI":"10.2172\/807420"},{"key":"258_CR29","doi-asserted-by":"crossref","unstructured":"Domeniconi C, Papadopoulos D, Gunopulos D, Ma S (2004) Subspace clustering of high dimensional data. In: Proceedings of the 4th SIAM international conference on data mining (SDM), pp 517\u2013521","DOI":"10.1137\/1.9781611972740.58"},{"key":"258_CR30","volume-title":"Pattern classification","author":"RO Duda","year":"2001","unstructured":"Duda RO, Hart PE, Stork DG (2001) Pattern classification, 2nd edn. Wiley, New York","edition":"2"},{"issue":"1","key":"258_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10618-006-0057-3","volume":"15","author":"C Faloutsos","year":"2007","unstructured":"Faloutsos C, Megalooikonomou V (2007) On data mining, compression, and kolmogorov complexity. Data Mining Knowl Discov 15(1): 3\u201320","journal-title":"Data Mining Knowl Discov"},{"key":"258_CR32","unstructured":"F\u00e4rber I, G\u00fcnnemann S, Kriegel HP, Kr\u00f6ger P, M\u00fcller E, Schubert E, Seidl T, Zimek A (2010) On using class-labels in evaluation of clusterings. In: Proceedings of the 1st international workshop on discovering, summarizing and using multiple clusterings (MultiClust) held in conjunction with KDD 2010"},{"issue":"7","key":"258_CR33","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/TKDE.2007.1037","volume":"19","author":"D Francois","year":"2007","unstructured":"Francois D, Wertz V, Verleysen M (2007) The concentration of fractional distances. IEEE Trans Knowl Data Eng 19(7): 873\u2013886","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"258_CR34","doi-asserted-by":"crossref","unstructured":"Fromont \u00c9, Prado A, Robardet C (2009) Constraint-based subspace clustering. In: Proceedings of the 9th SIAM international conference on data mining (SDM), pp 26\u201337","DOI":"10.1137\/1.9781611972795.3"},{"key":"258_CR35","doi-asserted-by":"crossref","unstructured":"Fu Q, Banerjee A (2009) Bayesian overlapping subspace clustering. In: Proceedings of the 9th IEEE international conference on data mining (ICDM), pp 776\u2013781","DOI":"10.1109\/ICDM.2009.132"},{"key":"258_CR36","doi-asserted-by":"crossref","unstructured":"Gao B, Liu TY, Ma WY (2006) Star-structured high-order heterogeneous data co-clustering based on consistent information theory. In: Proceedings of the 6th IEEE international conference on data mining (ICDM), pp 880\u2013884","DOI":"10.1109\/ICDM.2006.154"},{"issue":"2","key":"258_CR37","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10994-010-5210-y","volume":"82","author":"E Georgii","year":"2010","unstructured":"Georgii E, Tsuda K, Sch\u00f6lkopf B (2010) Multi-way set enumeration in weight tensors. Mach Learn 82(2): 123\u2013155","journal-title":"Mach Learn"},{"key":"258_CR38","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1999) ROCK: a robust clustering algorithm for categorical attributes. In: Proceedings of the 15th international conference on data engineering (ICDE), pp 512\u2013521","DOI":"10.1109\/ICDE.1999.754967"},{"key":"258_CR39","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, M\u00fcller E, F\u00e4rber I, Seidl T (2009) Detection of orthogonal concepts in subspaces of high dimensional data. In: Proceedings of the 18th ACM conference on information and knowledge management (CIKM), pp 1317\u20131326","DOI":"10.1145\/1645953.1646120"},{"key":"258_CR40","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2010a) Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: Proceedings of the 10th IEEE international conference on data mining (ICDM), pp 845\u2013850","DOI":"10.1109\/ICDM.2010.95"},{"key":"258_CR41","unstructured":"G\u00fcnnemann S, F\u00e4rber I, M\u00fcller E, Seidl T (2010b) ASCLU: alternative subspace clustering. In: Proceedings of the 1st international workshop on discovering, summarizing and using multiple clusterings (MultiClust) held in conjunction with KDD 2010"},{"key":"258_CR42","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, Kremer H, Seidl T (2010c) Subspace clustering for uncertain data. In: Proceedings of the 10th SIAM international conference on data mining (SDM), pp 385\u2013396","DOI":"10.1137\/1.9781611972801.34"},{"key":"258_CR43","unstructured":"Hinneburg A, Aggarwal CC, Keim DA (2000) What is the nearest neighbor in high dimensional spaces?. In: Proceedings of the 26th international conference on very large data bases (VLDB), pp 506\u2013515"},{"key":"258_CR44","doi-asserted-by":"crossref","unstructured":"Houle ME, Kriegel HP, Kr\u00f6ger P, Schubert E, Zimek A (2010) Can shared-neighbor distances defeat the curse of dimensionality?. In: Proceedings of the 22nd international conference on scientific and statistical database management (SSDBM)","DOI":"10.1007\/978-3-642-13818-8_34"},{"key":"258_CR45","unstructured":"Hsu CM, Chen MS (2004) Subspace clustering of high dimensional spatial data with noises. In: Proceedings of the 8th Pacific-Asia conference advances in knowledge discovery and data mining (PAKDD), pp 31\u201340"},{"issue":"3","key":"258_CR46","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3): 264\u2013323","journal-title":"ACM Comput Surv"},{"key":"258_CR47","doi-asserted-by":"crossref","unstructured":"Jaschke R, Hotho A, Schmitz C, Ganter B, Stumme G (2006) TRIAS\u2013an algorithm for mining iceberg tri-lattices. In: Proceedings of the 6th IEEE international conference on data mining (ICDM), pp 907\u2013911","DOI":"10.1109\/ICDM.2006.162"},{"key":"258_CR48","unstructured":"Ji L, Tan KL, Tung AKH (2006) Mining frequent closed cubes in 3D datasets. In: Proceedings of the 32nd international conference on very large data bases (VLDB), pp 811\u2013822"},{"key":"258_CR49","doi-asserted-by":"crossref","unstructured":"Jiang D, Pei J, Ramanathan M, Tang C, Zhang A (2004a) Mining coherent gene clusters from gene-sample-time microarray data. In: Proceedings of the 10th ACM international conference on knowledge discovery and data mining (KDD), pp 430\u2013439","DOI":"10.1145\/1014052.1014101"},{"issue":"11","key":"258_CR50","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1109\/TKDE.2004.68","volume":"16","author":"D Jiang","year":"2004","unstructured":"Jiang D, Tang C, Zhang A (2004b) Cluster analysis for gene expression data: a survey. IEEE Trans Knowl Data Eng 16(11): 1370\u20131386","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"258_CR51","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/TKDE.2007.1048","volume":"19","author":"L Jing","year":"2007","unstructured":"Jing L, Ng MK, Huang JZ (2007) An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans Knowl Data Eng 19(8): 1026\u20131041","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"258_CR52","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel HP, Kr\u00f6ger P, Wanka S (2003) Ranking interesting subspaces for clustering high dimensional data. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases (PKDD), pp 241\u2013252","DOI":"10.1007\/978-3-540-39804-2_23"},{"key":"258_CR53","doi-asserted-by":"crossref","unstructured":"Kailing K, Kr\u00f6ger P, Kriegel HP (2004) Density-connected subspace clustering for high-dimensional data. In: Proceedings of the 4th SIAM international conference on data mining (SDM), pp 246\u2013257","DOI":"10.1137\/1.9781611972740.23"},{"key":"258_CR54","doi-asserted-by":"crossref","unstructured":"Ke Y, Cheng J, Ng W (2006) Mining quantitative correlated patterns using an information-theoretic approach. In: Proceedings of the 12th ACM international conference on knowledge discovery and data mining (KDD), pp 227\u2013236","DOI":"10.1145\/1150402.1150430"},{"key":"258_CR55","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Lonardi S, Ratanamahatana CA (2004) Towards parameter-free data mining. In: Proceedings of the 10th ACM international conference on knowledge discovery and data mining (KDD), pp 206\u2013215","DOI":"10.1145\/1014052.1014077"},{"issue":"4","key":"258_CR56","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1009726428407","volume":"2","author":"J Kleinberg","year":"1998","unstructured":"Kleinberg J, Papadimitriou C, Raghavan P (1998) A microeconomic view of data mining. Data Mining Knowl Discov 2(4): 311\u2013324","journal-title":"Data Mining Knowl Discov"},{"issue":"1-2","key":"258_CR57","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John G (1997) Wrappers for feature subset selection. Artif Intell 97(1-2): 273\u2013324","journal-title":"Artif Intell"},{"issue":"2","key":"258_CR58","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.is.2007.09.001","volume":"33","author":"M Kontaki","year":"2008","unstructured":"Kontaki M, Papadopoulos AN, Manolopoulos Y (2008) Continuous subspace clustering in streaming time series. Inf Syst 33(2): 240\u2013260","journal-title":"Inf Syst"},{"key":"258_CR59","unstructured":"Kriegel HP, Zimek A (2010) Subspace clustering, ensemble clustering, alternative clustering, multiview clustering: what can we learn from each other? In: Proceedings of the 1st international workshop on discovering, summarizing and using multiple clusterings (MultiClust) held in conjunction with KDD 2010"},{"key":"258_CR60","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Kr\u00f6ger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: Proceedings of the 5th IEEE international conference on data mining (ICDM), pp 250\u2013257","DOI":"10.1109\/ICDM.2005.5"},{"issue":"1","key":"258_CR61","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10618-007-0067-9","volume":"15","author":"HP Kriegel","year":"2007","unstructured":"Kriegel HP, Borgwardt KM, Kr\u00f6ger P, Pryakhin A, Schubert M, Zimek A (2007) Future trends in data mining. Data Mining Knowl Discov 15(1): 87\u201397","journal-title":"Data Mining Knowl Discov"},{"issue":"1","key":"258_CR62","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"HP Kriegel","year":"2009","unstructured":"Kriegel HP, Kr\u00f6ger P, Zimek A (2009) Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data 3(1): 1\u201358","journal-title":"ACM Trans Knowl Discov Data"},{"key":"258_CR63","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Kr\u00f6ger P, Ntoutsi I, Zimek A (2011) Density based subspace clustering over dynamic data. In: Proceedings of the 23rd international conference on scientific and statistical database management (SSDBM), pp 387\u2013404","DOI":"10.1007\/978-3-642-22351-8_24"},{"key":"258_CR64","doi-asserted-by":"crossref","unstructured":"Li T, Ma S, Ogihara M (2004) Document clustering via adaptive subspace iteration. In: Proceedings of the 27th ACM international conference on research and development in information retrieval (SIGIR), ACM, pp 218\u2013225","DOI":"10.1145\/1008992.1009031"},{"key":"258_CR65","doi-asserted-by":"crossref","unstructured":"Li J, Li H, Soh D, Wong L (2005) A correspondence between maximal complete bipartite subgraphs and closed patterns. In: Proceedings of the 9th European conference on principles and practice of knowledge discovery in databases (PKDD), pp 146\u2013156","DOI":"10.1007\/11564126_18"},{"key":"258_CR66","doi-asserted-by":"crossref","unstructured":"Li J, Sim K, Liu G, Wong L (2008) Maximal quasi-bicliques with balanced noise tolerance: concepts and co-clustering applications. In: Proceedings of the 8th SIAM international conference on data mining (SDM), pp 72\u201383","DOI":"10.1137\/1.9781611972788.7"},{"key":"258_CR67","doi-asserted-by":"crossref","unstructured":"Liu G, Sim K, Li J (2006) Efficient mining of large maximal bicliques. In: Proceedings of the 8th international conference on data warehousing and knowledge discovery (DaWak), pp 437\u2013448","DOI":"10.1007\/11823728_42"},{"issue":"5-6","key":"258_CR68","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/sam.10062","volume":"2","author":"G Liu","year":"2009","unstructured":"Liu G, Sim K, Li J, Wong L (2009) Efficient mining of distance-based subspace clusters. Stat Anal Data Mining 2(5-6): 427\u2013444","journal-title":"Stat Anal Data Mining"},{"issue":"1","key":"258_CR69","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira SC, Oliveira AL (2004) Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans Comput Biol Bioinform 1(1): 24\u201345","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"1-3","key":"258_CR70","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/B:MACH.0000033117.77257.41","volume":"56","author":"N Mishra","year":"2005","unstructured":"Mishra N, Ron D, Swaminathan R (2005) A new conceptual clustering framework. Mach Learn 56(1-3): 115\u2013151","journal-title":"Mach Learn"},{"key":"258_CR71","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J (2008) Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In: Proceedings of the 14th ACM international conference on knowledge discovery and data mining (KDD), pp 533\u2013541","DOI":"10.1145\/1401890.1401956"},{"issue":"3","key":"258_CR72","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 HP, Sander J (2009) Subspace and projected clustering: experimental evaluation and analysis. Knowl Inf Syst 21(3): 299\u2013326","journal-title":"Knowl Inf Syst"},{"key":"258_CR73","doi-asserted-by":"crossref","unstructured":"M\u00fcller E, Assent I, Krieger R, Jansen T, Seidl T (2008) Morpheus: interactive exploration of subspace clustering. In: Proceedings of the 14th ACM international conference on knowledge discovery and data mining (KDD), pp 1089\u20131092","DOI":"10.1145\/1401890.1402026"},{"key":"258_CR74","doi-asserted-by":"crossref","unstructured":"M\u00fcller E, Assent I, G\u00fcnnemann S, Krieger R, Seidl T (2009a) Relevant subspace clustering: mining the most interesting non-redundant concepts in high dimensional data. In: Proceedings of the 9th IEEE international conference on data mining (ICDM), pp 377\u2013386","DOI":"10.1109\/ICDM.2009.10"},{"key":"258_CR75","doi-asserted-by":"crossref","unstructured":"M\u00fcller E, Assent I, Krieger R, G\u00fcnnemann S, Seidl T (2009b) DensEst: density estimation for data mining in high dimensional spaces. In: Proceedings of the 9th SIAM international conference on data mining (SDM), pp 173\u2013184","DOI":"10.1137\/1.9781611972795.16"},{"key":"258_CR76","doi-asserted-by":"crossref","unstructured":"M\u00fcller E, Assent I, Seidl T (2009c) HSM: heterogeneous subspace mining in high dimensional. In: Proceedings of the 21st international conference on scientific and statistical database management (SSDBM), pp 497\u2013516","DOI":"10.1007\/978-3-642-02279-1_36"},{"issue":"1","key":"258_CR77","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 (2009d) Evaluating clustering in subspace projections of high dimensional data. Proc VLDB Endow 2(1): 1270\u20131281","journal-title":"Proc VLDB Endow"},{"key":"258_CR78","doi-asserted-by":"crossref","unstructured":"Nagesh H, Goil S, Choudhary A (2001) Adaptive grids for clustering massive data sets. In: Proceedings of the 1st SIAM international conference on data mining (SDM)","DOI":"10.1137\/1.9781611972719.7"},{"key":"258_CR79","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-0-387-40065-5_17","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer, New York, pp 497\u2013528"},{"issue":"10","key":"258_CR80","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","volume":"22","author":"SJ Pan","year":"2010","unstructured":"Pan SJ, Yang Q (2010) A survey on transfer learning. IEEE Trans Knowl Data Eng 22(10): 1345\u20131359","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"258_CR81","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. ACM SIGKDD Explor Newsl 6(1): 90\u2013105","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"258_CR82","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th international conference on database theory (ICDT), pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"7","key":"258_CR83","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2006.106","volume":"18","author":"A Patrikainen","year":"2006","unstructured":"Patrikainen A, Meila M (2006) Comparing subspace clusterings. IEEE Trans Knowl Data Eng 18(7): 902\u2013916","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"258_CR84","doi-asserted-by":"crossref","unstructured":"Pensa R, Boulicaut J (2008) Constrained co-clustering of gene expression data. In: Proceedings of the 8th SIAM international conference on data mining (SDM), pp 25\u201336","DOI":"10.1137\/1.9781611972788.3"},{"key":"258_CR85","doi-asserted-by":"crossref","unstructured":"Rege M, Dong M, Fotouhi F (2006) Co-clustering documents and words using bipartite isoperimetric graph partitioning. In: Proceedings of the 6th IEEE international conference on data mining (ICDM), pp 532\u2013541","DOI":"10.1109\/ICDM.2006.36"},{"key":"258_CR86","unstructured":"Rymon R (1992) Search through systematic set enumeration. In: Proceedings of the 8th international conference on principles and knowledge representation and reasoning (KR), pp 539\u2013550"},{"key":"258_CR87","doi-asserted-by":"crossref","unstructured":"Sequeira K, Zaki MJ (2004) SCHISM: a new approach for interesting subspace mining. In: Proceedings of the 4th IEEE international conference on data mining (ICDM), pp 186\u2013193","DOI":"10.1109\/ICDM.2004.10099"},{"key":"258_CR88","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3324-9","volume-title":"Density estimation for statistics and data analysis (Chapman and Hall\/CRC monographs on statistics and applied probability)","author":"BW Silverman","year":"1986","unstructured":"Silverman BW (1986) Density estimation for statistics and data analysis (Chapman and Hall\/CRC monographs on statistics and applied probability), 1st edn. Chapman and Hall\/CRC, London","edition":"1"},{"key":"258_CR89","doi-asserted-by":"crossref","unstructured":"Sim K, Li J, Gopalkrishnan V, Liu G (2006) Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investment. In: Proceedings of the 6th IEEE international conference on data mining (ICDM), pp 1059\u20131063","DOI":"10.1109\/ICDM.2006.111"},{"key":"258_CR90","doi-asserted-by":"crossref","unstructured":"Sim K, Gopalkrishnan V, Chua HN, Ng SK (2009a) MACs: multi-attribute co-clusters with high correlation information. In: Proceedings of the European conference on machine learning and principles and practice of knowledge discovery in databases (ECML PKDD), pp 398\u2013413","DOI":"10.1007\/978-3-642-04174-7_26"},{"issue":"4","key":"258_CR91","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/sam.10051","volume":"2","author":"K Sim","year":"2009","unstructured":"Sim K, Li J, Gopalkrishnan V, Liu G (2009b) Mining maximal quasi-bicliques: novel algorithm and applications in the stock market and protein networks. Stat Anal Data Mining 2(4): 255\u2013273","journal-title":"Stat Anal Data Mining"},{"key":"258_CR92","doi-asserted-by":"crossref","unstructured":"Sim K, Aung A, Vivekanand G (2010a) Discovering correlated subspace clusters in 3D continuous-valued data. In: Proceedings of the 10th IEEE international conference on data mining (ICDM), pp 471\u2013480","DOI":"10.1109\/ICDM.2010.19"},{"key":"258_CR93","doi-asserted-by":"crossref","unstructured":"Sim K, Poernomo AK, Gopalkrishnan V (2010b) Mining actionable subspace clusters in sequential data. In: Proceedings of the 10th SIAM international conference on data mining (SDM), pp 442\u2013453","DOI":"10.1137\/1.9781611972801.39"},{"issue":"1","key":"258_CR94","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.ins.2010.08.035","volume":"181","author":"K Sim","year":"2011","unstructured":"Sim K, Liu G, Gopalkrishna V, Li J (2011) A case study on financial ratios via cross-graph quasi-bicliques. Inf Sci 181(1): 201\u2013216","journal-title":"Inf Sci"},{"key":"258_CR95","volume-title":"Statistical methods","author":"GW Snedecor","year":"1989","unstructured":"Snedecor GW, Cochran WG (1989) Statistical methods, 8th edn. Iowa State University Press, Ames","edition":"8"},{"key":"258_CR96","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: Proceedings of the ACM international conference on management of data (SIGMOD), pp 1\u201312","DOI":"10.1145\/233269.233311"},{"key":"258_CR97","doi-asserted-by":"crossref","unstructured":"Sun J, Faloutsos C, Papadimitriou S, Yu PS (2007) Graphscope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM international conference on knowledge discovery and data mining (KDD), pp 687\u2013696","DOI":"10.1145\/1281192.1281266"},{"key":"258_CR98","doi-asserted-by":"crossref","unstructured":"Tanay A, Sharan R, Shamir R (2004) Biclustering algorithms: a survey. Handbook of computational molecular biology. Chapman & Hall\/CRC, London","DOI":"10.1201\/9781420036275.ch26"},{"key":"258_CR99","doi-asserted-by":"crossref","unstructured":"Tomita E, Tanaka A, Takahashi H (2004) The worst-case time complexity for generating all maximal cliques. In: Proceedings of the 10th international computing and combinatorics conference (COCOON), pp 161\u2013170","DOI":"10.1007\/978-3-540-27798-9_19"},{"key":"258_CR100","unstructured":"Uno T, Kiyomi M, Arimura H (2004) LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proceedings of the 2nd international workshop on frequent itemset mining implementations (FIMI) held in conjuction with ICDM 2004"},{"key":"258_CR101","unstructured":"Vreeken J, Zimek A (2011) When pattern met subspace cluster\u2014a relationship story. In: Proceedings of the 2nd international workshop on discovering, summarizing and using multiple clusterings (MultiClust) held in conjunction with ECML PKDD 2011, pp 7\u201318"},{"key":"258_CR102","unstructured":"Wagstaff K, Cardie C, Rogers S, Schr\u00f6dl S (2001) Constrained k-means clustering with background knowledge. In: Proceedings of the 18th international conference on machine learning (ICML), pp 577\u2013584"},{"key":"258_CR103","doi-asserted-by":"crossref","unstructured":"Wang H, Wang W, Yang J, Yu PS (2002) Clustering by pattern similarity in large data sets. In: Proceedings of the ACM international conference on management of data (SIGMOD), pp 394\u2013405","DOI":"10.1145\/564691.564737"},{"issue":"3","key":"258_CR104","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch D (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3): 645\u2013678","journal-title":"IEEE Trans Neural Netw"},{"key":"258_CR105","unstructured":"Xu X, Lu Y, Tung AKH, Wang W (2006) Mining shifting-and-scaling co-regulation patterns on gene expression profiles. In: Proceedings of the 22nd international conference on data engineering (ICDE), p 89"},{"key":"258_CR106","doi-asserted-by":"crossref","unstructured":"Xu X, Lu Y, Tan KL, Tung AKH (2009) Finding time-lagged 3D clusters. In: Proceedings of the 25th international conference on data engineering (ICDE), pp 445\u2013456","DOI":"10.1109\/ICDE.2009.80"},{"key":"258_CR107","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ympev.2005.02.008","volume":"35","author":"C Yan","year":"2005","unstructured":"Yan C, Burleigh JG, Eulenstein O (2005) Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol Phylogenet Evol 35: 528\u2013535","journal-title":"Mol Phylogenet Evol"},{"key":"258_CR108","doi-asserted-by":"crossref","unstructured":"Yang J, Wang W, Wang H, Yu P (2002) \u03b4-clusters: capturing subspace correlation in a large data set. In: Proceedings of the 19th international conference on data engineering (ICDE), pp 517\u2013528","DOI":"10.1109\/ICDE.2002.994771"},{"key":"258_CR109","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Peters M, Assent I, Seidl T (2005) CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. In: Proceedings of the 11th ACM international conference on knowledge discovery and data mining (KDD), pp 736\u2013742","DOI":"10.1145\/1081870.1081965"},{"key":"258_CR110","doi-asserted-by":"crossref","unstructured":"Zhang X, Wang W (2007) An efficient algorithm for mining coherent patterns from heterogeneous microarrays. In: Proceedings of the 19th international conference on scientific and statistical database management (SSDBM), p 32","DOI":"10.1109\/SSDBM.2007.30"},{"key":"258_CR111","doi-asserted-by":"crossref","unstructured":"Zhang Q, Liu J, Wang W (2007) Incremental subspace clustering over multiple data streams. In: Proceedings of the 7th IEEE international conference on data mining (ICDM), pp 727\u2013732","DOI":"10.1109\/ICDM.2007.100"},{"key":"258_CR112","doi-asserted-by":"crossref","unstructured":"Zhao L, Zaki MJ (2005) TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data. In: Proceedings of the 25th ACM international conference on management of data (SIGMOD), pp 694\u2013705","DOI":"10.1145\/1066157.1066236"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0258-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-012-0258-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0258-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T04:47:03Z","timestamp":1561351623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-012-0258-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,24]]},"references-count":112,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["258"],"URL":"https:\/\/doi.org\/10.1007\/s10618-012-0258-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,24]]}}}