{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T14:46:47Z","timestamp":1746197207707},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414568"},{"type":"electronic","value":"9783540445036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44503-x_26","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:25:32Z","timestamp":1186892732000},"page":"405-419","source":"Crossref","is-referenced-by-count":56,"title":["Constraint-Based Clustering in Large Databases"],"prefix":"10.1007","author":[{"given":"Anthony K. H.","family":"Tung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laks V.S.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,12]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD\u201998.","DOI":"10.1145\/276304.276314"},{"key":"26_CR2","unstructured":"P. Bradley, K. P. Bennet, and A. Demiriz. Constrained k-means clustering. In MSR-TR-2000-65, Microsoft Research, May 2000."},{"key":"26_CR3","unstructured":"P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In KDD\u201998."},{"key":"26_CR4","unstructured":"M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In KDD\u201996."},{"key":"26_CR5","volume-title":"Computers and Intractability: a Guide to The Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. Computers and Intractability: a Guide to The Theory of NP-Completeness. Freeman and Company, New York, 1979."},{"key":"26_CR6","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"J. Han and M. Kamber Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. COMPUTER, 32:68\u201375, 1999.","journal-title":"COMPUTER"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02523689","volume":"18","author":"D. Karger","year":"1997","unstructured":"D. Karger, R. Motwani, and G. D. S. Ramkumar. On approximating the longest path in a graph. Algorithmica, 18:99\u2013110, 1997.","journal-title":"Algorithmica"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1009726428407","volume":"2","author":"J. M. Kleinberg","year":"1998","unstructured":"J. M. Kleinberg, C. Papadimitriou, and P. Raghavan. A microeconomic view of data mining. Data Mining and Knowledge Discovery, 2:311\u2013324, 1998.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"26_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, 1990."},{"key":"26_CR11","unstructured":"L. V. S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. In SIGMOD\u201999."},{"key":"26_CR12","unstructured":"R. Ng and J. Han. Efficient and effective clustering method for spatial data mining. In VLDB\u201994."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"R. Ng, L. V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In SIGMOD\u201998.","DOI":"10.1145\/276304.276307"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In STOC\u201997.","DOI":"10.1007\/3-540-44436-X_4"},{"key":"26_CR15","unstructured":"A. K. H. Tung, R. Ng, L. Lakshmanan, and J. Han. Constraint-based clustering in large databases. \n                  http:\/\/www.cs.sfu.ca\/pub\/cs\/techreports\/2000\/CMPT2000-05.pdf\n                  \n                ."},{"key":"26_CR16","unstructured":"W. Wang, J. Yang, and R. Muntz. STING: A statistical information grid approach to spatial data mining. In VLDB\u201997."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In SIGMOD\u201996.","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44503-X_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:37:35Z","timestamp":1550752655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44503-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540414568","9783540445036"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44503-x_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}