{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:49:59Z","timestamp":1761598199472},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T00:00:00Z","timestamp":1587513600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T00:00:00Z","timestamp":1587513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10044-020-00884-7","type":"journal-article","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T09:03:28Z","timestamp":1587546208000},"page":"1651-1663","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["ASCRClu: an adaptive subspace combination and reduction algorithm for clustering of high-dimensional data"],"prefix":"10.1007","volume":"23","author":[{"given":"Kavan","family":"Fatehi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Rezvani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mansoor","family":"Fateh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"key":"884_CR1","doi-asserted-by":"crossref","unstructured":"Achtert E, B\u00f6hm C, Kriegel H-P, Kr\u00f6ger P, M\u00fcller-Gorman I, Zimek A (2007) Detection and visualization of subspace cluster hierarchies. In: DASFAA , vol 4443, pp 152\u2013163. Springer","DOI":"10.1007\/978-3-540-71703-4_15"},{"key":"884_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Wolf JL, Yu PS, Procopiuc C, Park JS (1999) Fast algorithms for projected clustering. In: ACM SIGKDD record, vol\u00a028, pp\u00a061\u201372. ACM","DOI":"10.1145\/304181.304188"},{"key":"884_CR3","unstructured":"Agrawal R, Gehrke JE, Gunopulos D, Raghavan P (1999) Automatic subspace clustering of high dimensional data for data mining applications, Dec 14. US Patent 6,003,029"},{"key":"884_CR4","doi-asserted-by":"crossref","unstructured":"Aksehirli E, Goethals B, M\u00fcller E (2015) Efficient cluster detection by ordered neighborhoods. In: International conference on big data analytics and knowledge discovery, pp\u00a015\u201327. Springer","DOI":"10.1007\/978-3-319-22729-0_2"},{"key":"884_CR5","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, M\u00fcller E, Seidl T (2007) Dusc: dimensionality unbiased subspace clustering. In: Seventh IEEE international conference on data mining, 2007. ICDM 2007, pp\u00a0409\u2013414. IEEE","DOI":"10.1109\/ICDM.2007.49"},{"key":"884_CR6","unstructured":"Bohm C, Railing K, Kriegel H-P, Kroger P (2004) Density connected clustering with local subspace preferences. In: Fourth IEEE international conference on data mining, 2004. ICDM\u201904, pp 27\u201334. IEEE"},{"key":"884_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.csda.2012.12.008","volume":"71","author":"C Bouveyron","year":"2014","unstructured":"Bouveyron C, Brunet-Saumard C (2014) Model-based clustering of high-dimensional data: a review. Comput Stat Data Anal 71:52\u201378","journal-title":"Comput Stat Data Anal"},{"issue":"1","key":"884_CR8","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.patcog.2011.06.004","volume":"45","author":"X Chen","year":"2012","unstructured":"Chen X, Ye Y, Xu X, Huang JZ (2012) A feature group weighting method for subspace clustering of high-dimensional data. Pattern Recognit 45(1):434\u2013446","journal-title":"Pattern Recognit"},{"issue":"1","key":"884_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TKDE.2008.224","volume":"22","author":"Y-H Chu","year":"2010","unstructured":"Chu Y-H, Huang J-W, Chuang K-T, Yang D-N, Chen M-S (2010) Density conscious subspace clustering for high-dimensional data. IEEE Trans Knowl Data Eng 22(1):16\u201330","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"884_CR10","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt L, Jaeger M, Lee SD, Mannila H (2010) A theory of inductive query answering. In: Inductive databases and constraint-based data mining, pp\u00a079\u2013103. Springer","DOI":"10.1007\/978-1-4419-7738-0_4"},{"key":"884_CR11","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ins.2016.01.101","volume":"348","author":"Z Deng","year":"2016","unstructured":"Deng Z, Choi K-S, Jiang Y, Wang J, Wang S (2016) A survey on soft subspace clustering. Inf Sci 348:84\u2013106","journal-title":"Inf Sci"},{"key":"884_CR12","unstructured":"Dongen S (2000) Performance criteria for graph clustering and Markov cluster experiments. CWI (Centre for Mathematics and Computer Science)"},{"issue":"1","key":"884_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10462-013-9400-4","volume":"44","author":"AA Esmin","year":"2015","unstructured":"Esmin AA, Coelho RA, Matwin S (2015) A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data. Artif Intell Rev 44(1):23\u201345","journal-title":"Artif Intell Rev"},{"issue":"4","key":"884_CR14","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/j.patcog.2014.11.003","volume":"48","author":"G Gan","year":"2015","unstructured":"Gan G, Ng MK-P (2015) Subspace clustering using affinity propagation. Pattern Recognit 48(4):1455\u20131464","journal-title":"Pattern Recognit"},{"issue":"11","key":"884_CR15","doi-asserted-by":"publisher","first-page":"3703","DOI":"10.1016\/j.patcog.2015.05.016","volume":"48","author":"G Gan","year":"2015","unstructured":"Gan G, Ng MK-P (2015) Subspace clustering with automatic feature grouping. Pattern Recognit 48(11):3703\u20133713","journal-title":"Pattern Recognit"},{"key":"884_CR16","unstructured":"Goil S, Nagesh H, Choudhary A (1999) Mafia: efficient and scalable subspace clustering for very large data sets. In: Proceedings of the 5th ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a0443\u2013452. ACM"},{"key":"884_CR17","first-page":"1","volume":"56","author":"J Hu","year":"2017","unstructured":"Hu J, Pei J (2017) Subspace multi-clustering: a review. Knowl Inf Syst 56:1\u201328","journal-title":"Knowl Inf Syst"},{"key":"884_CR18","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel H-P, Kr\u00f6ger P (2004) Density-connected subspace clustering for high-dimensional data. In: Proceedings of the 2004 SIAM international conference on data mining, SIAM, pp\u00a0246\u2013256","DOI":"10.1137\/1.9781611972740.23"},{"key":"884_CR19","unstructured":"Kriegel H-P, Kroger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: Fifth IEEE international conference on data mining, pp\u00a08\u2013pp. IEEE"},{"key":"884_CR20","unstructured":"Kuncheva LI, Hadjitodorov ST (2004) Using diversity in cluster ensembles. In: 2004 IEEE international conference on systems, man and cybernetics, vol\u00a02, pp\u00a01214\u20131219. IEEE"},{"key":"884_CR21","doi-asserted-by":"crossref","unstructured":"Mai ST, Assent I, Storgaard M (2016) Anydbc: an efficient anytime density-based clustering algorithm for very large complex datasets. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a01025\u20131034. ACM","DOI":"10.1145\/2939672.2939750"},{"issue":"3","key":"884_CR22","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/s10618-013-0317-y","volume":"28","author":"B McWilliams","year":"2014","unstructured":"McWilliams B, Montana G (2014) Subspace clustering of high-dimensional data: a predictive approach. Data Min Knowl Discov 28(3):736\u2013772","journal-title":"Data Min Knowl Discov"},{"key":"884_CR23","doi-asserted-by":"crossref","unstructured":"Nie F, Wang X, Huang H (2014) Clustering and projected clustering with adaptive neighbors. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp\u00a0977\u2013986. ACM","DOI":"10.1145\/2623330.2623726"},{"key":"884_CR24","doi-asserted-by":"crossref","unstructured":"Nie F, Wang X, Jordan MI, Huang H (2016) The constrained Laplacian rank algorithm for graph-based clustering. In: AAAI, pp\u00a01969\u20131976","DOI":"10.1609\/aaai.v30i1.10302"},{"key":"884_CR25","unstructured":"Nie F, Yuan J, Huang H (2014) Optimal mean robust principal component analysis. In: International conference on machine learning, pp\u00a01062\u20131070"},{"key":"884_CR26","doi-asserted-by":"crossref","unstructured":"Ntoutsi I, Zimek A, Palpanas T, Kr\u00f6ger P, Kriegel H-P (2012) Density-based projected clustering over high dimensional data streams. In: Proceedings of the 2012 SIAM international conference on data mining, pp\u00a0987\u2013998. SIAM","DOI":"10.1137\/1.9781611972825.85"},{"key":"884_CR27","doi-asserted-by":"crossref","unstructured":"Procopiuc CM, Jones M, Agarwal PK, Murali T (2002) A monte carlo algorithm for fast projective clustering. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, pp\u00a0418\u2013427. ACM","DOI":"10.1145\/564691.564739"},{"issue":"6191","key":"884_CR28","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492\u20131496","journal-title":"Science"},{"issue":"2","key":"884_CR29","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10618-012-0258-x","volume":"26","author":"K Sim","year":"2013","unstructured":"Sim K, Gopalkrishnan V, Zimek A, Cong G (2013) A survey on enhanced subspace clustering. Data Min Knowl Discov 26(2):332\u2013397","journal-title":"Data Min Knowl Discov"},{"key":"884_CR30","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. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"key":"884_CR31","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1109\/TII.2016.2628747","volume":"13","author":"B Wu","year":"2017","unstructured":"Wu B, Wilamowski BM (2017) A fast density and grid based clustering method for data with arbitrary shapes and noise. IEEE Trans Ind Inf 13:1620\u20131628","journal-title":"IEEE Trans Ind Inf"},{"issue":"3","key":"884_CR32","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/TKDE.2015.2499200","volume":"28","author":"Z Yu","year":"2016","unstructured":"Yu Z, Luo P, You J, Wong H-S, Leung H, Wu S, Zhang J, Han G (2016) Incremental semi-supervised clustering ensemble for high dimensional data clustering. IEEE Trans Knowl Data Eng 28(3):701\u2013714","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"884_CR33","unstructured":"Zhu B, Mozo A, Ordozgoiti B (2016) PSCEG: an unbiased parallel subspace clustering algorithm using exact grids. In: European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN)"},{"key":"884_CR34","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.asoc.2013.03.002","volume":"14","author":"L Zhu","year":"2014","unstructured":"Zhu L, Cao L, Yang J, Lei J (2014) Evolving soft subspace clustering. Appl Soft Comput 14:210\u2013228","journal-title":"Appl Soft Comput"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-020-00884-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-020-00884-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-020-00884-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:54:24Z","timestamp":1666400064000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-020-00884-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,22]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s10044-020-00884-7","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,22]]},"assertion":[{"value":"1 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}