{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T11:09:31Z","timestamp":1761217771247},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,22]],"date-time":"2015-02-22T00:00:00Z","timestamp":1424563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s13042-015-0338-5","type":"journal-article","created":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T02:12:49Z","timestamp":1424484769000},"page":"455-468","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficiently detecting overlapping communities using seeding and semi-supervised learning"],"prefix":"10.1007","volume":"8","author":[{"given":"Changxing","family":"Shang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengzhong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongying","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,22]]},"reference":[{"issue":"12","key":"338_CR1","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821","journal-title":"Proc Natl Acad Sci"},{"key":"338_CR2","doi-asserted-by":"crossref","unstructured":"Borgs C, Chayes J, Mahdian M, Saberi A (2004) Exploring the community structure of newsgroups. In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 783\u2013787, 2004","DOI":"10.1145\/1014052.1016914"},{"key":"338_CR3","unstructured":"Lee C, Reid F, McDaid A, Hurley N (2010) Detecting highly overlapping community structure by greedy clique expansion. In: SNA-KDD\u201910: Proceedings of the 4th Workshop on Social Network Mining and Analysis, 2010"},{"issue":"3","key":"338_CR4","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 (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015","journal-title":"New J Phys"},{"issue":"6","key":"338_CR5","doi-asserted-by":"crossref","first-page":"066107","DOI":"10.1103\/PhysRevE.83.066107","volume":"83","author":"C Lee","year":"2011","unstructured":"Lee C, Reid F, McDaid A, Hurley N (2011) Seeding for pervasively overlapping communities. Phys Rev E 83(6):066107","journal-title":"Phys Rev E"},{"issue":"5","key":"338_CR6","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S (2009) Community detection algorithms: a comparative analysis. Phys Rev E 80(5):056117","journal-title":"Phys Rev E"},{"issue":"23","key":"338_CR7","doi-asserted-by":"crossref","first-page":"9564","DOI":"10.1073\/pnas.0610537104","volume":"104","author":"ME Newman","year":"2007","unstructured":"Newman ME, Leicht EA (2007) Mixture models and exploratory analysis in networks. Proc Natl Acad Sci 104(23):9564","journal-title":"Proc Natl Acad Sci"},{"issue":"8","key":"338_CR8","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen H, Cheng X, Cai K, Hu MB (2009) Detect overlapping and hierarchical community structure in networks. Phys A Stat Mech Appl 388(8):1706","journal-title":"Phys A Stat Mech Appl"},{"issue":"9","key":"338_CR9","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Commun ACM 16(9):575","journal-title":"Commun ACM"},{"key":"338_CR10","first-page":"97","volume":"5","author":"J Baumes","year":"2005","unstructured":"Baumes J, Goldberg MK, Krishnamoorthy MS, Magdon-Ismail M, Preston N (2005) Finding communities by clustering a graph into overlapping subgraphs. IADIS AC 5:97","journal-title":"IADIS AC"},{"key":"338_CR11","doi-asserted-by":"crossref","unstructured":"Baumes J, Goldberg M, Magdon-Ismail M (2005) Intelligence and security informatics. Springer, New York, pp 27\u201336","DOI":"10.1007\/11427995_3"},{"key":"338_CR12","unstructured":"Yang J, Leskovec J (2012) Proceedings of the ACM SIGKDD Workshop on mining data semantics, ACM, p 3, 2012"},{"key":"338_CR13","unstructured":"Borgatti SP (2012) Computational complexity\u2014theory, techniques, and applications. In: Meyers RA (ed). Springer, New York, pp 2912\u20132924"},{"key":"338_CR14","doi-asserted-by":"crossref","unstructured":"Berry MW, Castellanos M (2004) Survey of text mining. Springer, New York","DOI":"10.1007\/978-1-4757-4305-0"},{"key":"338_CR15","unstructured":"Koller D, Sahami M (1997) Proceedings of ICML-97, 14th International Conference on machine learning. Morgan Kaufmann Publishers, Burlington, pp 170\u2013178"},{"issue":"5","key":"338_CR16","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1108\/00220410410560582","volume":"60","author":"S Robertson","year":"2004","unstructured":"Robertson S (2004) Understanding inverse document frequency: on theoretical arguments for IDF. J Doc 60(5):503","journal-title":"J Doc"},{"key":"338_CR17","first-page":"3","volume":"2","author":"X Zhu","year":"2006","unstructured":"Zhu X (2006) Semi-supervised learning literature survey. Comput Sci Univ Wis Madison 2:3","journal-title":"Comput Sci Univ Wis Madison"},{"key":"338_CR18","unstructured":"Jiang J, Yan X, Yu Z, Guo J, Tian W (2014) A Chinese expert disambiguation method based on semi-supervised graph clustering. Int J Mac Learn Cybern :1\u20138 (2014)"},{"issue":"3","key":"338_CR19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s13042-011-0059-3","volume":"3","author":"U Maulik","year":"2012","unstructured":"Maulik U, Chakraborty D (2012) A novel semisupervised SVM for pixel classification of remote sensing imagery. Int J Mac Learn Cybern 3(3):247","journal-title":"Int J Mac Learn Cybern"},{"issue":"3","key":"338_CR20","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s13042-013-0183-3","volume":"5","author":"WJ Chen","year":"2014","unstructured":"Chen WJ, Shao YH, Hong N (2014) Laplacian smooth twin support vector machine for semi-supervised classification. Int J Mac Learn Cybern 5(3):459","journal-title":"Int J Mac Learn Cybern"},{"key":"338_CR21","unstructured":"Tanha J, van Someren M, Afsarmanesh H (2015) Semi-supervised self-training for decision tree classifiers. Int J Mac Learn Cybern :1\u201316"},{"issue":"2\u20133","key":"338_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","volume":"29","author":"P Domingos","year":"1997","unstructured":"Domingos P, Pazzani M (1997) On the optimality of the simple Bayesian classifier under zero-one loss. Mach Learn 29(2\u20133):103","journal-title":"Mach Learn"},{"key":"338_CR23","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.knosys.2013.09.019","volume":"54","author":"C Shang","year":"2013","unstructured":"Shang C, Li M, Feng S, Jiang Q, Fan J (2013) Feature selection via maximizing global information gain for text classification. Knowl Based Syst 54:298","journal-title":"Knowl Based Syst"},{"key":"338_CR24","doi-asserted-by":"crossref","unstructured":"Charikar MS (2002) Similarity estimation techniques from rounding algorithms. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, ACM, pp 380\u2013388, 2002","DOI":"10.1145\/509907.509965"},{"key":"338_CR25","doi-asserted-by":"crossref","unstructured":"Manku GS, Jain A, Das Sarma A (2007) Detecting near-duplicates for web crawling. In: Proceedings of the 16th international conference on World Wide Web, ACM, pp 141\u2013150, 2007","DOI":"10.1145\/1242572.1242592"},{"key":"338_CR26","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Mallela S, Modha DS (2003) Information-theoretic co-clustering. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 89\u201398, 2003","DOI":"10.1145\/956750.956764"},{"key":"338_CR27","unstructured":"Mladenic D, Grobelnik M (1999) Feature selection for unbalanced class distribution and naive bayes. ICML 99:258\u2013267"},{"issue":"4","key":"338_CR28","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"issue":"1","key":"338_CR29","doi-asserted-by":"crossref","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":"Phys Rev E"},{"issue":"3","key":"338_CR30","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/080734315","volume":"53","author":"AL Traud","year":"2011","unstructured":"Traud AL, Kelsic ED, Mucha PJ, Porter MA (2011) Comparing community structure to characteristics in online collegiate social networks. SIAM Rev 53(3):526","journal-title":"SIAM Rev"},{"issue":"16","key":"338_CR31","doi-asserted-by":"crossref","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of Facebook networks. Phys A Stat Mech Appl 391(16):4165","journal-title":"Phys A Stat Mech Appl"},{"issue":"1","key":"338_CR32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1093\/comnet\/cnt012","volume":"2","author":"C Lee","year":"2014","unstructured":"Lee C, Cunningham P (2014) Community detection: effective evaluation on large social networks. J Comp Netw 2(1):19","journal-title":"J Comp Netw"},{"key":"338_CR33","unstructured":"Gargi U, Lu W, Mirrokni VS, Yoon S (2011) Large-Scale Community Detection on YouTube for Topic Discovery and Exploration. ICWSM"},{"key":"338_CR34","doi-asserted-by":"crossref","unstructured":"Subbian K, Aggarwal CC, Srivastava J, Yu PS (2013) Community Detection with Prior Knowledge. In: Proceedings of the 2013 SIAM International Conference on data mining, SIAM, pp 405\u2013413, 2013","DOI":"10.1137\/1.9781611972832.45"},{"key":"338_CR35","doi-asserted-by":"crossref","unstructured":"Yang T, Jin R, Chi Y, Zhu S (2009) Combining link and content for community detection: a discriminative approach. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp 927\u2013936, 2009","DOI":"10.1145\/1557019.1557120"},{"issue":"36","key":"338_CR36","doi-asserted-by":"crossref","first-page":"14534","DOI":"10.1073\/pnas.1221839110","volume":"110","author":"PK Gopalan","year":"2013","unstructured":"Gopalan PK, Blei DM (2013) Efficient discovery of overlapping communities in massive networks. Proc Natl Acad Sci 110(36):14534","journal-title":"Proc Natl Acad Sci"},{"key":"338_CR37","doi-asserted-by":"crossref","unstructured":"Andersen R, Gleich DF, Mirrokni V (2012) Overlapping clusters for distributed computation. In: Proceedings of the fifth ACM international conference on Web search and data mining, ACM, pp 273\u2013282, 2012","DOI":"10.1145\/2124295.2124330"},{"key":"338_CR38","doi-asserted-by":"crossref","unstructured":"Gleich DF, Seshadhri C (2012) Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, ACM , pp 597\u2013605, 2012","DOI":"10.1145\/2339530.2339628"},{"key":"338_CR39","doi-asserted-by":"crossref","unstructured":"Xie J, Kelley S, Szymanski EK (2013) Overlapping Community Detection in Networks: The State-of-the-art and Comparative Study. ACM Comput Surv 45(4):43. doi:10.1145\/2501654.2501657","DOI":"10.1145\/2501654.2501657"},{"key":"338_CR40","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski BK, Liu X (2011) Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: Data Mining Workshops (ICDMW), 2011 IEEE 11th International Conference on, IEEE, pp 344\u2013349, 2011","DOI":"10.1109\/ICDMW.2011.154"},{"issue":"10","key":"338_CR41","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 (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018","journal-title":"New J Phys"},{"issue":"4","key":"338_CR42","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 JJ, Fortunato S (2011) Finding statistically significant communities in networks. PloS One 6(4):e18961","journal-title":"PloS One"},{"issue":"7043","key":"338_CR43","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, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814","journal-title":"Nature"},{"issue":"3","key":"338_CR44","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 MEJ (2011) Efficient and principled method for detecting communities in networks. Phys Rev E 84(3):036103","journal-title":"Phys Rev E"},{"key":"338_CR45","doi-asserted-by":"crossref","unstructured":"Chapelle O, Sch\u00f6lkopf B, Zien A (2006) Risks of semi-supervisedl earning: how unlabeled data can degrade performance of generative classifiers, in semi-supervised learning. MIT Press, Massachusetts , pp 57\u201372","DOI":"10.7551\/mitpress\/9780262033589.001.0001"},{"issue":"7307","key":"338_CR46","doi-asserted-by":"crossref","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","journal-title":"Nature"},{"key":"338_CR47","doi-asserted-by":"crossref","unstructured":"Ding C, He X (2002) Cluster merging and splitting in hierarchical clustering algorithms. Data mining, 2002, ICDM 2003. Proceedings. 2002 IEEE International Conference on, IEEE, pp 139\u2013146, 2002","DOI":"10.1109\/ICDM.2002.1183896"},{"issue":"2","key":"338_CR48","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) The structure and function of complex networks. SIAM Rev 45(2):167","journal-title":"SIAM Rev"},{"key":"338_CR49","doi-asserted-by":"crossref","unstructured":"Stoffel K, Belkoniene A (1999) Parallel K\/h-Means Clustering for Large Data Sets. In: Proceedings of the 5th International Euro-Par Conference on parallel processing. Springer, New York, pp 1451\u20131454, (Euro-Par \u201999)","DOI":"10.1007\/3-540-48311-X_205"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0338-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0338-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0338-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0338-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:31:18Z","timestamp":1559471478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0338-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,22]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["338"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0338-5","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,22]]}}}