{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:58:00Z","timestamp":1760014680138,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030898168"},{"type":"electronic","value":"9783030898175"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89817-5_14","type":"book-chapter","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T20:35:26Z","timestamp":1634762126000},"page":"187-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["DBSCAN Parameter Selection Based on K-NN"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7805-5891","authenticated-orcid":false,"given":"Leonardo","family":"Delgado","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7618-8762","authenticated-orcid":false,"given":"Eduardo F.","family":"Morales","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,21]]},"reference":[{"key":"14_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1027\u20131035. Society for Industrial and Applied Mathematics, USA (2007)"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/0893-6080(90)90058-S","volume":"3","author":"AF Atiya","year":"1990","unstructured":"Atiya, A.F.: An unsupervised learning technique for artificial neural networks. Neural Netw. 3(6), 707\u2013711 (1990)","journal-title":"Neural Netw."},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bezdek, J.C., Ehrlich, R., Full, W.: FCM: the fuzzy c-means clustering algorithm. Comput. Geosci. 10(2\u20133), 191\u2013203 (1984). https:\/\/doi.org\/10.1016\/0098-3004(84)90020-7","DOI":"10.1016\/0098-3004(84)90020-7"},{"key":"14_CR4","unstructured":"Brownlee, J.: How to generate test datasets in python with scikit-learn, December 2018. https:\/\/machinelearningmastery.com\/generate-test-datasets-python-scikit-learn\/"},{"key":"14_CR5","unstructured":"Chang, A.X., et al.: ShapeNet: an information-rich 3D model repository. Technical report. arXiv:1512.03012 [cs.GR], Stanford University \u2013 Princeton University \u2013 Toyota Technological Institute at Chicago (2015)"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Chang, H., Yeung, D.Y.: Robust path-based spectral clustering. Pattern Recogn. 41(1), 191\u2013203 (2008). https:\/\/doi.org\/10.1016\/j.patcog.2007.04.010","DOI":"10.1016\/j.patcog.2007.04.010"},{"key":"14_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD 1996, pp. 226\u2013231. AAAI Press (1996). http:\/\/dl.acm.org\/citation.cfm?id=3001460.3001507"},{"issue":"2","key":"14_CR8","first-page":"139","volume":"2","author":"DH Fisher","year":"1987","unstructured":"Fisher, D.H.: Knowledge acquisition via incremental conceptual clustering. Mach. Learn. 2(2), 139\u2013172 (1987)","journal-title":"Mach. Learn."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1186\/1471-2105-8-3","volume":"8","author":"L Fu","year":"2007","unstructured":"Fu, L., Medico, E.: Flame, a novel fuzzy clustering method for the analysis of DNA microarray data. BMC Bioinform. 8(1), 3 (2007). https:\/\/doi.org\/10.1186\/1471-2105-8-3","journal-title":"BMC Bioinform."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a k-means clustering algorithm. Appl. Stat. 28(1), 100 (1979). https:\/\/doi.org\/10.2307\/2346830","journal-title":"Appl. Stat."},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"He, Y.Z., Wang, C.H., Qiu, B.Z.: Clustering boundary points detection algorithm based on gradient binarization. Appl. Mech. Mater. 263\u2013266, 2358\u20132363 (2012). https:\/\/doi.org\/10.4028\/www.scientific.net\/amm.263-266.2358","DOI":"10.4028\/www.scientific.net\/amm.263-266.2358"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11590316_1","volume-title":"Pattern Recognition and Machine Intelligence","author":"AK Jain","year":"2005","unstructured":"Jain, A.K., Law, M.H.C.: Data clustering: a user\u2019s dilemma. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds.) PReMI 2005. LNCS, vol. 3776, pp. 1\u201310. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590316_1"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Nosovskiy, G.V., Liu, D., Sourina, O.: Automatic clustering and boundary detection algorithm based on adaptive influence function. Pattern Recogn. 41(9), 2757\u20132776 (2008). https:\/\/doi.org\/10.1016\/j.patcog.2008.01.021","DOI":"10.1016\/j.patcog.2008.01.021"},{"key":"14_CR14","unstructured":"Pelleg, D., Moore, A.: X-means: extending k-means with efficient estimation of the number of clusters. In: Proceedings of the 17th International Conference on Machine Learning, pp. 727\u2013734. Morgan Kaufmann (2000)"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Qiu, B., Wang, S.: A boundary detection algorithm of clusters based on dual threshold segmentation. In: 2011 Seventh International Conference on Computational Intelligence and Security. IEEE, December 2011. https:\/\/doi.org\/10.1109\/cis.2011.276","DOI":"10.1109\/cis.2011.276"},{"key":"14_CR16","unstructured":"Rosenberg, A., Hirschberg, J.: V-measure: a conditional entropy-based external cluster evaluation measure. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp. 410\u2013420. Association for Computational Linguistics, Prague, Czech Republic, June 2007. https:\/\/www.aclweb.org\/anthology\/D07-1043"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Schubert, E., Sander, J., Ester, M., Kriegel, H.P., Xu, X.: DBscan revisited, revisited: why and how you should (still) use DBscan. ACM Trans. Database Syst. 42(3) (2017). https:\/\/doi.org\/10.1145\/3068335. https:\/\/doi.org\/10.1145\/3068335","DOI":"10.1145\/3068335"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Shi, B., Han, L., Yan, H.: Adaptive clustering algorithm based on kNN and density. Pattern Recogn. Lett. 104, 37\u201344 (2018). https:\/\/doi.org\/10.1016\/j.patrec.2018.01.020","DOI":"10.1016\/j.patrec.2018.01.020"},{"issue":"9","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/tpami.2002.1033218","volume":"24","author":"C Veenman","year":"2002","unstructured":"Veenman, C., Reinders, M., Backer, E.: A maximum variance cluster algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 24(9), 1273\u20131280 (2002). https:\/\/doi.org\/10.1109\/tpami.2002.1033218","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/tkde.2006.38","volume":"18","author":"C Xia","year":"2006","unstructured":"Xia, C., Hsu, W., Lee, M., Ooi, B.: BORDER: efficient computation of boundary points. IEEE Trans. Knowl. Data Eng. 18(3), 289\u2013303 (2006). https:\/\/doi.org\/10.1109\/tkde.2006.38","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH. ACM SIGMOD Rec. 25(2), 103\u2013114 (1996). https:\/\/doi.org\/10.1145\/235968.233324","DOI":"10.1145\/235968.233324"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89817-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:03:07Z","timestamp":1710360187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89817-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030898168","9783030898175"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89817-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"21 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"129","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}