{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:37Z","timestamp":1725567037722},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540288947"},{"type":"electronic","value":"9783540319832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11552413_56","type":"book-chapter","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T15:45:01Z","timestamp":1285775101000},"page":"391-397","source":"Crossref","is-referenced-by-count":2,"title":["A New Cell-Based Clustering Method for High-Dimensional Data Mining Applications"],"prefix":"10.1007","author":[{"given":"Jae-Woo","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)"},{"issue":"2","key":"56_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1046456.1046468","volume":"6","author":"G. Gan","year":"2004","unstructured":"Gan, G., Wu, J.: Subspace Clustering for High Dimensional Categorical Data. ACM SIGKDD Explorations networks\u00a06(2), 87\u201394 (2004)","journal-title":"ACM SIGKDD Explorations networks"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic Subspace Clustering of High Dimensional Data Mining Applications. In: Proc. of ACM SIGMOD, pp. 94\u2013105 (1998)","DOI":"10.1145\/276304.276314"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Nagesh, H., Goil, S., Choudhary, A.: A Scalable Parallel Subspace Clustering Algorithm for Massive data Sets. In: Proc. of Int. Conf. on parallel Processing, pp. 477\u2013486 (2000)","DOI":"10.1109\/ICPP.2000.876164"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Aggrawal, C., Wolf, J., Yu, P., Procopiuc, C., Park, J.: Fast Algorithms for Projected Clustering. In: Proc. of ACM SIGMOD, pp. 61\u201372 (1999)","DOI":"10.1145\/304182.304188"},{"key":"56_CR6","unstructured":"Woo, K., Lee, J.: FINDIT: A Fast and Intelligent Subspace Clustering Algorithm using Dimension Voting. PhD thesis, Korea Advanced Institute of Sci.&Tech, Dept. of CS (2002)"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Procopiuc, C., Jones, M., Agrawal, P., Murali, T.: A More Carlo Algorithm for Fast Projective Clustering. Proc. of ACM SIGMOD, 418\u2013427 (2002)","DOI":"10.1145\/564736.564739"},{"key":"56_CR8","unstructured":"http:\/\/www.almaden.ibm.com\/cs\/quest"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11552413_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:44:26Z","timestamp":1605642266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11552413_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540288947","9783540319832"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11552413_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}