{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:03:27Z","timestamp":1743051807051,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723027"},{"type":"electronic","value":"9789819723034"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2303-4_22","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T08:02:03Z","timestamp":1716883323000},"page":"331-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SCS: A Structural Similarity Measure for\u00a0Graph Clustering Based on\u00a0Cycles and\u00a0Paths"],"prefix":"10.1007","author":[{"given":"Jiayi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zirui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles (1998)","DOI":"10.1007\/BF02523189"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Augsten, N., BHlen, M.H.: Similarity joins in relational database systems. Synth. Lect. Data Manage. 5(5), 1\u2013124 (2013)","DOI":"10.2200\/S00544ED1V01Y201310DTM038"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1839490.1839494","volume":"4","author":"L Becchetti","year":"2010","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient algorithms for large-scale local triangle counting. ACM Trans. Knowl. Disc. Data. 4, 1\u20138 (2010)","journal-title":"ACM Trans. Knowl. Disc. Data."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chang, L., Wei, L., Lin, X., Lu, Q., Zhang, W.: pSCAN: fast and exact structural graph clustering. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE) (2016)","DOI":"10.1109\/ICDE.2016.7498245"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Hsu, W., Lee, M.L., Ng, S.K.: Nemofinder: dissecting genome-wide protein-protein interactions with Meso-scale network motifs. In: Twelfth ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2006)","DOI":"10.1145\/1150402.1150418"},{"key":"22_CR6","unstructured":"Ding, C., He, X., Zha, H., Ming, G., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings 2001 IEEE International Conference on Data Mining (2001)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"2160","DOI":"10.1016\/j.physa.2010.10.040","volume":"390","author":"HB Feng","year":"2011","unstructured":"Feng, H.B.: Density-based shrinkage for revealing hierarchical and overlapping community structure in networks. Statist. Mech. App. Phys. A. 390, 2160\u20132171 (2011)","journal-title":"Statist. Mech. App. Phys. A."},{"key":"22_CR8","unstructured":"Feng, Z., Xu, X., Yuruk, N., Schweiger, T.A.J.: A novel similarity-based modularity function for graph partitioning (2007)"},{"issue":"3\u20135","key":"22_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71681-5_7","volume-title":"Research in Computational Molecular Biology","author":"JA Grochow","year":"2007","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 92\u2013106. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71681-5_7"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1038\/nature03288","volume":"433","author":"R Guimer\u00e0","year":"2005","unstructured":"Guimer\u00e0, R., Nunes Amaral, L.A.: Functional cartography of complex metabolic networks. Nature 433, 895\u2013900 (2005)","journal-title":"Nature"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/565117.565124","volume":"31","author":"M Halkidi","year":"2002","unstructured":"Halkidi, M., Batistakis, Y., Vazirgiannis, M.: Cluster validity methods: part i. ACM SIGMOD Record 31(2), 40\u201345 (2002)","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"22_CR13","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":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/1687627.1687698","volume":"2","author":"MS Kim","year":"2009","unstructured":"Kim, M.S., Han, J.: A particle-and-density based evolutionary clustering method for dynamic networks. Proc. VLDB Endow. 2(1), 622\u2013633 (2009)","journal-title":"Proc. VLDB Endow."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Kutzkov, K., Pagh, R.: On the streaming complexity of computing local clustering coefficients. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining (2013)","DOI":"10.1145\/2433396.2433480"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407, 458\u2013473 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR17","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: IEEE International Conference on Data Engineering (2014)","DOI":"10.1109\/ICDE.2014.6816659"},{"key":"22_CR18","unstructured":"Liu, J., Chi, W., Danilevsky, M., Han, J.: Large-scale spectral clustering on graphs. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (2013)"},{"key":"22_CR19","unstructured":"Lu, W., Xiao, Y., Shao, B., Wang, H.: How to partition a billion-node graph. In: IEEE International Conference on Data Engineering (2014)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Milo, R., Shen-Orr, S., Ltzkovitz, S., Kashtan, N., Alan, U.: Network motifs: Simple building blocks of complex networks (2011)","DOI":"10.1515\/9781400841356.217"},{"issue":"2 Pt 2","key":"22_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2 Pt 2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: efficiently counting all 5-vertex subgraphs. In: The Web Conference (2017)","DOI":"10.1145\/3038912.3052597"},{"key":"22_CR23","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.M.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22, 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.: Fast algorithm for modularity-based graph clustering. In: National Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8455"},{"key":"22_CR25","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. VLDB Endow. 8, 1178\u20131189 (2015)","journal-title":"VLDB Endow."},{"issue":"8","key":"22_CR26","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1093\/bioinformatics\/btq078","volume":"26","author":"M Singh","year":"2010","unstructured":"Singh, M.: SPICi: a fast clustering algorithm for large biological networks. Bioinformatics 26(8), 1105\u201311 (2010)","journal-title":"Bioinformatics"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Sun, H., Huang, J., Han, J., Deng, H., Sun, Y.: Shrink: a structural clustering algorithm for detecting hierarchical communities in networks. In: ACM International Conference on Information & Knowledge Management (2010)","DOI":"10.1145\/1871437.1871469"},{"key":"22_CR28","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 (2010)","DOI":"10.1109\/ICDM.2010.69"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"22_CR31","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 (2007)","DOI":"10.1145\/1281192.1281280"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, P.: gSparsify: Graph motif based sparsification for graph clustering. ACM (2015)","DOI":"10.1145\/2806416.2806543"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2303-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T08:06:48Z","timestamp":1716883608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2303-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723027","9789819723034"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2303-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"6 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.apweb-waim2023.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}