{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:31:55Z","timestamp":1764304315277,"version":"3.37.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10115-009-0226-y","type":"journal-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T14:52:03Z","timestamp":1246978323000},"page":"299-326","source":"Crossref","is-referenced-by-count":48,"title":["Subspace and projected clustering: experimental evaluation and analysis"],"prefix":"10.1007","volume":"21","author":[{"given":"Gabriela","family":"Moise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur","family":"Zimek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peer","family":"Kr\u00f6ger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Sander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"226_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: Ramamohanarao K, Krishna P, Mohania M, Nantajeewarawat E (eds) Proceedings of the 12th international conference on database systems for advanced applications (DASFAA), Bangkok, Thailand, 2007, pp 152\u2013163","DOI":"10.1007\/978-3-540-71703-4_15"},{"key":"226_CR2","doi-asserted-by":"crossref","unstructured":"Achtert E, Kriegel H-P, Zimek A (2008) ELKI: a software system for evaluation of subspace clustering algorithms. In: Proceedings of the 20th international conference on scientific and statistical database management (SSDBM), Hong Kong, China","DOI":"10.1007\/978-3-540-69497-7_41"},{"key":"226_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Hinneburg A, Keim D (2001) On the surprising behavior of distance metrics in high dimensional space. In: Bussche J, Vianu V (eds) Proceedings of the eighth international conference on database theory (ICDT), London, UK, 2001, pp 420\u2013434","DOI":"10.1007\/3-540-44503-X_27"},{"key":"226_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Procopiuc C, Wolf J, Yu P, Park J (1999) Fast algorithms for projected clustering. In: Delis A, Faloutsos C, Ghandeharizadeh, S (eds) Proceedings of the ACM SIGMOD international conference on management of data, Philadelphia, PA, USA, 1999, pp 61\u201372","DOI":"10.1145\/304182.304188"},{"key":"226_CR5","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Yu P (2000) Finding generalized projected clusters in high dimensional spaces. In: Chen W, Naughton J, Bernstein P (eds) Proceedings of the ACM SIGMOD international conference on management of data, Dallas, TX, USA, 2000, pp 70\u201381","DOI":"10.1145\/342009.335383"},{"key":"226_CR6","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: Haas L, Tiwary A (eds) Proceedings of the ACM SIGMOD international conference on management of data, Seattle, WA, USA, 1998, pp 94\u2013105","DOI":"10.1145\/276304.276314"},{"key":"226_CR7","unstructured":"Agrawal R, Srikan R (1994) Fast algorithms for mining association rules in large databases. In: Bocca J, Jarke M, Zaniolo C (eds) Proceedings of the international conference on very large data bases VLDB, Santiago de Chile, Chile, 1994, pp 487\u2013499"},{"key":"226_CR8","doi-asserted-by":"crossref","unstructured":"Ankerst M, Breunig M, Kriegel H-P, Sander J (1999) OPTICS: Ordering points to identify the clustering structure. In: Delis A, Faloutsos C, Ghandeharizadeh S (eds) Proceedings of the ACM international conference on management of data (SIGMOD), Philadelphia, PA, USA, 1999, pp 49\u201360","DOI":"10.1145\/304182.304187"},{"key":"226_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 seventh international conference on data mining (ICDM), Omaha, NE, USA, 2007, pp 409\u2013414","DOI":"10.1109\/ICDM.2007.49"},{"key":"226_CR10","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is \u201cnearest neighbor\u201d meaningful?. In: Beeri C, Buneman P (eds) Proceedings of the seventh international conference on database theory (ICDT), Jerusalem, Israel, 1999, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"226_CR11","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C, Kailing K, Kriegel H-P, Kr\u00f6ger P (2004) Density connected clustering with local subspace preferences. In: Proceedings of the fourth international conference on data mining (ICDM), Brighton, UK, 2004, pp 27\u201334","DOI":"10.1109\/ICDM.2004.10087"},{"key":"226_CR12","doi-asserted-by":"crossref","unstructured":"Cheng C, Fu A, Zhang Y (1999) Entropy-based subspace clustering for mining numerical data. In: Proceedings of the fifth ACM international conference on knowledge discovery and data mining (SIGKDD), San Diego, CA, USA, 1999, pp 84\u201393","DOI":"10.1145\/312129.312199"},{"issue":"1","key":"226_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A Dempster","year":"1977","unstructured":"Dempster A, Laird N, Rubin D (1977) Maximum likelihood for incomplete data via the EM algorithm. J R Stat Soc Ser B 39(1): 1\u201338","journal-title":"J R Stat Soc Ser B"},{"key":"226_CR14","doi-asserted-by":"crossref","unstructured":"Ert\u00f6z L, Steinbach M, Kumar V (2003) Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Barbara D, Kamath C (eds) Proceedings of the third SIAM international conference on data mining (SDM), San Francisco, CA, USA, 2003","DOI":"10.1137\/1.9781611972733.5"},{"key":"226_CR15","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad U (eds) Proceedings of the second ACM international conference on knowledge discovery and data mining (KDD), Portland, OR, USA, 1996, pp 226\u2013231"},{"issue":"1","key":"226_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-006-0009-7","volume":"12","author":"D Gondek","year":"2007","unstructured":"Gondek D, Hofmann T (2007) Non-redundant data clustering. Knowl Inf Syst 12(1): 1\u2013116","journal-title":"Knowl Inf Syst"},{"key":"226_CR17","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2006","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques, 2nd edn. Academic Press, London","edition":"2"},{"key":"226_CR18","unstructured":"Hinneburg A, Aggarwal C, Keim D (2000) What is the nearest neighbor in high dimensional spaces? In: Abbadi A, Brodie M, Chakravarthy, Dayal U, Kamel N, Schlageter G, Whang K (eds) Proceedings of the 26th international conference on very large data bases (VLDB), Cairo, Egypt, 2000, pp 506\u2013515"},{"issue":"4","key":"226_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10115-003-0086-9","volume":"5","author":"A Hinneburg","year":"2003","unstructured":"Hinneburg A, Keim D (2003) A general approach to clustering in large databases with noise. Knowl Inf Syst 5(4): 387\u2013415","journal-title":"Knowl Inf Syst"},{"key":"226_CR20","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel H-P, Kr\u00f6ger P (2004) Density-connected subspace clustering for high-dimensional data. In: Berry M, Dayal U, Kamath C, Skilicorn D (eds) Proceedings of the fourth SIAM international conference on data mining (SDM), Orlando, FL, USA, 2004, pp 1\u201311","DOI":"10.1137\/1.9781611972740.23"},{"key":"226_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data: an introduction to cluster analyis","author":"L Kaufman","year":"1990","unstructured":"Kaufman L, Rousseeuw P (1990) Finding groups in data: an introduction to cluster analyis. Wiley, New York"},{"key":"226_CR22","doi-asserted-by":"crossref","unstructured":"Kriegel H-P, Kr\u00f6ger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: Proceedings of the fifth international conference on data mining, Houston, TX, USA, 2005, pp 250\u2013257","DOI":"10.1109\/ICDM.2005.5"},{"key":"226_CR23","doi-asserted-by":"crossref","unstructured":"Kriegel H-P, 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)","DOI":"10.1145\/1497577.1497578"},{"issue":"1","key":"226_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0116-0","volume":"17","author":"T Li","year":"2008","unstructured":"Li T (2008) Clustering based on matrix approximation: a unifying view. Knowl Inf Syst 17(1): 1\u2013133","journal-title":"Knowl Inf Syst"},{"key":"226_CR25","doi-asserted-by":"crossref","unstructured":"Liu G, Li J, Sim K, Wong L (2007) Distance based subspace clustering with flexible dimension partitioning. In: Proceedings of the 23rd international conference on data engineering (ICDE), Istanbul, Turkey, 2007, pp 1250\u20131254","DOI":"10.1109\/ICDE.2007.368985"},{"key":"226_CR26","unstructured":"McQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Fifth Berkeley symposium on mathematics, statistics, and probabilistics, vol 1, 1967, pp 281\u2013297"},{"key":"226_CR27","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J, Ester M (2006) P3C: A robust projected clustering algorithm. In: Proceedings of the sixth international conference on data mining (ICDM), Hong Kong, China, 2006, pp 414\u2013425","DOI":"10.1109\/ICDM.2006.123"},{"issue":"3","key":"226_CR28","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. Knowl Inf Syst 14(3): 273\u2013298","journal-title":"Knowl Inf Syst"},{"key":"226_CR29","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 (SIGKDD), Las Vegas, NV, USA, 2008, pp 533\u2013541","DOI":"10.1145\/1401890.1401956"},{"key":"226_CR30","doi-asserted-by":"crossref","unstructured":"Nagesh H, Goil S, Choudhary A (2001) Adaptive grids for clustering massive data sets. In: Proceedings of the first SIAM international conference on data mining (SDM), Chicago, IL, USA, 2001, pp 1\u201317","DOI":"10.1137\/1.9781611972719.7"},{"key":"226_CR31","unstructured":"Newman D, Hettich S, Blake C, Merz C (1998) UCI repository of machine learning databases 1998"},{"issue":"3","key":"226_CR32","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TKDE.2005.47","volume":"17","author":"K Ng","year":"2005","unstructured":"Ng K, Fu A, Wong C (2005) Projective clustering by histograms. IEEE Trans Knowl Data Eng 17(3): 369\u2013383","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"226_CR33","unstructured":"Ng R, Han J(1994) Efficient and effective clustering methods for spatial data mining. In: Bocca J, Jarke M, Zaniolo C (eds) Proceedings of the international conference on very large data bases VLDB, Santiago de Chile, Chile, 1994, pp 487\u2013499"},{"issue":"1","key":"226_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. ACM SIGKDD Explor Newsl 6(1): 90\u2013105","journal-title":"ACM SIGKDD Explor Newsl"},{"issue":"7","key":"226_CR35","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":"226_CR36","doi-asserted-by":"crossref","unstructured":"Procopiuc C, Jones M, Agarwal P, Murali T (2002) A Monte Carlo algorithm for fast projective clustering. In: Franklin M, Moon B, Ailamaki, A (eds) Proceedings of the ACM international conference on management of data (SIGMOD, Madison, WI, USA, 2002, pp 418\u2013427","DOI":"10.1145\/564691.564739"},{"key":"226_CR37","unstructured":"R project http:\/\/www.r-project.org\/"},{"key":"226_CR38","unstructured":"UCI Machine Learning Repository http:\/\/archive.ics.uci.edu\/ml\/"},{"key":"226_CR39","doi-asserted-by":"crossref","unstructured":"Sequeira K, Zaki M (2004) SCHISM: a new approach for interesting subspace mining. In: Proceedings of the fourth international conference on data mining (ICDM), Brighton, UK, 2004, pp 186\u2013193","DOI":"10.1109\/ICDM.2004.10099"},{"issue":"1","key":"226_CR40","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10115-005-0233-6","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Chen J, Fu A, Cheung W (2007) Capabilities of outlier detection schemes in large datasets, framework and methodologies. Knowl Inf Syst 11(1): 45\u201384","journal-title":"Knowl Inf Syst"},{"issue":"11","key":"226_CR41","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1109\/TKDE.2004.74","volume":"16","author":"K Yip","year":"2004","unstructured":"Yip K, Cheung D, Ng M (2004) HARP: a practical projected clustering algorithm. IEEE Trans Knowl Data Eng 16(11): 1387\u20131397","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"226_CR42","doi-asserted-by":"crossref","unstructured":"Yip K, Cheung D, Ng M (2005) On discovery of extremely low-dimensional clusters using semi-supervised projected clustering. In: Proceedings of the 21st international conference on data engineering (ICDE), Tokyo, Japan, 2005, pp 329\u2013340","DOI":"10.1109\/ICDE.2005.96"},{"key":"226_CR43","unstructured":"Yip K, Qi P, Schultz M, Cheung D, Cheung K (2006) SemBiosphere: a semantic web approach to recommending microarray clustering services. In: Proceedings of the 11th pacific symposium on biocomputing (PSB), Maui, HI, USA, 2006"},{"issue":"2","key":"226_CR44","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TKDE.2005.29","volume":"17","author":"M Yiu","year":"2005","unstructured":"Yiu M, Mamoulis N (2005) Iterative projected clustering by subspace mining. IEEE Trans Knowl Data Eng 17(2): 176\u2013189","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0226-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0226-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0226-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T19:29:08Z","timestamp":1739215748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0226-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0226-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2009,7,8]]}}}