{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:06:35Z","timestamp":1725559595703},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540269236"},{"type":"electronic","value":"9783540318910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11510888_11","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T13:37:46Z","timestamp":1279460266000},"page":"100-109","source":"Crossref","is-referenced-by-count":9,"title":["SSC: Statistical Subspace Clustering"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Candillier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabelle","family":"Tellier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Bousquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering. In: ACM SIGMOD Int. Conf. on Management of Data, pp. 61\u201372 (1999)","DOI":"10.1145\/304182.304188"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: ACM SIGMOD Int. Conf. on Management of Data, Seattle, Washington, pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"11_CR3","unstructured":"Berkhin, P.: Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, California (2002)"},{"key":"11_CR4","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"11_CR5","unstructured":"Bradley, P., Fayyad, U., Reina, C.: Scaling EM (Expectation-Maximization) clustering to large databases. Technical report, Microsoft Research (August 1998)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, C.H., Fu, A.W.-C., Zhang, Y.: Entropy-based subspace clustering for mining numerical data. In: Knowledge Discovery and Data Mining, pp. 84\u201393 (1999)","DOI":"10.1145\/312129.312199"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Domeniconi, C., Papadopoulos, D., Gunopolos, D., Ma, S.: Subspace clustering of high dimensional data. In: SIAM Int. Conf. on Data Mining (2004)","DOI":"10.1137\/1.9781611972740.58"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H.-P., Kr\u00f6ger, P.: Density-connected subspace clustering for high-dimensional data. In: SIAM Int. Conf. on Data Mining, pp. 246\u2013257 (2004)","DOI":"10.1137\/1.9781611972740.23"},{"key":"11_CR9","unstructured":"Nagesh, H., Goil, S., Choudhary, A.: Mafia: Efficient and scalable subspace clustering for very large data sets. Technical report, Northwestern University (1999)"},{"key":"11_CR10","unstructured":"Parsons, L., Haque, E., Liu, H.: Evaluating subspace clustering algorithms. In: Workshop on Clustering High Dimensional Data and its Applications, SIAM Int. Conf. on Data Mining, pp. 48\u201356 (2004)"},{"key":"11_CR11","first-page":"401","volume-title":"18th Int. Conf. on Machine Learning","author":"D. Pelleg","year":"2001","unstructured":"Pelleg, D., Moore, A.: Mixtures of rectangles: Interpretable soft clustering. In: Brodley, C., Danyluk, A. (eds.) 18th Int. Conf. on Machine Learning, pp. 401\u2013408. Morgan Kaufmann, San Francisco (2001)"},{"key":"11_CR12","unstructured":"Sarafis, I.A., Trinder, P.W., Zalzala, A.M.S.: Towards effective subspace clustering with an evolutionary algorithm. In: IEEE Congress on Evolutionary Computation, Canberra, Australia (December 2003)"},{"key":"11_CR13","unstructured":"Woo, K.-G., Lee, J.-H.: FINDIT: a fast and intelligent subspace clustering algorithm using dimension voting. PhD thesis, Korea Advanced Institute of Science and Technology, Department of Electrical Engineering and Computer Science (2002)"},{"key":"11_CR14","unstructured":"Ye, L., Spetsakis, M.E.: Clustering on unobserved data using mixture of gaussians. Technical report, York University, Toronto, Canada (October 2003)"},{"key":"11_CR15","unstructured":"Yip, K.Y., Cheung, D.W., Ng, M.K.: A highly-usable projected clustering algorithm for gene expression profiles. In: 3rd ACM SIGKDD Workshop on Data Mining in Bioinformatics, pp. 41\u201348 (2003)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11510888_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:45:11Z","timestamp":1619491511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11510888_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269236","9783540318910"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11510888_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}