{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:56:28Z","timestamp":1763643388631,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"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":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s41060-021-00303-y","type":"journal-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:02:52Z","timestamp":1642006972000},"page":"199-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["DPISCAN: Distributed and parallel architecture with indexing for structural clustering of massive dynamic graphs"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9179-3864","authenticated-orcid":false,"given":"D. K. Santhosh","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Demian Antony","family":"D\u2032Mello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,12]]},"reference":[{"key":"303_CR1","unstructured":"Inoubli, W., et al.: \u201cA Distributed Algorithm for Large-Scale Graph Clustering,\u201d L\u2019archive Ouvert. Pluridiscip. HAL, p. hal-02190913v2, 2019, [Online]. Available: https:\/\/hal.inria.fr\/hal-02190913v2"},{"key":"303_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100247","volume":"37","author":"HD Bedru","year":"2020","unstructured":"Bedru, H.D., et al.: Big networks: a survey. Comput. Sci. Rev. 37, 100247 (2020). https:\/\/doi.org\/10.1016\/j.cosrev.2020.100247","journal-title":"Comput. Sci. Rev."},{"key":"303_CR3","doi-asserted-by":"publisher","DOI":"10.1145\/3210259.3210269","author":"AP Iyer","year":"2018","unstructured":"Iyer, A.P., et al.: Bridging the GAP: Towards approximate graph analytics. Proc 1st ACM SIGMOD Jt Int Work Graph Data Manag Exp Syst Netw Data Anal (NDA) GRADES-NDA (2018). https:\/\/doi.org\/10.1145\/3210259.3210269","journal-title":"Proc 1st ACM SIGMOD Jt Int Work Graph Data Manag Exp Syst Netw Data Anal (NDA) GRADES-NDA"},{"key":"303_CR4","volume-title":"Intelligent Systems Design and Applications ISDA 2018 2018 Advances in Intelligent Systems and Comput\u201d","author":"DK Santhosh Kumar","year":"2020","unstructured":"Santhosh Kumar, D.K., D\u2019Mello, D.A.: Strategies and Challenges in Big Data A Short Review. In: Abraham, A., Cherukuri, A., Melin, P., Gandhi, N. (eds.) Intelligent Systems Design and Applications ISDA 2018 2018 Advances in Intelligent Systems and Comput\u201d. Springer, Cham (2020)"},{"key":"303_CR5","unstructured":"\u201c Facebook MAU worldwide 2020 | Statista.\u201d https:\/\/www.statista.com\/statistics\/264810\/number-of-monthly-active-facebook-users-worldwide\/ (accessed Jun. 06, 2021)"},{"key":"303_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ins.2018.02.063","volume":"445\u2013446","author":"KR \u017dalik","year":"2018","unstructured":"\u017dalik, K.R., \u017dalik, B.: Memetic algorithm using node entropy and partition entropy for community detection in networks. Inf. Sci. (Ny) 445\u2013446, 38\u201349 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.02.063","journal-title":"Inf. Sci. (Ny)"},{"issue":"3","key":"303_CR7","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 Endow. 11(3), 243\u2013255 (2017). https:\/\/doi.org\/10.14778\/3157794.3157795","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"303_CR8","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1093\/bioinformatics\/18.4.536","volume":"18","author":"Y Xu","year":"2002","unstructured":"Xu, Y., Olman, V., Xu, D.: Clustering gene expression data using a graph-theoretic approach: An application of minimum spanning trees. Bioinformatics 18(4), 536\u2013545 (2002). https:\/\/doi.org\/10.1093\/bioinformatics\/18.4.536","journal-title":"Bioinformatics"},{"key":"303_CR9","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280","author":"X Xu","year":"2007","unstructured":"Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: A structural clustering algorithm for networks. Proc ACM SIGKDD Int Conf Knowl Discov Data Min (2007). https:\/\/doi.org\/10.1145\/1281192.1281280","journal-title":"Proc ACM SIGKDD Int Conf Knowl Discov Data Min"},{"issue":"2","key":"303_CR10","doi-asserted-by":"publisher","first-page":"021163","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys Rev E - Stat Nonlinear Soft Matter Phys 69(2), 021163 (2004)","journal-title":"Phys Rev E - Stat Nonlinear Soft Matter Phys"},{"key":"303_CR11","doi-asserted-by":"crossref","unstructured":"Shiokawa, H., Fujiwara, Y., Onizuka, M.,: \u201cFast algorithm for modularity-based graph clustering,\u201d Proc. 27th AAAI Conf. Artif. Intell. AAAI (2013), pp. 1170\u20131176,","DOI":"10.1609\/aaai.v27i1.8455"},{"key":"303_CR12","doi-asserted-by":"publisher","DOI":"10.1109\/icdm.2001.989507","author":"CHQ Ding","year":"2001","unstructured":"Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cult algorithm for graph partitioning and data clustering. Proc - IEEE Int Conf Data Mining ICDM (2001). https:\/\/doi.org\/10.1109\/icdm.2001.989507","journal-title":"Proc - IEEE Int Conf Data Mining ICDM"},{"key":"303_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107206","author":"H Li","year":"2020","unstructured":"Li, H., Liu, X., Li, T., Gan, R.: A novel density-based clustering algorithm using nearest neighbor graph. Pattern Recognit. (2020). https:\/\/doi.org\/10.1016\/j.patcog.2020.107206","journal-title":"Pattern Recognit."},{"issue":"1","key":"303_CR14","doi-asserted-by":"publisher","first-page":"e0210236","DOI":"10.1371\/journal.pone.0210236","volume":"14","author":"MZ Rodriguez","year":"2019","unstructured":"Rodriguez, M.Z., et al.: Clustering algorithms: A comparative approach. PLoS ONE 14(1), e0210236 (2019)","journal-title":"PLoS ONE"},{"issue":"8","key":"303_CR15","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1093\/bioinformatics\/btq078","volume":"26","author":"P Jiang","year":"2010","unstructured":"Jiang, P., Singh, M.: SPICi: A fast clustering algorithm for large biological networks. Bioinformatics 26(8), 1105\u20131111 (2010). https:\/\/doi.org\/10.1093\/bioinformatics\/btq078","journal-title":"Bioinformatics"},{"key":"303_CR16","doi-asserted-by":"publisher","unstructured":"Shiokawa, H., Takahashi, T., Kitagawa, H.: \u201cScaleSCAN: Scalable Density-Based Graph Clustering,\u201d In Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), Sep. (2018), vol. 11029 LNCS, pp. 18\u201334, https:\/\/doi.org\/10.1007\/978-3-319-98809-2_2.","DOI":"10.1007\/978-3-319-98809-2_2"},{"issue":"11","key":"303_CR17","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 largescale graphs. Proc. VLDB Endow. 8(11), 1178\u20131189 (2015). https:\/\/doi.org\/10.14778\/2809974.2809980","journal-title":"Proc. VLDB Endow."},{"key":"303_CR18","doi-asserted-by":"publisher","unstructured":"Lim, S., Ryu, S., Kwon, S., Jung, K., Lee, J.G.: \u201cLinkSCAN*: Overlapping community detection using the link-space transformation,\u201d. Proceedings - International Conference on Data Engineering. pp. 292\u2013303, (2014), doi: https:\/\/doi.org\/10.1109\/ICDE.2014.6816659","DOI":"10.1109\/ICDE.2014.6816659"},{"key":"303_CR19","doi-asserted-by":"publisher","unstructured":"Zhao, W., Martha, V.S., Xu, X.: \u201cPSCAN: A parallel Structural Clustering Algorithm for big Networks in MapReduce,\u201d in Proceedings - International Conference on Advanced Information Networking and Applications, AINA, (2013), pp. 862\u2013869, doi: https:\/\/doi.org\/10.1109\/AINA.2013.47","DOI":"10.1109\/AINA.2013.47"},{"key":"303_CR20","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225063","author":"Y Che","year":"2018","unstructured":"Che, Y., Sun, S., Luo, Q.: Parallelizing pruning-based graph structural clustering. ACM Int. Conf. Proceeding Ser. (2018). https:\/\/doi.org\/10.1145\/3225058.3225063","journal-title":"ACM Int. Conf. Proceeding Ser."},{"issue":"10","key":"303_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0203670","volume":"13","author":"J Kim","year":"2018","unstructured":"Kim, J., et al.: CASS: A distributed network clustering algorithm based on structure similarity for large-scale network. PLoS ONE 13(10), 1\u201322 (2018). https:\/\/doi.org\/10.1371\/journal.pone.0203670","journal-title":"PLoS ONE"},{"key":"303_CR22","doi-asserted-by":"publisher","unstructured":"J. Rao et al.: \u201cCache conscious indexing for decision-support in main memory,\u201d EuroSys\u201912, p. 183, (1998), doi: https:\/\/doi.org\/10.1145\/2168836.2168855.","DOI":"10.1145\/2168836.2168855"},{"issue":"3","key":"303_CR23","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00778-019-00541-4","volume":"28","author":"D Wen","year":"2019","unstructured":"Wen, D., Qin, L., Zhang, Y., Chang, L., Lin, X.: Efficient structural graph clustering: an index-based approach. VLDB J. 28(3), 377\u2013399 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00541-4","journal-title":"VLDB J."},{"issue":"1","key":"303_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-019-1588-9","volume":"2019","author":"J Xu","year":"2019","unstructured":"Xu, J., Zhang, C.: Semantic connection set-based massive RDF data query processing in Spark environment. Eurasip J. Wirel. Commun. Netw. 2019(1), 1\u201313 (2019). https:\/\/doi.org\/10.1186\/s13638-019-1588-9","journal-title":"Eurasip J. Wirel. Commun. Netw."},{"issue":"September","key":"303_CR25","first-page":"288","volume":"8","author":"M Banane","year":"2019","unstructured":"Banane, M., Belangour, A.: RDFSpark: a new solution for querying massive RDF data using spark. IJATCSE 8(September), 288\u2013294 (2019)","journal-title":"IJATCSE"},{"key":"303_CR26","unstructured":"Sejdiu, G.: \u201cEfficient Distributed In-Memory Processing of RDF Datasets,\u201d (2020)"},{"key":"303_CR27","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","volume":"37\u201338","author":"R Verborgh","year":"2016","unstructured":"Verborgh, R., et al.: Triple pattern fragments: a low-cost knowledge graph interface for the web. J. Web Semant. 37\u201338, 184\u2013206 (2016). https:\/\/doi.org\/10.1016\/j.websem.2016.03.003","journal-title":"J. Web Semant."},{"issue":"2","key":"303_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/20964471.2018.1469291","volume":"2","author":"M Cheatham","year":"2018","unstructured":"Cheatham, M., et al.: The GeoLink knowledge graph. Big Earth Data 2(2), 131\u2013143 (2018). https:\/\/doi.org\/10.1080\/20964471.2018.1469291","journal-title":"Big Earth Data"},{"issue":"3","key":"303_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.6017\/ital.v37i3.10177","volume":"37","author":"K Sharma","year":"2018","unstructured":"Sharma, K., Marjit, U., Biswas, U.: Efficiently processing and storing library linked data using apache spark and parquet. Inf. Technol. Libr. 37(3), 29\u201349 (2018). https:\/\/doi.org\/10.6017\/ital.v37i3.10177","journal-title":"Inf. Technol. Libr."},{"key":"303_CR30","doi-asserted-by":"crossref","unstructured":"Raman, R.: \u201cThe power of collision\u202f: Randomized parallel algorithms for chaining and integer sorting *,\u201d no. December 1990 (1991)","DOI":"10.1007\/3-540-53487-3_42"},{"key":"303_CR31","doi-asserted-by":"publisher","unstructured":"Shiokawa, H., Takahashi, T.: \u201cDscan: Distributed structural graph clustering for billion-edge graphs,\u201d Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 12391 LNCS, pp. 38\u201354, (2020), doi: https:\/\/doi.org\/10.1007\/978-3-030-59003-1_3.","DOI":"10.1007\/978-3-030-59003-1_3"},{"key":"303_CR32","unstructured":"\u201cTwitter (MPI) - Network analysis of Twitter (MPI) - KONECT.\u201d http:\/\/konect.uni-koblenz.de\/networks\/twitter_mpi (accessed May 28, 2020)."},{"key":"303_CR33","unstructured":"\u201cStanford Large Network Dataset Collection.\u201d https:\/\/snap.stanford.edu\/data\/ (accessed Jun. 07, 2021)."},{"key":"303_CR34","unstructured":"\u201cLaboratory for Web Algorithmics.\u201d http:\/\/law.di.unimi.it\/datasets.php (accessed Jun. 07, 2021)."},{"key":"303_CR35","unstructured":"\u201cApache Arrow in PySpark \u2014 PySpark 3.1.2 documentation.\u201d https:\/\/spark.apache.org\/docs\/latest\/api\/python\/user_guide\/arrow_pandas.html (accessed Jun. 07, 2021)."},{"key":"303_CR36","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/8884926","author":"W Xiao","year":"2020","unstructured":"Xiao, W., Hu, J.: A survey of parallel clustering algorithms based on spark. Sci Program (2020). https:\/\/doi.org\/10.1155\/2020\/8884926","journal-title":"Sci Program"},{"key":"303_CR37","unstructured":"\u201cOverview - Spark 3.0.0 Documentation.\u201d https:\/\/spark.apache.org\/docs\/3.0.0\/ (accessed Jun. 07, 2021)."},{"key":"303_CR38","unstructured":"Shi L., Chen, B.: \u201cComparison and Benchmark of Graph Clustering Algorithms,\u201d pp. 1\u201333, (2020), [Online]. Available: http:\/\/arxiv.org\/abs\/2005.04806."},{"issue":"9","key":"303_CR39","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1108\/00242530410565256","volume":"53","author":"A Shiri","year":"2004","unstructured":"Shiri, A.: Introduction to Modern Information Retrieval (2nd edition). Libr. Rev. 53(9), 462\u2013463 (2004). https:\/\/doi.org\/10.1108\/00242530410565256","journal-title":"Libr. Rev."},{"key":"303_CR40","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.jpdc.2014.09.012","volume":"76","author":"D Lasalle","year":"2015","unstructured":"Lasalle, D., Karypis, G.: Multi-threaded modularity based graph clustering using the multilevel paradigm. J. Parallel Distrib. Comput. 76, 66\u201380 (2015). https:\/\/doi.org\/10.1016\/j.jpdc.2014.09.012","journal-title":"J. Parallel Distrib. Comput."},{"key":"303_CR41","unstructured":"Aynaud, T., Guillaume, J.L.: \u201cStatic community detection algorithms for evolving networks,\u201d WiOpt 2010 - 8th Intl. Symp. Model. Optim. Mobile, Ad Hoc, Wirel. Networks, pp. 513\u2013519, (2010)"},{"key":"303_CR42","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132960","author":"Y Kozawa","year":"2017","unstructured":"Kozawa, Y., Amagasa, T., Kitagawa, H.: GPU-accelerated graph clustering via parallel label propagation. Int Conf Inf Knowl Manag Proc (2017). https:\/\/doi.org\/10.1145\/3132847.3132960","journal-title":"Int Conf Inf Knowl Manag Proc"},{"key":"303_CR43","doi-asserted-by":"publisher","unstructured":"Brandes, U., Gaertler, M., Wagner D.: \u201cExperiments on graph clustering algorithms,\u201d Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 2832, no. Lncs 2832, pp. 568\u2013579, (2003), doi: https:\/\/doi.org\/10.1007\/978-3-540-39658-1_52.","DOI":"10.1007\/978-3-540-39658-1_52"},{"key":"303_CR44","doi-asserted-by":"publisher","unstructured":"Shi, N., Liu, X., Guan, Y.: \u201cResearch on k-means clustering algorithm: An improved k-means clustering algorithm,\u201d 3rd Int. Symp. Intell. Inf. Technol. Secur. Informatics, IITSI 2010, pp. 63\u201367, (2010), doi: https:\/\/doi.org\/10.1109\/IITSI.2010.74.","DOI":"10.1109\/IITSI.2010.74"},{"key":"303_CR45","doi-asserted-by":"publisher","DOI":"10.1145\/3364208","author":"H Sun","year":"2019","unstructured":"Sun, H., Zanetti, L.: Distributed graph clustering and sparsification. ACM Trans Parallel Comput (2019). https:\/\/doi.org\/10.1145\/3364208","journal-title":"ACM Trans Parallel Comput"},{"key":"303_CR46","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Syst. 151, 78\u201394 (2018). https:\/\/doi.org\/10.1016\/j.knosys.2018.03.022","journal-title":"Knowledge-Based Syst."},{"key":"303_CR47","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/B978-044452701-1.00067-3","volume":"2","author":"X Ester","year":"1996","unstructured":"Ester, X.: M, Kriegel, H P, Sander, J, and Xiaowei, \u201cA density-based algorithm for discovering clusters in large spatial databases with noise.\u201d Compr. Chemom. 2, 635\u2013654 (1996). https:\/\/doi.org\/10.1016\/B978-044452701-1.00067-3","journal-title":"Compr. Chemom."},{"key":"303_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_9","volume-title":"A survey of clustering algorithms for graph data","author":"CC Aggarwal","year":"2010","unstructured":"Aggarwal, C.C., Wang, H.: A survey of clustering algorithms for graph data. Springer, Boston (2010)"},{"issue":"3","key":"303_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.17485\/ijst\/2016\/v9i3\/75971","volume":"9","author":"T Sajana","year":"2016","unstructured":"Sajana, T., Sheela Rani, C.M., Narayana, K.V.: A survey on clustering techniques for big data mining. Indian J Sci Technol 9(3), 1\u201312 (2016)","journal-title":"Indian J Sci Technol"},{"key":"303_CR50","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.94","author":"ST Mai","year":"2017","unstructured":"Mai, S.T., Dieu, M.S., Assent, I., Jacobsen, J., Kristensen, J., Birk, M.: Scalable and interactive graph clustering algorithm on multicore CPUs. Proc. - Int. Conf. Data Eng (2017). https:\/\/doi.org\/10.1109\/ICDE.2017.94","journal-title":"Proc. - Int. Conf. Data Eng"},{"key":"303_CR51","doi-asserted-by":"publisher","DOI":"10.4018\/IJOSSP.2020070101","author":"DK Santhosh Kumar","year":"2020","unstructured":"Santhosh Kumar, D.K., D\u2019Mello, D.A.: Efficient algorithms for cleaning and indexing of graph data. Int J Open Source Softw Process (2020). https:\/\/doi.org\/10.4018\/IJOSSP.2020070101","journal-title":"Int J Open Source Softw Process"},{"issue":"12","key":"303_CR52","doi-asserted-by":"publisher","first-page":"3381","DOI":"10.1109\/TPDS.2014.2374607","volume":"26","author":"TR Stovall","year":"2015","unstructured":"Stovall, T.R., Kockara, S., Avci, R.: GPUSCAN: GPU-Based Parallel Structural Clustering Algorithm for Networks. IEEE Trans. Parallel Distrib. Syst. 26(12), 3381\u20133393 (2015). https:\/\/doi.org\/10.1109\/TPDS.2014.2374607","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"303_CR53","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.76","author":"W Zhao","year":"2017","unstructured":"Zhao, W., Chen, G., Xu, X.: AnySCAN: An efficient anytime framework with active learning for large-scale network clustering. Proc - IEEE Int Conf Data Mining ICDM (2017). https:\/\/doi.org\/10.1109\/ICDM.2017.76","journal-title":"Proc - IEEE Int Conf Data Mining ICDM"},{"key":"303_CR54","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133121","author":"JH Seo","year":"2017","unstructured":"Seo, J.H., Kim, M.H.: Pm-SCAN: An I\/O efficient structural clustering algorithm for large-scale graphs. Int Conf Inf Knowl Manag Proc (2017). https:\/\/doi.org\/10.1145\/3132847.3133121","journal-title":"Int Conf Inf Knowl Manag Proc"},{"key":"303_CR55","doi-asserted-by":"publisher","DOI":"10.1145\/3068943.3068949","author":"T Takahashi","year":"2017","unstructured":"Takahashi, T., Shiokawa, H., Kitagawa, H.: SCAN-XP: Parallel structural graph clustering algorithm on intel Xeon Phi coprocessors. Proc 2nd ACM SIGMOD Work Netw Data Anal NDA (2017). https:\/\/doi.org\/10.1145\/3068943.3068949","journal-title":"Proc 2nd ACM SIGMOD Work Netw Data Anal NDA"},{"issue":"3\u20135","key":"303_CR56","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). https:\/\/doi.org\/10.1016\/j.physrep.2009.11.002","journal-title":"Phys. Rep."},{"issue":"1","key":"303_CR57","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Comput. Sci. Rev."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-021-00303-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-021-00303-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-021-00303-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T18:56:44Z","timestamp":1674413804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-021-00303-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,12]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s41060-021-00303-y","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2022,1,12]]},"assertion":[{"value":"19 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}