{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T11:42:02Z","timestamp":1769341322232,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T00:00:00Z","timestamp":1184976000000},"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":[[2008,3]]},"DOI":"10.1007\/s10115-007-0090-6","type":"journal-article","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T12:48:39Z","timestamp":1184935719000},"page":"273-298","source":"Crossref","is-referenced-by-count":53,"title":["Robust projected clustering"],"prefix":"10.1007","volume":"14","author":[{"given":"Gabriela","family":"Moise","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Sander","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ester","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,21]]},"reference":[{"key":"90_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Procopiuc C, Wolf J, Yu P, and 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, pp 61\u201372","DOI":"10.1145\/304182.304188"},{"key":"90_CR2","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, pp 70\u201381","DOI":"10.1145\/342009.335383"},{"key":"90_CR3","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, pp 94\u2013105","DOI":"10.1145\/276304.276314"},{"key":"90_CR4","unstructured":"Agrawal R, Srikan R (1994) Fast algorithms for mining association rules. In: Bocca J, Jarke M, Zaniolo C (eds) Proceedings of the international conference on very large data bases VLDB, Santiago de Chile, Chile, pp 487\u2013499"},{"issue":"12","key":"90_CR5","doi-asserted-by":"crossref","first-page":"6745","DOI":"10.1073\/pnas.96.12.6745","volume":"96","author":"U Alon","year":"1999","unstructured":"Alon U, Barkai N, Notterman D, Gish K, Ybarra S, Mack D and Levine A (1999). Broad patterns of gene expression revealed by clustering of tumor and normal colon tissues probed by oligonucleotide arrays. Proc Natl Acad Sci USA 96(12): 6745\u20136750","journal-title":"Proc Natl Acad Sci USA"},{"key":"90_CR6","doi-asserted-by":"crossref","unstructured":"Andritsos P, Tsaparas P, Miller J, Sevcik K (2004) LIMBO: scalable clustering of categorical data. In Proceedings of international conference on extending database technology EDBT, Heraklion, Greece, pp 123\u2013146","DOI":"10.1007\/978-3-540-24741-8_9"},{"key":"90_CR7","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein J, Ramakrishnan R, Shaft U (1999) When is nearest neighbor meaningful? Lecture Notes in Computer Science, vol. 1540. Springer, Berlin, pp 217\u2013235","DOI":"10.1007\/3-540-49257-7_15"},{"key":"90_CR8","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 and Rubin D (1977). Maximum likelihood for incomplete data via the EM algorithm. J Roy Stat Soc 39: 1\u201338","journal-title":"J Roy Stat Soc"},{"issue":"2","key":"90_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1046456.1046468","volume":"6","author":"G Gan","year":"2004","unstructured":"Gan G and Wu J (2004). Subspace clustering for high dimensional categorical data. ACM SIGKDD Explor Newslett 6(2): 87\u201394","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"90_CR10","doi-asserted-by":"crossref","unstructured":"Ganti V, Gehrke J, Ramakrishnan R (1999) CACTUS\u2014clustering categorical data using summaries. In: ACM SIGKDD international conference on knowledge discovery and data mining, San Diego, pp 73\u201383","DOI":"10.1145\/312129.312201"},{"issue":"4","key":"90_CR11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10115-003-0086-9","volume":"5","author":"A Hinneburg","year":"2003","unstructured":"Hinneburg A and 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":"90_CR12","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel H, Kr\u0151ger P (2004) Density-connected subspace clustering for high-dimensional data. In: Berry M, Dayal U, Kamath C, Skilicorn D (eds) Proceedings of the SIAM international conference on data mining, Lake Buena Vista, April 2004, pp 1\u201311","DOI":"10.1137\/1.9781611972740.23"},{"key":"90_CR13","doi-asserted-by":"crossref","unstructured":"Kriegel H, Kr\u0151ger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: Proceedings of the IEEE ICDM international conference on data mining, Houston, pp 250\u2013257","DOI":"10.1109\/ICDM.2005.5"},{"key":"90_CR14","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J, Ester M (2006) P3C: a robust projected clustering algorithm. In: Proceedings of the IEEE ICDM international conference on data mining, Hong Kong, pp 414\u2013425","DOI":"10.1109\/ICDM.2006.123"},{"key":"90_CR15","doi-asserted-by":"crossref","unstructured":"Nagesh H, Goil S, Choudhary A (2001) Adaptive grids for clustering massive data sets. In: Proceedings of the SIAM international conference on data mining, Chicago, pp 1\u201317","DOI":"10.1137\/1.9781611972719.7"},{"issue":"3","key":"90_CR16","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 and Wong C (2005). Projective clustering by histograms. IEEE Trans Knowl Data Eng 17(3): 369\u2013383","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"90_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons L, Haque E and Liu H (2004). Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newslett 6(1): 90\u2013105","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"90_CR18","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 SIGMOD international conference on management of data, Madison, pp 418\u2013427","DOI":"10.1145\/564691.564739"},{"issue":"411","key":"90_CR19","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1080\/01621459.1990.10474920","volume":"85","author":"P Rousseeuw","year":"1990","unstructured":"Rousseeuw P and Van Zomeren B (1990). Unmasking multivariate outliers and leverage points. J Am Stat Assoc 85(411): 633\u2013651","journal-title":"J Am Stat Assoc"},{"key":"90_CR20","volume-title":"Statistical methods","author":"G Snedecor","year":"1989","unstructured":"Snedecor G and Cochran W (1989). Statistical methods. Iowa State University Press, Cambridge"},{"issue":"1","key":"90_CR21","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 and 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":"1","key":"90_CR22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10115-005-0216-7","volume":"9","author":"J Wang","year":"2006","unstructured":"Wang J and Karypis G (2006). On efficiently summarizing categorical databases. Knowl Inf Syst 9(1): 19\u201337","journal-title":"Knowl Inf Syst"},{"issue":"11","key":"90_CR23","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 and 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":"90_CR24","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 IEEE ICDE international conference on data engineering, Tokyo, pp 329\u2013340","DOI":"10.1109\/ICDE.2005.96"},{"issue":"2","key":"90_CR25","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TKDE.2005.29","volume":"17","author":"M Yiu","year":"2005","unstructured":"Yiu M and Mamoulis N (2005). Frequent-pattern based iterative projected clustering. IEEE Trans Knowl Data Eng 17(2): 176\u2013189","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"90_CR26","doi-asserted-by":"crossref","unstructured":"Zaki M, Peters M, Assent I, Seidl T (2005) CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. In: Grossman R, Bayardo R, Bennett K (eds) Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining, Chicago, pp 733\u2013742","DOI":"10.1145\/1081870.1081965"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0090-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-007-0090-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0090-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:09:21Z","timestamp":1737317361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-007-0090-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,21]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1007\/s10115-007-0090-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,21]]}}}