{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T02:00:29Z","timestamp":1769047229053,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T00:00:00Z","timestamp":1620345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T00:00:00Z","timestamp":1620345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Local community detection aims to find the communities that a given seed node belongs to. Most existing works on this problem are based on a very strict assumption that the seed node only belongs to a single community, but in real-world networks, nodes are likely to belong to multiple communities. In this paper, we first introduce a novel algorithm, HqsMLCD, that can detect multiple communities for a given seed node over static networks. HqsMLCD first finds the high-quality seeds which can detect better communities than the given seed node with the help of network representation, then expands the high-quality seeds one-by-one to get multiple communities, probably overlapping. Since dynamic networks also act an important role in practice, we extend the static HqsMLCD to handle dynamic networks and introduce HqsDMLCD. HqsDMLCD mainly integrates dynamic network embedding and dynamic local community detection into the static one. Experimental results on real-world networks demonstrate that our new method HqsMLCD outperforms the state-of-the-art multiple local community detection algorithms. And our dynamic method HqsDMLCD gets comparable results with the static method on real-world networks.<\/jats:p>","DOI":"10.1007\/s41019-021-00160-6","type":"journal-article","created":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T17:04:12Z","timestamp":1620407052000},"page":"249-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Multiple Local Community Detection via High-Quality Seed Identification over Both Static and Dynamic Networks"],"prefix":"10.1007","volume":"6","author":[{"given":"Jiaxu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yingxia","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Sen","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,7]]},"reference":[{"key":"160_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal P, Verma R, Agarwal A, Chakraborty T (2018) Dyperm: maximizing permanence for dynamic community detection. In: Pacific-Asia conference on knowledge discovery and data mining, pp 437\u2013449. Springer","DOI":"10.1007\/978-3-319-93034-3_35"},{"key":"160_CR2","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F, Lang K (2006) Local graph partitioning using pagerank vectors. In: 2006 47th annual IEEE symposium on foundations of computer science (FOCS\u201906), pp 475\u2013486. IEEE","DOI":"10.1109\/FOCS.2006.44"},{"key":"160_CR3","doi-asserted-by":"crossref","unstructured":"Bian Y, Yan Y, Cheng W, Wang W, Luo D, Zhang X (2018) On multi-query local community detection. In: 2018 IEEE international conference on data mining (ICDM), pp 9\u201318. IEEE","DOI":"10.1109\/ICDM.2018.00016"},{"key":"160_CR4","doi-asserted-by":"crossref","unstructured":"Cazabet R, Rossetti G, Amblard F (2017) Dynamic community detection","DOI":"10.1007\/978-1-4614-7163-9_383-1"},{"key":"160_CR5","unstructured":"Chen Z, Li L, Bruna J (2019) Supervised community detection with line graph neural networks. In: 7th international conference on learning representations, ICLR 2019, New Orleans, LA, USA, May 6\u20139, 2019"},{"key":"160_CR6","doi-asserted-by":"crossref","unstructured":"Choudhury MD, Sundaram H, John A, Seligmann DD (2009) Social synchrony: predicting mimicry of user actions in online social media. In: Proceedings of international conference on computational science and engineering, pp 151\u2013158","DOI":"10.1109\/CSE.2009.439"},{"issue":"1","key":"160_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s13278-016-0325-1","volume":"6","author":"M Cordeiro","year":"2016","unstructured":"Cordeiro M, Sarmento RP, Gama J (2016) Dynamic community detection in evolving networks using locality modularity optimization. Soc Netw Anal Min 6(1):15","journal-title":"Soc Netw Anal Min"},{"issue":"4","key":"160_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s41019-018-0078-0","volume":"3","author":"L Cui","year":"2018","unstructured":"Cui L, Yue L, Wen D, Qin L (2018) K-connected cores computation in large dual networks. Data Sci Eng 3(4):293\u2013306","journal-title":"Data Sci Eng"},{"key":"160_CR9","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD international conference on Management of data, pp 277\u2013288","DOI":"10.1145\/2463676.2463722"},{"key":"160_CR10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2018.04.018","volume":"152","author":"X Ding","year":"2018","unstructured":"Ding X, Zhang J, Yang J (2018) A robust two-stage algorithm for local community detection. Knowl Syst 152:188\u2013199","journal-title":"Knowl Syst"},{"key":"160_CR11","doi-asserted-by":"crossref","unstructured":"Du L, Wang Y, Song G, Lu Z, Wang J (2018) Dynamic network embedding: an extended approach for skip-gram based network embedding. In: IJCAI, pp 2086\u20132092","DOI":"10.24963\/ijcai.2018\/288"},{"key":"160_CR12","unstructured":"Ester M, Kriegel H, Sander J, Xu X (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the second international conference on knowledge discovery and data mining (KDD-96), Portland, Oregon, USA, pp 226\u2013231"},{"key":"160_CR13","doi-asserted-by":"crossref","unstructured":"Fu D, Zhou D, He J (2020) Local motif clustering on time-evolving graphs. In: Proceedings of the 26th ACM SIGKDD International conference on knowledge discovery & data mining, pp 390\u2013400","DOI":"10.1145\/3394486.3403081"},{"key":"160_CR14","doi-asserted-by":"publisher","first-page":"104816","DOI":"10.1016\/j.knosys.2019.06.024","volume":"187","author":"P Goyal","year":"2020","unstructured":"Goyal P, Chhetri SR, Canedo A (2020) dyngraph2vec: capturing network dynamics using dynamic graph representation learning. Knowl Syst 187:104816","journal-title":"Knowl Syst"},{"key":"160_CR15","doi-asserted-by":"crossref","unstructured":"G\u00f3mez V, Kaltenbrunner A, L\u00f3pez V (2008) Statistical analysis of the social network and discussion threads in Slashdot. In: Proc. Int. World Wide Web Conf., pp 645\u2013654","DOI":"10.1145\/1367497.1367585"},{"issue":"5","key":"160_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340708","volume":"13","author":"K He","year":"2019","unstructured":"He K, Shi P, Bindel D, Hopcroft JE (2019) Krylov subspace approximation for local community detection in large networks. ACM Trans Knowl Discov Data (TKDD) 13(5):1\u201330","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"160_CR17","doi-asserted-by":"crossref","unstructured":"He K, Sun Y, Bindel D, Hopcroft J, Li Y (2015) Detecting overlapping communities from local spectral subspaces. In: 2015 IEEE international conference on data mining, pp 769\u2013774. IEEE","DOI":"10.1109\/ICDM.2015.89"},{"issue":"3","key":"160_CR18","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/3199524.3199537","volume":"45","author":"A Hollocou","year":"2017","unstructured":"Hollocou A, Bonald T, Lelarge M (2017) Multiple local community detection. SIGMETRICS Perform Eval Rev 45(3):76\u201383","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"160_CR19","doi-asserted-by":"crossref","unstructured":"Kamuhanda D, He K (2018) A nonnegative matrix factorization approach for multiple local community detection. In: 2018 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 642\u2013649. IEEE","DOI":"10.1109\/ASONAM.2018.8508796"},{"key":"160_CR20","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"160_CR21","doi-asserted-by":"crossref","unstructured":"Li J, Dani H, Hu X, Tang J, Chang Y, Liu H (2017) Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 387\u2013396","DOI":"10.1145\/3132847.3132919"},{"key":"160_CR22","doi-asserted-by":"crossref","unstructured":"Li Y, Sha C, Huang X, Zhang Y (2018) Community detection in attributed graphs: an embedding approach. In: Proceedings of the thirty-second AAAI conference on artificial intelligence, (AAAI-18), the 30th innovative applications of artificial intelligence (IAAI-18), and the 8th AAAI symposium on educational advances in artificial intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2\u20137, 2018, pp 338\u2013345","DOI":"10.1609\/aaai.v32i1.11274"},{"key":"160_CR23","doi-asserted-by":"crossref","unstructured":"Liang S, Zhang X, Ren Z, Kanoulas E (2018) Dynamic embeddings for user profiling in twitter. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1764\u20131773","DOI":"10.1145\/3219819.3220043"},{"key":"160_CR24","doi-asserted-by":"crossref","unstructured":"Liu J, Shao Y, Su S (2020) Multiple local community detection via high-quality seed identification. In: Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) joint international conference on web and big Data, pp 37\u201352. Springer","DOI":"10.1007\/978-3-030-60259-8_4"},{"key":"160_CR25","doi-asserted-by":"crossref","unstructured":"Luo D, Bian Y, Yan Y, Liu X, Huan J, Zhang X (2020) Local community detection in multiple networks. In: Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 266\u2013274","DOI":"10.1145\/3394486.3403069"},{"issue":"3","key":"160_CR26","doi-asserted-by":"publisher","first-page":"102","DOI":"10.3390\/a10030102","volume":"10","author":"E Nathan","year":"2017","unstructured":"Nathan E, Zakrzewska A, Riedy J, Bader DA (2017) Local community detection in dynamic graphs using personalized centrality. Algorithms 10(3):102","journal-title":"Algorithms"},{"issue":"23","key":"160_CR27","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"160_CR28","first-page":"1","volume":"14","author":"L Ni","year":"2019","unstructured":"Ni L, Luo W, Zhu W, Hua B (2019) Local overlapping community detection. ACM Trans Knowl Discov Data (TKDD) 14(1):1\u201325","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"7043","key":"160_CR29","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"key":"160_CR30","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"issue":"2","key":"160_CR31","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/TCSS.2020.2964197","volume":"7","author":"M Seifikar","year":"2020","unstructured":"Seifikar M, Farzi S, Barati M (2020) C-blondel: an efficient louvain-based dynamic community detection algorithm. IEEE Trans Comput Soc Syst 7(2):308\u2013318","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"160_CR32","unstructured":"Trivedi R, Farajtabar M, Biswal P, Zha H (2019) Dyrep: learning representations over dynamic graphs. In: International conference on learning representations"},{"key":"160_CR33","doi-asserted-by":"crossref","unstructured":"Wang CD, Lai JH, Yu PS (2013) Dynamic community detection in weighted graph streams. In: Proceedings of the 2013 SIAM international conference on data mining, pp 151\u2013161. SIAM","DOI":"10.1137\/1.9781611972832.17"},{"issue":"7","key":"160_CR34","doi-asserted-by":"publisher","first-page":"798","DOI":"10.14778\/2752939.2752948","volume":"8","author":"Y Wu","year":"2015","unstructured":"Wu Y, Jin R, Li J, Zhang X (2015) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endow 8(7):798\u2013809","journal-title":"Proc VLDB Endow"},{"key":"160_CR35","unstructured":"Xie Y, Li C, Yu B, Zhang C, Tang Z (2020) A survey on dynamic network embedding. arXiv preprint arXiv:2006.08093"},{"issue":"1","key":"160_CR36","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 (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"160_CR37","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s41019-018-0062-8","volume":"3","author":"Q Ye","year":"2018","unstructured":"Ye Q, Zhu C, Li G, Liu Z, Wang F (2018) Using node identifiers and community prior for graph-based classification. Data Sci Eng 3(1):68\u201383","journal-title":"Data Sci Eng"},{"key":"160_CR38","doi-asserted-by":"crossref","unstructured":"Yin H, Benson AR, Leskovec J, Gleich DF (2017) Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 555\u2013564","DOI":"10.1145\/3097983.3098069"},{"key":"160_CR39","doi-asserted-by":"crossref","unstructured":"Yu W, Cheng W, Aggarwal CC, Zhang K, Chen H, Wang W (2018) Netwalk: A flexible deep embedding approach for anomaly detection in dynamic networks. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2672\u20132681","DOI":"10.1145\/3219819.3220024"},{"issue":"5","key":"160_CR40","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan L, Qin L, Zhang W, Chang L, Yang J (2017) Index-based densest clique percolation community search in networks. IEEE Trans Knowl Data Eng 30(5):922\u2013935","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"160_CR41","doi-asserted-by":"crossref","unstructured":"Zakrzewska A, Bader DA (2015) A dynamic algorithm for local community detection in graphs. In: 2015 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 559\u2013564. IEEE","DOI":"10.1145\/2808797.2809375"},{"issue":"6","key":"160_CR42","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1109\/TCYB.2019.2938895","volume":"50","author":"X Zeng","year":"2019","unstructured":"Zeng X, Wang W, Chen C, Yen GG (2019) A consensus community-based particle swarm optimization for dynamic community detection. IEEE Trans Cybern 50(6):2502\u20132513","journal-title":"IEEE Trans Cybern"},{"key":"160_CR43","doi-asserted-by":"crossref","unstructured":"Zhang H, Lofgren P, Goel A (2016) Approximate personalized pagerank on dynamic graphs. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1315\u20131324","DOI":"10.1145\/2939672.2939804"},{"key":"160_CR44","unstructured":"Zhang T, Wu B (2012) A method for local community detection by finding core nodes. In: 2012 IEEE\/ACM international conference on advances in social networks analysis and mining, pp 1171\u20131176. IEEE"},{"key":"160_CR45","doi-asserted-by":"crossref","unstructured":"Zhao Y, Wang X, Yang H, Song L, Tang J (2019) Large scale evolving graphs with burst detection. In: Proceedings of the twenty-eighth international joint conference on artificial intelligence, IJCAI 2019, Macao, China, August 10\u201316, 2019, pp 4412\u20134418","DOI":"10.24963\/ijcai.2019\/613"},{"key":"160_CR46","doi-asserted-by":"crossref","unstructured":"Zhe C, Sun A, Xiao X (2019) Community detection on large complex attribute network. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2041\u20132049","DOI":"10.1145\/3292500.3330721"},{"issue":"11","key":"160_CR47","first-page":"2134","volume":"30","author":"D Zhu","year":"2018","unstructured":"Zhu D, Cui P, Zhang Z, Pei J, Zhu W (2018) High-order proximity preserved embedding for dynamic networks. IEEE Trans Knowl Data Eng 30(11):2134\u20132144","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"160_CR48","doi-asserted-by":"crossref","unstructured":"Zuo Y, Liu G, Lin H, Guo J, Hu X, Wu J (2018) Embedding temporal network via neighborhood formation. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 2857\u20132866","DOI":"10.1145\/3219819.3220054"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00160-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-021-00160-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-021-00160-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T16:54:53Z","timestamp":1672073693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-021-00160-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,7]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s41019-021-00160-6","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,7]]},"assertion":[{"value":"18 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}