{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:35:39Z","timestamp":1771338939938,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540725299","type":"print"},{"value":"9783540725305","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72530-5_25","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:26:36Z","timestamp":1187681196000},"page":"216-223","source":"Crossref","is-referenced-by-count":55,"title":["C-DBSCAN: Density-Based Clustering with Constraints"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Ruiz","sequence":"first","affiliation":[]},{"given":"Myra","family":"Spiliopoulou","sequence":"additional","affiliation":[]},{"given":"Ernestina","family":"Menasalvas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46014-4_26","volume-title":"Methods and Applications of Artificial Intelligence","author":"I. Kopanas","year":"2002","unstructured":"Kopanas, I., Avouris, N.M., Daskalaki, S.: The Role of Domain Knowledge in a Large Scale Data Mining Projects. In: Vlahavas, I.P., Spyropoulos, C.D. (eds.) SETN 2002. LNCS (LNAI), vol.\u00a02308, Springer, Heidelberg (2002)"},{"key":"25_CR2","unstructured":"Wagstaff, K., et al.: Constrained K-means Clustering with Background Knowledge. In: ICML\u201901: Proc. of 18th Int. Conf. on Machine Learning, pp. 577\u2013584 (2001)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.S.: Clustering with Constraints: Feasibility Issues and the k-Means Algorithm. In: SIAM\u201905: Proc. of the SIAM Int. Conf. on Data Mining (2005)","DOI":"10.1137\/1.9781611972757.13"},{"key":"25_CR4","unstructured":"Bennett, K., Bradley, P., Demiriz, A.: Constrained K-Means Clustering. Technical report, Microsoft Research, MSR-TR-2000-65 (2000)"},{"key":"25_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11564126_11","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"I. Davidson","year":"2005","unstructured":"Davidson, I., Ravi, S.S.: Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical results. In: Jorge, A.M., et al. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"25_CR6","unstructured":"Ester, M., et al.: A Density-Based Algortihm for Discovering Clusters in Large Spatial Database with Noise. In: KDD\u201996: Proc. of 2nd Int. Conf. on Knowledge Discovery in Databases and Data Mining (1996)"},{"key":"25_CR7","volume-title":"ICDM\u201905: Tutorial at The 5th IEEE Int. Conf. on Data Mining","author":"I. Davidson","year":"2005","unstructured":"Davidson, I., Basu, S.: Clustering with Constraints. In: ICDM\u201905: Tutorial at The 5th IEEE Int. Conf. on Data Mining, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"25_CR8","unstructured":"Davidson, I., Basu, S.: Clustering with Constraints: Theory and Practice. In: KDD\u201906: Tutorial at The Int. Conf. on Knowledge Discovery in Databases and Data Mining (2006)"},{"key":"25_CR9","unstructured":"Gunopulos, D., Vazirgiannis, M., Halkidi, M.: From Unsupervised to Semi-supervised Learning: Algorithms and Evaluation Approaches. In: SIAM\u201906: Tutorial at Society for Industrial and Applied Mathematics Int. Conf. on Data Mining (2006)"},{"key":"25_CR10","unstructured":"Wagstaff, K., Cardie, C.: Clustering with Instance-level Constraints. In: ICML\u201900: Proc. of 17th Int. Conf. on Machine Learning, pp. 1103\u20131110 (2000)"},{"key":"25_CR11","unstructured":"Basu, S., Banerjee, A., Mooney, R.J.: Semi-supervised Clustering by Seeding. In: ICML\u201902: Proc. of the Int. Conf. on Machine Learning (2002)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A Probabilistic Framework for Semi-Supervised Clustering. In: KDD\u201904: Proc. of the 10th Int. Conf. on Knowledge Discovery in Databases and Data Mining, pp. 59\u201368 (2004)","DOI":"10.1145\/1014052.1014062"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating Constraints and Metric Learning in Semisupervised Clustering. In: ICML\u201904: Proc. of the 21th Int. Conf. on Machine Learning, pp. 11\u201319 (2004)","DOI":"10.1145\/1015330.1015360"},{"key":"25_CR14","first-page":"637","volume-title":"ICDM\u20192005: Proc. of the IEEE Int. Conf. on Data Mining","author":"M. Halkidi","year":"2005","unstructured":"Halkidi, M., et al.: A Framework for Semi-Supervised Learning Based on Subjective and Objective Clustering Criteria. In: ICDM\u20192005: Proc. of the IEEE Int. Conf. on Data Mining, pp. 637\u2013640. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"25_CR15","unstructured":"Hinneburg, A., Keim, D.A.: An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In: KDD\u201998: Proc. of the 4th Int. Conf. on Knowledge Discovery in Databases and Data Mining, pp. 58\u201365 (1998)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304182.304187","volume-title":"SIGMOD\u201999: Proc. of the 1999 ACM SIGMOD Int. Conf. on Management of Data","author":"M. Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.-P.: OPTICS: Ordering Points to Identify the Clustering Structure. In: SIGMOD\u201999: Proc. of the 1999 ACM SIGMOD Int. Conf. on Management of Data, pp. 49\u201360. ACM Press, New York (1999)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-540-28651-6_30","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2004","author":"F. Angiulli","year":"2004","unstructured":"Angiulli, F., Pizzuti, C., Ruffolo, M.: DESCRY: A Density Based Clustering Algorithm for Very Large Data Sets. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol.\u00a03177, pp. 203\u2013210. Springer, Heidelberg (2004)"},{"issue":"9","key":"25_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional Binary Search Trees Used for Associative Searching. Communications of ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of ACM"},{"key":"25_CR19","unstructured":"Newman, D., et al.: UCI Repository of ML Databases (1998)"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276304.276312","volume-title":"SIGMOD\u201998: Proceeding of the 1998 ACM SIGMOD Int. Conf. on Management of Data","author":"S. Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An Efficient Clustering Algorithm for Large Databases. In: SIGMOD\u201998: Proceeding of the 1998 ACM SIGMOD Int. Conf. on Management of Data, pp. 73\u201384. ACM Press, New York (1998)"},{"issue":"8","key":"25_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Hang, E.-H., Kumar, V.: Chameleon: Hierchachical Clustering Using Dynamic Modeling. Computer\u00a032(8), 68\u201375 (1999)","journal-title":"Computer"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective Criteria for the Evalluation of Clustering Methods. Journal of the American Statistical Association\u00a066, 846\u2013850 (1971)","journal-title":"Journal of the American Statistical Association"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining and Granular Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72530-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:56:46Z","timestamp":1558472206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72530-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725299","9783540725305"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72530-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}