{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:45:35Z","timestamp":1744332335761,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T00:00:00Z","timestamp":1628294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T00:00:00Z","timestamp":1628294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61762078","61363058"],"award-info":[{"award-number":["No.61762078","61363058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61663004"],"award-info":[{"award-number":["61663004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s13042-021-01384-8","type":"journal-article","created":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T09:02:43Z","timestamp":1628326963000},"page":"3463-3474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Is the simple assignment enough? Exploring the interpretability for community detection"],"prefix":"10.1007","volume":"12","author":[{"given":"Qiqi","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5104-8982","authenticated-orcid":false,"given":"Huifang","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xiaohong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,7]]},"reference":[{"issue":"6","key":"1384_CR1","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.3233\/IDA-163156","volume":"21","author":"C Peng","year":"2017","unstructured":"Peng C, Zhang Z, Wong KC et al (2017) A scalable community detection algorithm for large graphs using stochastic block models. Intell Data Anal 21(6):1463\u20131485","journal-title":"Intell Data Anal"},{"key":"1384_CR2","doi-asserted-by":"crossref","unstructured":"Yang J, McAuley J, Leskovec J (2013) Community detection in networks with node attributes. IEEE 13th international conference on data mining. IEEE, 2013 pp 1151\u20131156","DOI":"10.1109\/ICDM.2013.167"},{"key":"1384_CR3","unstructured":"Zhang F, Zhang Y, Qin L et al (2016) When engagement meets similarity: efficient (k, r)-core computation on social networks[J]. arXiv preprint arXiv:611.03254."},{"issue":"5","key":"1384_CR4","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","volume":"28","author":"JJ Whang","year":"2016","unstructured":"Whang JJ, Gleich DF, Dhillon IS (2016) Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans  Knowl  Data Eng 28(5):1272\u20131284","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"1384_CR5","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2013) Overlapping community detection at scale: a nonnegative matrix factorization approach. Proceedings of the sixth ACM international conference on web search and data mining. 2013:587\u2013596","DOI":"10.1145\/2433396.2433471"},{"key":"1384_CR6","doi-asserted-by":"publisher","first-page":"104822","DOI":"10.1016\/j.knosys.2019.06.030","volume":"187","author":"X You","year":"2020","unstructured":"You X, Ma Y, Liu Z (2020) A three-stage algorithm on community detection in social networks. Knowl-Based Syst 187:104822","journal-title":"Knowl Based Syst"},{"key":"1384_CR7","doi-asserted-by":"publisher","first-page":"121586","DOI":"10.1109\/ACCESS.2019.2937580","volume":"7","author":"X Pan","year":"2019","unstructured":"Pan X, Xu G, Wang B et al (2019) A novel community detection algorithm based on local similarity of clustering coefficient in social networks. IEEE Access 7:121586\u2013121598","journal-title":"IEEE Access"},{"key":"1384_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ijar.2016.08.007","volume":"80","author":"J Li","year":"2017","unstructured":"Li J, Kumar CA, Mei C et al (2017) Comparison of reduction in formal decision contexts. Int J Approximate Reasoning 80:100\u2013122","journal-title":"International Journal of Approximate Reasoning"},{"key":"1384_CR9","doi-asserted-by":"crossref","unstructured":"Xia S, Zhang Z, Li W et al (2020) GBNRS: a novel rough set algorithm for fast adaptive attribute reduction in classification. IEEE Trans  Knowl  Data Eng pp 1\u20131","DOI":"10.1109\/TKDE.2020.2997039"},{"issue":"2","key":"1384_CR10","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s10115-018-1228-4","volume":"60","author":"H Zhang","year":"2019","unstructured":"Zhang H, Wang CD, Lai JH et al (2019) Community detection using multilayer edge mixture model. Knowl  Inform Syst 60(2):757\u2013779","journal-title":"Knowledge and Information Systems"},{"issue":"11","key":"1384_CR11","doi-asserted-by":"publisher","first-page":"2644","DOI":"10.1109\/TPAMI.2018.2863278","volume":"41","author":"JJ Whang","year":"2018","unstructured":"Whang JJ, Hou Y, Gleich DF et al (2018) Non-exhaustive, overlapping clustering. IEEE trans  pattern anal  mach intell 41(11):2644\u20132659","journal-title":"IEEE transactions on pattern analysis and machine intelligence"},{"key":"1384_CR12","doi-asserted-by":"crossref","unstructured":"Xia S, Peng D, Meng D et al (2020) A fast adaptive k-means with no bounds. IEEE Trans  Pattern Anal  Mach Intell 1\u20131","DOI":"10.1109\/TPAMI.2020.3008694"},{"key":"1384_CR13","doi-asserted-by":"crossref","unstructured":"Xia S, Chen B, Wang G et al (2021) mCRF and mRD: two classification methods based on a novel multiclass label noise filtering learning framework. IEEE Trans  Neural Networks  Learn Syst 1\u201315","DOI":"10.1109\/TNNLS.2020.3047046"},{"key":"1384_CR14","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ins.2019.01.010","volume":"483","author":"S Xia","year":"2019","unstructured":"Xia S, Liu Y, Ding X et al (2019) Granular ball computing classifiers for efficient, scalable and robust learning. Inform Sci 483:136\u2013152","journal-title":"Information Sciences"},{"key":"1384_CR15","doi-asserted-by":"publisher","first-page":"57943","DOI":"10.1109\/ACCESS.2019.2912182","volume":"7","author":"Z Liu","year":"2019","unstructured":"Liu Z, Xiang B, Guo W et al (2019) Overlapping community detection algorithm based on coarsening and local overlapping modularity. IEEE Access 7:57943\u201357955","journal-title":"IEEE Access"},{"key":"1384_CR16","doi-asserted-by":"crossref","unstructured":"Zhe C, Sun A, Xiao X (2019) Community detection on large complex attribute network. Proceedings of the 25th ACM SIGKDD int conf  knowl discov & data min 2041\u20132049","DOI":"10.1145\/3292500.3330721"},{"issue":"7084","key":"1384_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1038\/nature04670","volume":"440","author":"NJ Krogan","year":"2006","unstructured":"Krogan NJ, Cagney G, Yu H et al (2006) Global landscape of protein complexes in the yeast Saccharomyces cerevisiae. Nature 440(7084):637\u2013643","journal-title":"Nature"},{"key":"1384_CR18","doi-asserted-by":"crossref","unstructured":"Whang JJ, Dhillon IS, Gleich DF (2015) Non-exhaustive, overlapping k-means. Proceedings of the 2015 SIAM international conference on data mining Soc  Ind and Appl Math 936\u2013944","DOI":"10.1137\/1.9781611974010.105"},{"key":"1384_CR19","doi-asserted-by":"publisher","first-page":"106842","DOI":"10.1016\/j.csda.2019.106842","volume":"143","author":"CE Rodr\u00edguez","year":"2020","unstructured":"Rodr\u00edguez CE, N\u00far\u0303ez-Antonio G, Escarela G (2020) A Bayesian mixture model for clustering circular data. Comput Statistics  Data Anal, 143:106842","journal-title":"Computational Statistics & Data Analysis"},{"key":"1384_CR20","doi-asserted-by":"publisher","first-page":"134583","DOI":"10.1109\/ACCESS.2019.2939864","volume":"7","author":"X Guo","year":"2019","unstructured":"Guo X, Su J, Zhou H et al (2019) Community detection based on genetic algorithm using local structural similarity. IEEE Access 7:134583\u2013134600","journal-title":"IEEE Access"},{"key":"1384_CR21","doi-asserted-by":"publisher","first-page":"126642","DOI":"10.1109\/ACCESS.2019.2938783","volume":"7","author":"X Ma","year":"2019","unstructured":"Ma X, Yang P, Guan S (2019) Overlapping community detection algorithm based on edge strength. IEEE Access 7:126642\u2013126650","journal-title":"IEEE Access"},{"issue":"3","key":"1384_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.2018.0834","volume":"31","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas D, Nohadani O (2019) Robust maximum likelihood estimation. INFORMS J  Comput 31(3):445\u2013458","journal-title":"INFORMS Journal on Computing"},{"issue":"499","key":"1384_CR23","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1080\/01621459.2012.699795","volume":"107","author":"DL Sussman","year":"2012","unstructured":"Sussman DL, Tang M, Fishkind DE et al (2012) A consistent adjacency spectral embedding for stochastic blockmodel graphs. J  Am Stat Assoc 107(499):1119\u20131128","journal-title":"Journal of the American Statistical Association"},{"key":"1384_CR24","doi-asserted-by":"crossref","unstructured":"Perozzi B, Akoglu L (2016) Scalable anomaly ranking of attributed neighborhoods. Proceedings of the 2016 SIAM International Conference on Data Mining. Soc  Ind  Appl Math 207\u2013215","DOI":"10.1137\/1.9781611974348.24"},{"key":"1384_CR25","doi-asserted-by":"crossref","unstructured":"Zhao Q, Ma H, Li X et al (2020) NotMle: community detection in an inference way. 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI). IEEE 736\u2013741","DOI":"10.1109\/ICTAI50040.2020.00117"},{"issue":"1","key":"1384_CR26","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1038\/nphys2162","volume":"8","author":"MEJ Newman","year":"2012","unstructured":"Newman MEJ (2012) Communities, modules and large-scale structure in networks. Nature phys 8(1):25\u201331","journal-title":"Nature physics"},{"key":"1384_CR27","unstructured":"Mehta N, Duke L C, Rai P (2019) Stochastic blockmodels meet graph neural networks. Int Conf  Mach Learn. PMLR, 4466\u20134474"},{"issue":"2","key":"1384_CR28","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TCYB.2017.2783325","volume":"49","author":"M Qiao","year":"2018","unstructured":"Qiao M, Yu J, Bian W et al (2018) Adapting stochastic block models to power-law degree distributions. IEEE trans  cybern, 49(2):626\u2013637","journal-title":"IEEE transactions on cybernetics"},{"key":"1384_CR29","unstructured":"Airoldi E M, Blei DM, Fienberg SE et al (2008) Mixed membership stochastic blockmodels. J  mach learn res 9(2008):1981\u20132014"},{"key":"1384_CR30","doi-asserted-by":"crossref","unstructured":"Cai X, Huang D, Wang CD et al (2020) Spectral clustering by subspace randomization and graph fusion for high-dimensional data. Adv  Knowl Discov  Data Min 12084:330\u2013342","DOI":"10.1007\/978-3-030-47426-3_26"},{"issue":"4","key":"1384_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J  anthropol res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"1384_CR32","doi-asserted-by":"crossref","unstructured":"You X, Ma Y, Liu Z (2020) A three-stage algorithm on community detection in social networks. Knowl-Based Syst 187:104822","DOI":"10.1016\/j.knosys.2019.06.030"},{"issue":"1","key":"1384_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms11863","volume":"7","author":"MEJ Newman","year":"2016","unstructured":"Newman MEJ, Clauset A (2016) Structure and inference in annotated networks. Nature communications 7(1):1\u201311","journal-title":"Nature communications"},{"key":"1384_CR34","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. Soc  Appl Math 1027\u20131035"},{"issue":"5","key":"1384_CR35","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/TNNLS.2013.2292894","volume":"25","author":"B Fr\u00e9nay","year":"2013","unstructured":"Fr\u00e9nay B, Verleysen M (2013) Classification in the presence of label noise: a survey. IEEE trans neural networks  learn syst 25(5):845\u2013869","journal-title":"IEEE transactions on neural networks and learning systems"},{"issue":"11","key":"1384_CR36","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1109\/TKDE.2018.2873791","volume":"31","author":"S Xia","year":"2019","unstructured":"Xia S, Wang G, Chen Z et al (2019) Complete random forest based class noise filtering learning for improving the generalizability of classifiers. IEEE Trans Knowl  Data Eng 31(11):2063\u20132078","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"key":"1384_CR37","doi-asserted-by":"crossref","unstructured":"Ruan Y, Fuhry D, Parthasarathy S (2013) Efficient community detection in large networks using content and links. Proceedings of the 22nd int conf  World Wide Web 1089\u20131098","DOI":"10.1145\/2488388.2488483"},{"issue":"7307","key":"1384_CR38","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn YY, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761\u2013764","journal-title":"Nature"},{"issue":"2","key":"1384_CR39","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10489-018-1297-9","volume":"49","author":"M Arasteh","year":"2019","unstructured":"Arasteh M, Alizadeh S (2019) A fast divisive community detection algorithm based on edge degree betweenness centrality. Appl Intelli 49(2):689\u2013702","journal-title":"Applied Intelligence"},{"issue":"1","key":"1384_CR40","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009) Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys Rev E 80(1):016118","journal-title":"Physical Review E"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-021-01384-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-021-01384-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-021-01384-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T18:22:08Z","timestamp":1635186128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-021-01384-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,7]]},"references-count":40,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1384"],"URL":"https:\/\/doi.org\/10.1007\/s13042-021-01384-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2021,8,7]]},"assertion":[{"value":"16 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}