{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:13:57Z","timestamp":1755839637224},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T00:00:00Z","timestamp":1702425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T00:00:00Z","timestamp":1702425600000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11704-023-2768-7","type":"journal-article","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T03:02:14Z","timestamp":1702436534000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Index-free triangle-based graph local clustering"],"prefix":"10.1007","volume":"18","author":[{"given":"Zhe","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangrui","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-Rong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,13]]},"reference":[{"key":"2768_CR1","doi-asserted-by":"crossref","unstructured":"Spielman D A, Teng S H. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 2004, 81\u201390","DOI":"10.1145\/1007352.1007372"},{"key":"2768_CR2","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F, Lang K. Local graph partitioning using pagerank vectors. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science. 2006, 475\u2013486","DOI":"10.1109\/FOCS.2006.44"},{"issue":"12","key":"2768_CR3","doi-asserted-by":"publisher","first-page":"i253","DOI":"10.1093\/bioinformatics\/btp203","volume":"25","author":"C S Liao","year":"2009","unstructured":"Liao C S, Lu K, Baym M, Singh R, Berger B. IsoRankN: spectral methods for global alignment of multiple protein networks. Bioinformatics, 2009, 25(12): i253\u2013i258","journal-title":"Bioinformatics"},{"key":"2768_CR4","unstructured":"Li S, Gentile C, Karatzoglou A. Graph clustering bandits for recommendation. 2016, arXiv preprint arXiv: 1605.00596"},{"key":"2768_CR5","doi-asserted-by":"publisher","first-page":"e180","DOI":"10.7717\/peerj-cs.180","volume":"5","author":"Y Feng","year":"2019","unstructured":"Feng Y, Yu S, Zhang K, Li X, Ning Z. COMICS: a community property-based triangle motif clustering scheme. PeerJ Computer Science, 2019, 5: e180","journal-title":"PeerJ Computer Science"},{"issue":"8","key":"2768_CR6","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 Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888\u2013905","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"23","key":"2768_CR7","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M E J Newman","year":"2006","unstructured":"Newman M E J. Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America, 2006, 103(23): 8577\u20138582","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"2768_CR8","first-page":"2837","volume":"11","author":"N X Vinh","year":"2010","unstructured":"Vinh N X, Epps J, Bailey J. Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. The Journal of Machine Learning Research, 2010, 11: 2837\u20132854","journal-title":"The Journal of Machine Learning Research"},{"key":"2768_CR9","unstructured":"Kobourov S G, Pupyrev S, Simonetto P. Visualizing graphs as maps with contiguous regions. In: Proceedings of the 16th Eurographics Conference on Visualization. 2014, 31\u201335"},{"issue":"1","key":"2768_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems, 2015, 42(1): 181\u2013213","journal-title":"Knowledge and Information Systems"},{"key":"2768_CR11","first-page":"195","volume-title":"Problems in Analysis","author":"J Cheeger","year":"1971","unstructured":"Cheeger J. A lower bound for the smallest eigenvalue of the Laplacian. In: Gunning R C, ed. Problems in Analysis. Princeton: Princeton University Press, 1971, 195\u2013200"},{"key":"2768_CR12","doi-asserted-by":"crossref","unstructured":"Cox I J, Rao S B, Zhong Y. \u201cRatio regions\u201d: a technique for image segmentation. In: Proceedings of the 13th International Conference on Pattern Recognition. 1996, 557\u2013564","DOI":"10.1109\/ICPR.1996.546886"},{"issue":"6295","key":"2768_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"A R Benson","year":"2016","unstructured":"Benson A R, Gleich D F, Leskovec J. Higher-order organization of complex networks. Science, 2016, 353(6295): 163\u2013166","journal-title":"Science"},{"key":"2768_CR14","doi-asserted-by":"crossref","unstructured":"Tsourakakis C E, Pachocki J, Mitzenmacher M. Scalable motif-aware graph clustering. In: Proceedings of the 26th International Conference on World Wide Web. 2017, 1451\u20131460","DOI":"10.1145\/3038912.3052653"},{"issue":"6684","key":"2768_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D J Watts","year":"1998","unstructured":"Watts D J, Strogatz S H. Collective dynamics of \u2018small-world\u2019 networks. Nature, 1998, 393(6684): 440\u2013442","journal-title":"Nature"},{"issue":"2","key":"2768_CR16","doi-asserted-by":"publisher","first-page":"205630512110249","DOI":"10.1177\/20563051211024958","volume":"7","author":"N C Kr\u00e4mer","year":"2021","unstructured":"Kr\u00e4mer N C, Sauer V, Ellison N. The strength of weak ties revisited: further evidence of the role of strong ties in the provision of online social support. Social Media + Society, 2021, 7(2): 20563051211024958","journal-title":"Social Media + Society"},{"key":"2768_CR17","doi-asserted-by":"crossref","unstructured":"Yao S. Application of data mining technology in financial fraud identification. In: Proceedings of the 4th International Conference on Information Systems and Computer Aided Education. 2021, 2919\u20132922","DOI":"10.1145\/3482632.3487540"},{"key":"2768_CR18","doi-asserted-by":"publisher","unstructured":"Zhou S, Yang X, Chang Q. Spatial clustering analysis of green economy based on knowledge graph. Journal of Intelligent & Fuzzy Systems, 2021, doi: https:\/\/doi.org\/10.3233\/jifs-219074","DOI":"10.3233\/jifs-219074"},{"issue":"1","key":"2768_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3390\/electronics10010097","volume":"10","author":"K H Foysal","year":"2021","unstructured":"Foysal K H, Chang H J, Bruess F, Chong J W. SmartFit: smartphone application for garment fit detection. Electronics, 2021, 10(1): 97","journal-title":"Electronics"},{"key":"2768_CR20","first-page":"1702170","volume":"2022","author":"D Zhu","year":"2022","unstructured":"Zhu D, Shen G, Chen J, Zhou W, Kong X. A higher-order motif-based spatiotemporal graph imputation approach for transportation networks. Wireless Communications and Mobile Computing, 2022, 2022: 1702170","journal-title":"Wireless Communications and Mobile Computing"},{"key":"2768_CR21","doi-asserted-by":"crossref","unstructured":"Yin H, Benson A R, Leskovec J, Gleich D F. Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2017, 555\u2013564","DOI":"10.1145\/3097983.3098069"},{"issue":"1","key":"2768_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2017","unstructured":"Leskovec J, Sosi\u010d R. SNAP: a general-purpose network analysis and graph-mining library. ACM Transactions on Intelligent Systems and Technology, 2017, 8(1): 1","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"5","key":"2768_CR23","doi-asserted-by":"publisher","first-page":"8702","DOI":"10.1109\/JIOT.2019.2923228","volume":"6","author":"W Ma","year":"2019","unstructured":"Ma W, Cai L, He T, Chen L, Cao Z, Li R. Local expansion and optimization for higher-order graph clustering. IEEE Internet of Things Journal, 2019, 6(5): 8702\u20138713","journal-title":"IEEE Internet of Things Journal"},{"key":"2768_CR24","doi-asserted-by":"crossref","unstructured":"Huang S, Li Y, Bao Z, Li Z. Towards efficient motif-based graph partitioning: an adaptive sampling approach. In: Proceedings of the 37th International Conference on Data Engineering. 2021, 528\u2013539","DOI":"10.1109\/ICDE51399.2021.00052"},{"key":"2768_CR25","doi-asserted-by":"crossref","unstructured":"Miller R B. Response time in man-computer conversational transactions. In: Proceedings of the December 9\u201311, 1968, Fall Joint Computer Conference, Part I. 1968, 267\u2013277","DOI":"10.1145\/1476589.1476628"},{"issue":"12","key":"2768_CR26","doi-asserted-by":"publisher","first-page":"2122","DOI":"10.1109\/TVCG.2014.2346452","volume":"20","author":"Z Liu","year":"2014","unstructured":"Liu Z, Heer J. The effects of interactive latency on exploratory visual analysis. IEEE Transactions on visualization and Computer Graphics, 2014, 20(12): 2122\u20132131","journal-title":"IEEE Transactions on visualization and Computer Graphics"},{"key":"2768_CR27","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F. Detecting sharp drops in PageRank and a simplified local partitioning algorithm. In: Proceedings of the 4th International Conference on Theory and Applications of Models of Computation. 2007, 1\u201312","DOI":"10.1007\/978-3-540-72504-6_1"},{"issue":"50","key":"2768_CR28","doi-asserted-by":"publisher","first-page":"19735","DOI":"10.1073\/pnas.0708838104","volume":"104","author":"F Chung","year":"2007","unstructured":"Chung F. The heat kernel as the pagerank of a graph. Proceedings of the National Academy of Sciences of the United States of America, 2007, 104(50): 19735\u201319740","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"2768_CR29","doi-asserted-by":"crossref","unstructured":"Kloster K, Gleich D F. Heat kernel based community detection. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2014, 1386\u20131395","DOI":"10.1145\/2623330.2623706"},{"key":"2768_CR30","unstructured":"Li P, Chien I, Milenkovic O. Optimizing generalized pagerank methods for seed-expansion community detection. Proceedings of the 33rd International Conference on Neural Information Processing Systems. 2019, 1050"},{"key":"2768_CR31","doi-asserted-by":"crossref","unstructured":"Wang H, He M, Wei Z, Wang S, Yuan Y, Du X, Wen J R. Approximate graph propagation. In: Proceedings of the 27th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2021, 1686\u20131696","DOI":"10.1145\/3447548.3467243"},{"issue":"2","key":"2768_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3425637","volume":"15","author":"D Zhou","year":"2021","unstructured":"Zhou D, Zhang S, Yildirim M Y, Alcorn S, Tong H, Davulcu H, He J. High-order structure exploration on massive graphs: a local graph clustering perspective. ACM Transactions on Knowledge Discovery from Data, 2021, 15(2): 1\u201326","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"2768_CR33","doi-asserted-by":"crossref","unstructured":"Casella G, Robert C P, Wells M T. Generalized accept-reject sampling schemes. In: DasGupta A, ed. A Festschrift for Herman Rubin. Institute of Mathematical Statistics, 2004, 342\u2013348","DOI":"10.1214\/lnms\/1196285403"},{"key":"2768_CR34","doi-asserted-by":"crossref","unstructured":"Paramonov K, Shemetov D, Sharpnack J. Estimating graphlet statistics via lifting. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2019, 587\u2013595","DOI":"10.1145\/3292500.3330995"},{"key":"2768_CR35","doi-asserted-by":"crossref","unstructured":"Guo W, Li Y, Sha M, He B, Xiao X, Tan K L. GPU-accelerated subgraph enumeration on partitioned graphs. In: Proceedings of 2020 ACM SIGMOD International Conference on Management of Data. 2020, 1067\u20131082","DOI":"10.1145\/3318464.3389699"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2768-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-2768-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2768-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T03:17:30Z","timestamp":1702437450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-2768-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,13]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2768"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-2768-7","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,13]]},"assertion":[{"value":"18 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"<b>Competing interests<\/b> The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"183404"}}