{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:48:08Z","timestamp":1742928488750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306778"},{"type":"electronic","value":"9783031306785"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30678-5_5","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T09:03:17Z","timestamp":1681376597000},"page":"63-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cost-Effective Clustering by\u00a0Aggregating Local Density Peaks"],"prefix":"10.1007","author":[{"given":"Wen-Bo","family":"Xie","sequence":"first","affiliation":[]},{"given":"Bin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jun-Hao","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Yan-Li","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xun","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ins.2016.05.003","volume":"363","author":"M Gagolewski","year":"2016","unstructured":"Gagolewski, M., Bartoszuk, M., Cena, A.: Genie: a new, fast, and outlier-resistant hierarchical clustering algorithm. Inf. Sci. 363, 8\u201323 (2016)","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Monath, N., Kobren, A., Krishnamurthy, A., Glass, M.R., McCallum, A.: Scalable hierarchical clustering with tree grafting. In: Proceedings of the 25th ACM SIGKDD, pp. 143\u20131448, New York, NY, USA (2019)","key":"5_CR2","DOI":"10.1145\/3292500.3330929"},{"doi-asserted-by":"crossref","unstructured":"Kobren, A., Monath, N., Krishnamurthy, A., McCallum, A.: A hierarchical algorithm for extreme clustering. In: Proceedings of the 23rd ACM SIGKDD, pp. 255\u2013264 (2017)","key":"5_CR3","DOI":"10.1145\/3097983.3098079"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.ins.2020.04.016","volume":"527","author":"W-B Xie","year":"2020","unstructured":"Xie, W.-B., Lee, Y.-L., Wang, C., Chen, D.-B., Zhou, T.: Hierarchical clustering supported by reciprocal nearest neighbors. Inf. Sci. 527, 279\u2013292 (2020)","journal-title":"Inf. Sci."},{"unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository (2019)","key":"5_CR5"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","volume":"61","author":"JM Geusebroek","year":"2005","unstructured":"Geusebroek, J.M., Burghouts, G.J., Smeulders, A.W.: The Amsterdam library of object images. Int. J. Comput. Vis. 61(1), 103\u2013112 (2005). https:\/\/doi.org\/10.1023\/B:VISI.0000042993.50813.60","journal-title":"Int. J. Comput. Vis."},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1016\/j.eswa.2014.09.054","volume":"42","author":"A Bouguettaya","year":"2015","unstructured":"Bouguettaya, A., Qi, Yu., Liu, X., Zhou, X., Song, A.: Efficient agglomerative hierarchical clustering. Expert Syst. Appl. 42(5), 2785\u20132797 (2015)","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Monath, N., et al.: Scalable hierarchical agglomerative clustering. In: Proceedings of the 27th ACM SIGKDD, pp. 1245\u20131255 (2021)","key":"5_CR8","DOI":"10.1145\/3447548.3467404"},{"issue":"6191","key":"5_CR9","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(6191), 1492\u20131496 (2014)","journal-title":"Science"},{"issue":"336","key":"5_CR10","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."},{"issue":"9","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1834","DOI":"10.1109\/TKDE.2017.2701825","volume":"29","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Shen, F., Huang, Z., Shen, H.T., Li, X.: Discrete nonnegative spectral clustering. IEEE Trans. Knowl. Data Eng. 29(9), 1834\u20131845 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"issue":"11","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1016\/j.patrec.2010.04.001","volume":"31","author":"L Feng","year":"2010","unstructured":"Feng, L., Qiu, M.-H., Wang, Y.-X., Xiang, Q.-L., Yang, Y.-F., Liu, K.: A fast divisive clustering algorithm using an improved discrete particle swarm optimizer. Pattern Recognit. Lett. 31(11), 1216\u20131225 (2010)","journal-title":"Pattern Recognit. Lett."},{"doi-asserted-by":"crossref","unstructured":"Han, X., Zhu, Y., Ting, K.M., Zhan, D.C., Li, G.: Streaming hierarchical clustering based on point-set kernel. In: Proceedings of the 28th ACM SIGKDD, pp. 525\u2013533. Association for Computing Machinery (2022)","key":"5_CR14","DOI":"10.1145\/3534678.3539323"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. ACM SIGMOD Rec. 27(2), 73\u201384 (1998)","journal-title":"ACM SIGMOD Rec."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"5537","DOI":"10.1007\/s10489-021-02624-8","volume":"52","author":"A Dogan","year":"2022","unstructured":"Dogan, A., Birant, D.: K-centroid link: a novel hierarchical clustering linkage method. Appl. Intell. 52, 5537\u20135560 (2022)","journal-title":"Appl. Intell."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30678-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:29:22Z","timestamp":1709818162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30678-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306778","9783031306785"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30678-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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":"7.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}