{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:31:50Z","timestamp":1764304310478},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_14","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T13:37:46Z","timestamp":1279460266000},"page":"132-141","source":"Crossref","is-referenced-by-count":9,"title":["Linear Manifold Clustering"],"prefix":"10.1007","author":[{"given":"Robert","family":"Haralick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rave","family":"Harpaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/304182.304188","volume-title":"Proceedings of the 1999 ACM SIGMOD international conference on Management of data","author":"C.C. Aggarwal","year":"1999","unstructured":"Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering. In: Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pp. 61\u201372. ACM Press, New York (1999)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: Finding generalized projected clusters in high dimensional spaces. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp. 70\u201381 (2000)","DOI":"10.1145\/342009.335383"},{"key":"14_CR3","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: Proceedings of the ACM SIGMOD international conference on Management of data, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"key":"14_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":"14_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta, S.: Learning mixtures of gaussians. In: Proc. of the 40th Ann. IEEE Symp. on Foundations of Computer Science (1999)","DOI":"10.1109\/SFFCS.1999.814639"},{"key":"14_CR6","unstructured":"Haralick, R.M., Rome, J.E., Miasnikov, A.: A hierarchical projection pursuit clustering algorithm. In: 17th International Conference on Pattern Recognition, ICPR (2004)"},{"key":"14_CR7","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD archive (1999), \n                    \n                      http:\/\/kdd.ics.uci.edu"},{"key":"14_CR8","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1996), Portland, OR, pp. 226\u2013231 (1996)"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0031-3203(86)90030-0","volume":"19","author":"J. Kittler","year":"1986","unstructured":"Kittler, J., Illingworth, J.: Minimum error thresholding. Pattern Recogn.\u00a019(1), 41\u201347 (1986)","journal-title":"Pattern Recogn."},{"key":"14_CR10","first-page":"281","volume-title":"Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability","author":"J.B. MacQueen","year":"1967","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01, pp. 281\u2013297. University of California Press, Berkeley (1967)"},{"key":"14_CR11","unstructured":"Nagesh, H., Goil, S., Choudhary, A.: Mafia: Efficient and scalable subspace clustering for very large data sets (1999)"}],"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_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:45:12Z","timestamp":1619491512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11510888_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269236","9783540318910"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11510888_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}