{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:17:39Z","timestamp":1770337059172,"version":"3.49.0"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["NSF CNS-1422206"],"award-info":[{"award-number":["NSF CNS-1422206"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["NSF CNS-1337899"],"award-info":[{"award-number":["NSF CNS-1337899"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["NSF DGE-1565570"],"award-info":[{"award-number":["NSF DGE-1565570"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,8,1]]},"DOI":"10.1109\/tkde.2017.2685385","type":"journal-article","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T03:13:55Z","timestamp":1490152435000},"page":"1681-1694","source":"Crossref","is-referenced-by-count":18,"title":["Learning Social Circles in Ego-Networks Based on Multi-View Network Structure"],"prefix":"10.1109","volume":"29","author":[{"given":"Chao","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhao","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoli","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Huan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339593"},{"key":"ref39","first-page":"1194","article-title":"Learning representation and control in continuous Markov decision processes","author":"mahadevan","year":"2006","journal-title":"Proceedings of the National Conf on Artificial Intelligence"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2392622.2392628"},{"key":"ref33","first-page":"367","article-title":"Towards a theoretical understanding of negative transfer in collective matrix factorization","author":"lan","year":"2016","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783409"},{"key":"ref31","first-page":"1413","article-title":"Co-regularized multi-view spectral clustering","author":"kumar","year":"2011","journal-title":"Proc 24th Int Conf Neural Inf Process Syst"},{"key":"ref30","first-page":"1383","article-title":"Learning task grouping and overlap in multi-task learning","author":"kumar","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553460"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2397434"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063995"},{"key":"ref34","first-page":"1968","article-title":"Partial multi-view clustering","author":"li","year":"2014","journal-title":"Proc 28th AAAI Conf Artif Intell"},{"key":"ref60","first-page":"272","article-title":"Unfolding temporal dynamics: Predicting social media popularity using multi-scale temporal decomposition","author":"wu","year":"2016","journal-title":"Proc AAAI Publ 30th AAAI Conf Artif Intell"},{"key":"ref62","article-title":"A survey on multi-view learning","author":"xu","year":"2013"},{"key":"ref61","first-page":"298","article-title":"Learning the consistent behavior of common users for target node prediction across social networks","author":"wu","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"ref28","first-page":"513","article-title":"Revisiting k-means: New algorithms via bayesian nonparametrics","author":"kulis","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.167"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661973"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asv008"},{"key":"ref29","first-page":"393","article-title":"A co-training approach for multi-view spectral clustering","author":"kumar","year":"2011","journal-title":"Proc 28th Int Conf Mach Learning"},{"key":"ref67","first-page":"1057","article-title":"Spectral relaxation for k-means clustering","author":"zha","year":"2002","journal-title":"Proc Adv Neural Inform Process Syst"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339629"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135807"},{"key":"ref2","article-title":"Learning spectral clustering","author":"bach","year":"2003","journal-title":"Comput Sci"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1518736"},{"key":"ref22","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref24","first-page":"705","article-title":"Spectral clustering with perturbed data","author":"huang","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref26","first-page":"305","article-title":"Learning spectral clustering","author":"jordan","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1837110.1837122"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg232"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2964284.2964335"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063723"},{"key":"ref57","first-page":"2996","article-title":"Graph clustering with missing data: Convex algorithms and analysis","author":"vinayak","year":"2014","journal-title":"Proc 27th Int Conf Neural Inf Process Syst"},{"key":"ref56","article-title":"Relationship-based clustering and cluster ensembles for high-dimensional data mining","author":"strehl","year":"2002"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2012.250490"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2013.07.007"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1531674.1531689"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2470660"},{"key":"ref10","first-page":"2213","article-title":"Clustering partially observed graphs via convex optimization","volume":"15","author":"chen","year":"2014","journal-title":"J Mach Learning Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1873984"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2556612"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871535"},{"key":"ref13","first-page":"88","article-title":"Multi-view learning in the presence of view disagreement","author":"christoudias","year":"2012","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1083-6101.2007.00393.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"ref16","first-page":"606","article-title":"Covering the egonet: A crowdsourcing approach to social circle discovery on Twitter","author":"dykstra","year":"2015","journal-title":"Proc AAAI Conf on Weblogs and Social Media"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063719"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2011.122"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.5204\/mcj.620","article-title":"Mining one percent of Twitter: Collections, baselines, sampling","volume":"16","author":"gerlitz","year":"2013","journal-title":"M\/C Journal"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/34.598228"},{"key":"ref3","first-page":"89","article-title":"Co-training and expansion: Towards bridging theory and practice","author":"balcan","year":"2004","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/03610927408827101"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/279943.279962"},{"key":"ref8","first-page":"111","article-title":"@phillies tweeting from philly? predicting twitter user locations with spatial word usage","author":"chang","year":"2012","journal-title":"Proc Int Conf Adv Social Netw Anal Mining"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783292"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.117"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557044"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.254"},{"key":"ref45","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951407"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488483"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.13"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0610537104"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/69\/7970215\/7883882-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7970215\/07883882.pdf?arnumber=7883882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T19:18:47Z","timestamp":1658863127000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7883882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,1]]},"references-count":70,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2685385","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8,1]]}}}