{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:00:03Z","timestamp":1755838803806,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185787"},{"type":"electronic","value":"9783030185794"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-18579-4_37","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:05:36Z","timestamp":1556031936000},"page":"626-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["DPSCAN: Structural Graph Clustering Based on Density Peaks"],"prefix":"10.1007","author":[{"given":"Changfa","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.neucom.2016.11.019","volume":"226","author":"X Bai","year":"2017","unstructured":"Bai, X., Yang, P., Shi, X.: An overlapping community detection algorithm based on density peaks. Neurocomputing 226, 7\u201315 (2017)","journal-title":"Neurocomputing"},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TKDE.2016.2618795","volume":"29","author":"L Chang","year":"2017","unstructured":"Chang, L., Li, W., Qin, L., Zhang, W., Yang, S.: pSCAN: fast and exact structural graph clustering. IEEE Trans. Knowl. Data Eng. 29(2), 387\u2013401 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"37_CR3","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L.: Community detection via semi-synchronous label propagation algorithms. In: 2010 IEEE International Workshop on Business Applications of Social Network Analysis (BASNA), pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/BASNA.2010.5730298"},{"key":"37_CR5","unstructured":"Falkowski, T., Barth, A., Spiliopoulou, M.: Studying community dynamics with an incremental graph mining algorithm. In: AMCIS 2008 Proceedings, p. 29 (2008)"},{"issue":"12","key":"37_CR6","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"37_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/3186728.3164136","volume":"11","author":"S Gong","year":"2017","unstructured":"Gong, S., Zhang, Y., Yu, G.: Clustering stream data by exploring the evolution of density mountain. Proc. VLDB Endowment 11(4), 393\u2013405 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Huang, J., Sun, H., Han, J., Deng, H., Sun, Y., Liu, Y.: Shrink: a structural clustering algorithm for detecting hierarchical communities in networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 219\u2013228. ACM (2010)","DOI":"10.1145\/1871437.1871469"},{"issue":"4","key":"37_CR9","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Lim, S., Ryu, S., Kwon, S., Jung, K., Lee, J.G.: LinkSCAN*: overlapping community detection using the link-space transformation. In: 2014 IEEE 30th International Conference on Data Engineering (ICDE), pp. 292\u2013303. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816659"},{"issue":"3","key":"37_CR11","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s41019-017-0034-4","volume":"2","author":"M Onizuka","year":"2017","unstructured":"Onizuka, M., Fujimori, T., Shiokawa, H.: Graph partitioning for distributed graph processing. Data Sci. Eng. 2(1), 94\u2013105 (2017)","journal-title":"Data Sci. Eng."},{"key":"37_CR13","series-title":"SCI","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-72150-7_19","volume-title":"COMPLEX NETWORKS 2017","author":"F Par\u00e9s","year":"2017","unstructured":"Par\u00e9s, F., et al.: Fluid communities: a competitive, scalable and diverse community detection algorithm. In: Cherifi, C., Cherifi, H., Karsai, M., Musolesi, M. (eds.) COMPLEX NETWORKS 2017. SCI, vol. 689, pp. 229\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72150-7_19"},{"issue":"3","key":"37_CR14","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","journal-title":"Phys. Rev. E"},{"issue":"336","key":"37_CR15","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":"6191","key":"37_CR16","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"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Shao, J., Han, Z., Yang, Q., Zhou, T.: Community detection based on distance dynamics. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1075\u20131084. ACM (2015)","DOI":"10.1145\/2783258.2783301"},{"issue":"8","key":"37_CR18","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"37_CR19","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.14778\/2809974.2809980","volume":"8","author":"H Shiokawa","year":"2015","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: SCAN++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. Proc. VLDB Endowment 8(11), 1178\u20131189 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"37_CR20","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles-a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Sun, H., Huang, J., Han, J., Deng, H., Zhao, P., Feng, B.: gSkeletonClu: density-based network clustering via structure-connected tree division or agglomeration. In: 2010 IEEE 10th International Conference on Data Mining (ICDM), pp. 481\u2013490. IEEE (2010)","DOI":"10.1109\/ICDM.2010.69"},{"issue":"3","key":"37_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.14778\/3157794.3157795","volume":"11","author":"D Wen","year":"2017","unstructured":"Wen, D., Qin, L., Zhang, Y., Chang, L., Lin, X.: Efficient structural graph clustering: an index-based approach. Proc. VLDB Endowment 11(3), 243\u2013255 (2017)","journal-title":"Proc. VLDB Endowment"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.: SCAN: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824\u2013833. ACM (2007)","DOI":"10.1145\/1281192.1281280"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ijar.2017.09.008","volume":"92","author":"K Zhou","year":"2018","unstructured":"Zhou, K., Martin, A., Pan, Q., Liu, Z.: SELP: semi-supervised evidential label propagation algorithm for graph data clustering. Int. J. Approximate Reasoning 92, 139\u2013154 (2018)","journal-title":"Int. J. Approximate Reasoning"},{"key":"37_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-99383-6_33","volume-title":"Belief Functions: Theory and Applications","author":"K Zhou","year":"2018","unstructured":"Zhou, K., Pan, Q., Martin, A.: Evidential community detection based on density peaks. In: Destercke, S., Denoeux, T., Cuzzolin, F., Martin, A. (eds.) BELIEF 2018. LNCS (LNAI), vol. 11069, pp. 269\u2013277. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99383-6_33"}],"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-030-18579-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:54:17Z","timestamp":1710233657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18579-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185787","9783030185794"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18579-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","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":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","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":"92","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":"64","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":"18% - 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)"}},{"value":"13 demo papers, 6 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}