{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:03:38Z","timestamp":1743105818959,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031212437"},{"type":"electronic","value":"9783031212444"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21244-4_14","type":"book-chapter","created":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T20:06:23Z","timestamp":1668110783000},"page":"191-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Density Peak Clustering Based Split-and-Merge"],"prefix":"10.1007","author":[{"given":"Jixiang","family":"Lu","sequence":"first","affiliation":[]},{"given":"Caiming","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,11]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.eswa.2016.02.009","volume":"55","author":"G Armano","year":"2016","unstructured":"Armano, G., Farmani, M.: Multiobjective clustering analysis using particle swarm optimization. Expert Syst. Appl. 55, 184\u2013193 (2016)","journal-title":"Expert Syst. Appl."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.patrec.2016.03.004","volume":"77","author":"M Bakoben","year":"2016","unstructured":"Bakoben, M., Bellotti, A., Adams, N.: Improving clustering performance by incorporating uncertainty. Pattern Recogn. Lett. 77, 28\u201334 (2016)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.patcog.2007.04.010","volume":"41","author":"H Chang","year":"2008","unstructured":"Chang, H., Yeung, D.: Robust path-based spectral clustering. Pattern Recogn. 41, 191\u2013203 (2008)","journal-title":"Pattern Recogn."},{"key":"14_CR4","unstructured":"Ester, M., Peter, K., Hans, S., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd KDD. AAAI Press (1996)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"8916","DOI":"10.1109\/ACCESS.2018.2808485","volume":"6","author":"J Hou","year":"2018","unstructured":"Hou, J., Zhang, A.: Enhanced dominant sets clustering by cluster expansion. IEEE Access 6, 8916\u20138924 (2018)","journal-title":"IEEE Access"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.patcog.2015.08.015","volume":"50","author":"D Huang","year":"2016","unstructured":"Huang, D., Lai, J., Wang, C.: Ensemble clustering using factor graph. Pattern Recogn. 50, 131\u2013142 (2016)","journal-title":"Pattern Recogn."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/TKDE.2015.2503753","volume":"28","author":"D Huang","year":"2016","unstructured":"Huang, D., Lai, J.H., Wang, C.D.: Robust ensemble clustering using probability trajectories. IEEE Trans. Knowl. Data Eng. 28, 1312\u20131326 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"A Jain","year":"2010","unstructured":"Jain, A.: Data clustering: 50 years beyond K-means. Pattern Recogn. Lett. 31, 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/TEVC.2006.877146","volume":"11","author":"H Julia","year":"2007","unstructured":"Julia, H., Joshua, K.: An evolutionary approach to multiobjective clustering. IEEE Trans. Evol. Comput. 11, 56\u201376 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Han, E., Kumar, V.: CHANELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Comput. 32, 68\u201375 (1999)","journal-title":"IEEE Comput."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.patrec.2014.11.012","volume":"54","author":"J Leski","year":"2015","unstructured":"Leski, J., Kotas, M.: Hierarchical clustering with planar segments as prototypes. Pattern Recogn. Lett. 54, 1\u201310 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TKDE.2005.21","volume":"17","author":"C Lin","year":"2005","unstructured":"Lin, C., Chen, M.: Combining partitional and hierarchical algorithms for robust and efficient data clustering with cohesion self-merging. IEEE Trans. Knowl. Data Eng. 17, 145\u2013159 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344, 1492\u20131496 (2014)","journal-title":"Science"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/ACCESS.2017.2780109","volume":"6","author":"J Wang","year":"2018","unstructured":"Wang, J., Zhu, C., Zhou, Y., Zhu, X., Wang, Y., Zhang, W.: From partition-based clustering to density-based clustering: fast find clusters with diverse shapes and densities in spatial databases. IEEE Access 6, 1718\u20131729 (2018)","journal-title":"IEEE Access"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.patrec.2014.09.017","volume":"53","author":"Q Zhao","year":"2015","unstructured":"Zhao, Q., Shi, Y., Liu, Q., Fr\u00e4nti, P.: A grid-growing clustering algorithm for geo-spatial data. Pattern Recogn. Lett. 53, 77\u201384 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1016\/j.ins.2011.04.013","volume":"181","author":"C Zhong","year":"2011","unstructured":"Zhong, C., Miao, D., Fr\u00e4nti, P.: Minimum spanning tree based split-and-merge: a hierarchical clustering method. Inf. Sci. 181, 3397\u20133410 (2011)","journal-title":"Inf. Sci."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1016\/j.patrec.2008.07.002","volume":"29","author":"C Zhong","year":"2008","unstructured":"Zhong, C., Miao, D., Wang, R., Zhou, X.: DIVFRP: an automatic divisive hierarchical clustering method based on the furthest reference points. Pattern Recogn. Lett. 29, 2067\u20132077 (2008)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.patrec.2016.06.008","volume":"80","author":"Z Zhuo","year":"2016","unstructured":"Zhuo, Z., Zhang, X., Niu, W., Yang, G., Zhang, J.: Improving data field hierarchical clustering using Barnes-Hut algorithm. Pattern Recogn. Lett. 80, 113\u2013120 (2016)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21244-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:06:16Z","timestamp":1709831176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21244-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031212437","9783031212444"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21244-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCRS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rough Sets","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Suzhou","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcrs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ijcrs2022.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","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":"28","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":"67% - 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":"2","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)"}}]}}