{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:46:59Z","timestamp":1648687619720},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T00:00:00Z","timestamp":1496966400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61402309"],"award-info":[{"award-number":["61402309"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["XDJK2014B012"],"award-info":[{"award-number":["XDJK2014B012"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Social Science Foundation of China","award":["13CGL146","15BGL2729"],"award-info":[{"award-number":["13CGL146","15BGL2729"]}]},{"name":"Study on the Key Common Characteristics of Network Transaction Fraud","award":["14SKF01"],"award-info":[{"award-number":["14SKF01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10586-017-0963-8","type":"journal-article","created":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T14:11:31Z","timestamp":1497017491000},"page":"945-953","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clustering based on words distances"],"prefix":"10.1007","volume":"21","author":[{"given":"Hongtao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hongwei","family":"Guan","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Jian","sequence":"additional","affiliation":[]},{"given":"Xueyan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Pei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,9]]},"reference":[{"key":"963_CR1","doi-asserted-by":"crossref","unstructured":"Qiao, Y.N., Yong, Q., Hui, H.: The research on term field based term co-occurrence model. In:Third International Conference on Semantics, Knowledge and Grid. IEEE, pp. 471\u2013474 (2007)","DOI":"10.1109\/SKG.2007.116"},{"key":"963_CR2","first-page":"010","volume":"6","author":"Y Zhang","year":"2009","unstructured":"Zhang, Y., Shi, K., Qingpeng, X.U.: Spam filter based on term co-occurrence model. J. Chin. Inf. Proc. 6, 010 (2009)","journal-title":"J. Chin. Inf. Proc."},{"key":"963_CR3","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhou, M., et al.: Resolving query translation ambiguity using a decaying co-occurrence model and syntactic dependence relations. In: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval. ACM (2002)","DOI":"10.1145\/564376.564409"},{"key":"963_CR4","volume-title":"Clustering Algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan, J.A., et al.: Clustering Algorithms. Wiley, New York (1975)"},{"issue":"2","key":"963_CR5","doi-asserted-by":"crossref","first-page":"026113","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 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"963_CR6","doi-asserted-by":"crossref","first-page":"056702","DOI":"10.1103\/PhysRevE.85.056702","volume":"85","author":"J Lee","year":"2012","unstructured":"Lee, J., Gross, S.P., Lee, J.: Modularity optimization by conformational space annealing. Phys. Rev. E 85(5), 056702 (2012)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"963_CR7","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.physa.2012.11.003","volume":"392","author":"R Shang","year":"2013","unstructured":"Shang, R., Bai, J., Jiao, L., et al.: Community detection based on modularity and an improved genetic algorithm. Phys. A 392(5), 1215\u20131231 (2013)","journal-title":"Phys. A"},{"issue":"10","key":"963_CR8","doi-asserted-by":"crossref","first-page":"P10020","DOI":"10.1088\/1742-5468\/2010\/10\/P10020","volume":"2010","author":"HW Shen","year":"2010","unstructured":"Shen, H.W., Cheng, X.Q.: Spectral methods for the detection of network community structure: a comparative analysis. J. Stat. Mech. 2010(10), P10020 (2010)","journal-title":"J. Stat. Mech."},{"issue":"9","key":"963_CR9","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1016\/j.aml.2009.02.005","volume":"22","author":"JQ Jiang","year":"2009","unstructured":"Jiang, J.Q., Dress, A.W.M., Yang, G.: A spectral clustering-based framework for detecting community structures in complex networks. Appl. Math. Lett. 22(9), 1479\u20131482 (2009)","journal-title":"Appl. Math. Lett."},{"issue":"12","key":"963_CR10","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"10","key":"963_CR11","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., et al.: Fast unfolding of communities in large networks. J. Stat. Mech. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech."},{"issue":"3","key":"963_CR12","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"963_CR13","doi-asserted-by":"crossref","first-page":"036103","DOI":"10.1103\/PhysRevE.83.036103","volume":"83","author":"L \u0160ubelj","year":"2011","unstructured":"\u0160ubelj, L., Bajec, M.: Unfolding communities in large complex networks: combining defensive and offensive label propagation for core extraction. Phys. Rev. E 83(3), 036103 (2011)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"963_CR14","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118\u20131123 (2008)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"963_CR15","doi-asserted-by":"crossref","first-page":"677","DOI":"10.3724\/SP.J.1016.2008.00677","volume":"31","author":"H Shen","year":"2008","unstructured":"Shen, H., Cheng, X.Q., Chen, H.Q., et al.: Information bottleneck based community detection in network. Chin. J. Comput. Chin. Ed. 31(4), 677 (2008)","journal-title":"Chin. J. Comput. Chin. Ed."},{"issue":"4","key":"963_CR16","first-page":"725","volume":"49","author":"XL Deng","year":"2012","unstructured":"Deng, X.L., Wang, B., Wu, B., et al.: Modularity modeling and evaluation in community detecting of complex network based on information entropy. J. Comput. Res. Dev. 49(4), 725\u2013734 (2012)","journal-title":"J. Comput. Res. Dev."},{"issue":"7043","key":"963_CR17","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., et al.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"issue":"3","key":"963_CR18","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S., Kert\u00e9sz, J.: Detecting the overlapping and hierarchical community structure in complex networks. N. J. Phys. 11(3), 033015 (2009)","journal-title":"N. J. Phys."},{"key":"963_CR19","doi-asserted-by":"crossref","unstructured":"Coscia, M., Rossetti, G., Giannotti, F., et al.: Demon: a local-first discovery method for overlapping communities. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 615\u2013623 (2012)","DOI":"10.1145\/2339530.2339630"},{"issue":"4","key":"963_CR20","doi-asserted-by":"crossref","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","volume":"6","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti, A., Radicchi, F., Ramasco, J.J., et al.: Finding statistically significant communities in networks. PloS ONE 6(4), e18961 (2011)","journal-title":"PloS ONE"},{"issue":"10","key":"963_CR21","doi-asserted-by":"crossref","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation. N. J. Phys. 12(10), 103018 (2010)","journal-title":"N. J. Phys."},{"issue":"3","key":"963_CR22","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/s11390-012-1236-x","volume":"27","author":"ZH Wu","year":"2012","unstructured":"Wu, Z.H., Lin, Y.F., Gregory, S., et al.: Balanced multi-label propagation for overlapping community detection in social networks. J. Comput. Sci. Technol. 27(3), 468\u2013479 (2012)","journal-title":"J. Comput. Sci. Technol."},{"key":"963_CR23","series-title":"Advances in Knowledge Discovery and Data Mining","volume-title":"Towards Linear Time Overlapping Community Detection in Social Networks","author":"J Xie","year":"2012","unstructured":"Xie, J., Szymanski, B.K.: Towards Linear Time Overlapping Community Detection in Social Networks. Advances in Knowledge Discovery and Data Mining. Springer, Berlin Heidelberg (2012)"},{"issue":"7307","key":"963_CR24","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761\u2013764 (2010)","journal-title":"Nature"},{"issue":"3","key":"963_CR25","doi-asserted-by":"crossref","first-page":"036103","DOI":"10.1103\/PhysRevE.84.036103","volume":"84","author":"B Ball","year":"2011","unstructured":"Ball, B., Karrer, B., Newman, M.E.J.: Efficient and principled method for detecting communities in networks. Phys. Rev. E 84(3), 036103 (2011)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"963_CR26","doi-asserted-by":"crossref","first-page":"026110","DOI":"10.1103\/PhysRevE.84.026110","volume":"84","author":"Y Kim","year":"2011","unstructured":"Kim, Y., Jeong, H.: Map equation for link communities. Phys. Rev. E 84(2), 026110 (2011)","journal-title":"Phys. Rev. E"},{"issue":"34","key":"963_CR27","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.P., Sander, J., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96(34), 226\u2013231 (1996)","journal-title":"Kdd"},{"issue":"6191","key":"963_CR28","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1126\/science.1242072","volume":"344","author":"A Rodriguez","year":"2014","unstructured":"Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492\u20131496 (2014)","journal-title":"Science"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-017-0963-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-0963-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-017-0963-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T23:59:05Z","timestamp":1589759945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-017-0963-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,9]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["963"],"URL":"https:\/\/doi.org\/10.1007\/s10586-017-0963-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,9]]}}}