{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:49:54Z","timestamp":1773236994562,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319973098","type":"print"},{"value":"9783319973104","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97310-4_36","type":"book-chapter","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T16:06:19Z","timestamp":1532621179000},"page":"317-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Adaptive Clustering Algorithm by Finding Density Peaks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6540-4397","authenticated-orcid":false,"given":"Juanying","family":"Xie","sequence":"first","affiliation":[]},{"given":"Weiliang","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,27]]},"reference":[{"issue":"5","key":"36_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","volume":"39","author":"P Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti, P., Virmajoki, O.: Iterative shrinking method for clustering problems. Pattern Recogn. 39(5), 761\u2013775 (2006)","journal-title":"Pattern Recogn."},{"issue":"5814","key":"36_CR2","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315(5814), 972\u2013976 (2007)","journal-title":"Science"},{"key":"36_CR3","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":"36_CR4","doi-asserted-by":"crossref","unstructured":"Karkkainen, I., Franti, P.: Dynamic local search for clustering with unknown number of clusters. In: Proceedings of the 16th International Conference on Pattern Recognition, vol. 2, pp. 240\u2013243. IEEE (2002)","DOI":"10.1109\/ICPR.2002.1048283"},{"key":"36_CR5","first-page":"405","volume-title":"Statistical Data Analysis Based on the L1-Norm and Related Methods","author":"L Kaufmann","year":"1987","unstructured":"Kaufmann, L., Rousseeuw, P.J.: Clustering by means of medoids. In: Dodge, Y. (ed.) Statistical Data Analysis Based on the L1-Norm and Related Methods, pp. 405\u2013416. North-Holland, Amsterdam (1987)"},{"key":"36_CR6","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1: Statistics, Oakland, CA, USA, pp. 281\u2013297 (1967)"},{"key":"36_CR7","unstructured":"Martin Ester, Hans-Peter Kriegel, J.S., Xu, X.: 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), Portland, Oregon, USA, pp. 226\u2013231 (1996)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Mehmood, R., EI-AShram, S., Bie, R., Dawood, H., Kos, A.: Clustering by fast search and merge local density peaks for gene expression microarray data. Sci. Rep. 7, 45602 (2017)","DOI":"10.1038\/srep45602"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Nguyen, X.V., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, 14\u201318 June 2009, pp. 1073\u20131080 (2009)","DOI":"10.1145\/1553374.1553511"},{"issue":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park, H.S., Jun, C.H.: A simple and fast algorithm for k-medoids clustering. Expert Syst. Appl. 36(2), 3336\u20133341 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"6191","key":"36_CR11","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodri\u01f5uez","year":"2014","unstructured":"Rodri\u01f5uez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492\u20131496 (2014)","journal-title":"Science"},{"key":"36_CR12","unstructured":"Salvador, S., Chan, P.: Determining the number of clusters\/segments in hierarchical clustering\/segmentation algorithms. In: IEEE International Conference on TOOLS with Artificial Intelligence, pp. 576\u2013584 (2004)"},{"key":"36_CR13","unstructured":"Ultsch, A.: Clustering with SOM: U*C. In: Proceedings of WSOM 2005, pp. 336\u2013337 (2005)"},{"issue":"2","key":"36_CR14","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1360\/N112015-00135","volume":"46","author":"J Xie","year":"2016","unstructured":"Xie, J., Gao, H., Xie, W.: K-nearest neighbors optimized clustering algorithm by fast search and finding the density peaks of a dataset. SCIENTIA SINICA Informationis 46(2), 258\u2013280 (2016)","journal-title":"SCIENTIA SINICA Informationis"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ins.2016.03.011","volume":"354","author":"J Xie","year":"2016","unstructured":"Xie, J., Gao, H., Xie, W., Liu, X., Grant, P.W.: Robust clustering by detecting density peaks and assigning points based on fuzzy weighted k-nearest neighbors. Inf. Sci. 354, 19\u201340 (2016)","journal-title":"Inf. Sci."},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-68935-7_33","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2017","author":"J Xie","year":"2017","unstructured":"Xie, J., Jiang, W., Ding, L.: Clustering by searching density peaks via local standard deviation. In: Yin, H., et al. (eds.) IDEAL 2017. LNCS, vol. 10585, pp. 295\u2013305. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68935-7_33"},{"issue":"1","key":"36_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"C\u201320","author":"CT Zahn","year":"2006","unstructured":"Zahn, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comput. C\u201320(1), 68\u201386 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"36_CR18","unstructured":"Zelnik-Manor, L.: Self-tuning spectral clustering. In: Advances in Neural Information Processing Systems, vol. 17, pp. 1601\u20131608 (2004)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2018: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97310-4_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T01:56:19Z","timestamp":1751766979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97310-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319973098","9783319973104"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97310-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.seu.edu.cn\/pricai18\/","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":"382","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":"82","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":"58","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":"21% - 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":"2.95","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":"2.95","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)"}}]}}