{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T15:07:05Z","timestamp":1748617625268},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,28]],"date-time":"2016-10-28T00:00:00Z","timestamp":1477612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s13278-016-0405-2","type":"journal-article","created":{"date-parts":[[2016,10,28]],"date-time":"2016-10-28T03:48:03Z","timestamp":1477626483000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Network completion by leveraging similarity of nodes"],"prefix":"10.1007","volume":"6","author":[{"given":"Rana","family":"Forsati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iman","family":"Barjasteh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdol-Hossein","family":"Esfahanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hayder","family":"Radha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,28]]},"reference":[{"key":"405_CR1","first-page":"803","volume":"10","author":"J Abernethy","year":"2009","unstructured":"Abernethy J, Bach F, Evgeniou T, Vert J-P (2009) A new approach to collaborative filtering: operator estimation with spectral regularization. JMLR 10:803\u2013826","journal-title":"JMLR"},{"issue":"6","key":"405_CR2","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1098\/rsfs.2011.0050","volume":"1","author":"A Annibale","year":"2011","unstructured":"Annibale A, Coolen ACC (2011) What you see is not what you get: how sampling affects macroscopic features of biological networks. Interface Focus 1(6):836\u2013856","journal-title":"Interface Focus"},{"key":"405_CR3","doi-asserted-by":"crossref","unstructured":"Barjasteh I, Forsati R, Masrour F, Esfahanian AH, Radha H (2015) Cold-start item and user recommendation with decoupled completion and transduction. In: Proceedings of the 9th ACM conference on recommender systems. ACM, pp 91\u201398","DOI":"10.1145\/2792838.2800196"},{"issue":"6","key":"405_CR30","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1109\/TKDE.2016.2522422","volume":"28","author":"I Barjasteh","year":"2016","unstructured":"Barjasteh I, Forsati R, Ross D, Esfahanian A, Radha H (2016) Cold-Start Recommendation with Provable Guarantees: A Decoupled Approach. IEEE Trans Knowl Data Eng 28(6):1462-1474","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"405_CR4","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai J-F, Cand\u00e8s EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982","journal-title":"SIAM J Optim"},{"issue":"6","key":"405_CR5","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9(6):717\u2013772","journal-title":"Found Comput Math"},{"key":"405_CR6","unstructured":"Chiang K-Y, Hsieh C-J, Dhillon IS (2015) Matrix completion with noisy side information. In: NIPS'15 Proceedings of the 28th International Conference on Neural Information Processing Systems. MIT Press, Cambridge, pp 3447\u20133455"},{"issue":"1","key":"405_CR7","first-page":"1177","volume":"15","author":"C Kai-Yang","year":"2014","unstructured":"Kai-Yang C, Cho-Jui H, Nagarajan N, Dhillon Inderjit S, Ambuj Tewari (2014) Prediction and clustering in signed networks: a local to global perspective. JMLR 15(1):1177\u20131213","journal-title":"JMLR"},{"key":"405_CR8","doi-asserted-by":"crossref","unstructured":"Fang Y, Si L (2011) Matrix co-factorization for recommendation with rich side information and implicit feedback. In: Proceedings of the 2nd international workshop on information heterogeneity and fusion in recommender systems. ACM, pp 65\u201369","DOI":"10.1145\/2039320.2039330"},{"key":"405_CR9","doi-asserted-by":"crossref","unstructured":"Frank O (2005) Network sampling and model fitting. In: Models Methods Social Network Analysis. Cambridge\u00a0University Press, Cambridge, pp 31\u201356","DOI":"10.1017\/CBO9780511811395.003"},{"key":"405_CR10","unstructured":"Zeno G, Steffen R, Christoph F, Lars ST (2011) MyMediaLite: a free recommender system library. In: Proceedings of the 5th ACM conference on recommender systems (RecSys 2011)"},{"key":"405_CR11","unstructured":"Gittens AA (2013) Topics in randomized numerical linear algebra. PhD thesis, California Institute of Technology"},{"key":"405_CR12","unstructured":"Goldberg A, Recht B, Xu J, Nowak R, Zhu X (2010) Transduction with matrix completion: three birds with one stone. In: Advances in neural information processing systems, pp 757\u2013765"},{"issue":"52","key":"405_CR13","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","volume":"106","author":"R Guimer\u00e0","year":"2009","unstructured":"Guimer\u00e0 R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc Nat Acad Sci 106(52):22073\u201322078","journal-title":"Proc Nat Acad Sci"},{"key":"405_CR14","first-page":"209","volume":"5","author":"S Hanneke","year":"2009","unstructured":"Hanneke S, Xing EP (2009) Network completion and survey sampling. J Mach Learn Res 5:209\u2013215","journal-title":"J Mach Learn Res"},{"key":"405_CR15","unstructured":"Jain P, Dhillon IS (2013) Provable inductive matrix completion. arXiv preprint arXiv:1306.0626"},{"key":"405_CR16","first-page":"47","volume":"11","author":"M Kim","year":"2011","unstructured":"Kim M, Leskovec J (2011) The network completion problem: inferring missing nodes and edges in networks. SDM SIAM 11:47\u201358","journal-title":"SDM SIAM"},{"issue":"7","key":"405_CR17","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J (2007) The link-prediction problem for social networks. J Am Soc Inf Sci Technol 58(7):1019\u20131031","journal-title":"J Am Soc Inf Sci Technol"},{"issue":"9","key":"405_CR18","doi-asserted-by":"crossref","first-page":"2624","DOI":"10.1109\/JPROC.2012.2197809","volume":"100","author":"W Liu","year":"2012","unstructured":"Liu W, Wang J, Chang S-F (2012) Robust and scalable graph-based semisupervised learning. Proc IEEE 100(9):2624\u20132638","journal-title":"Proc IEEE"},{"key":"405_CR19","doi-asserted-by":"crossref","unstructured":"Masrour F, Barjasteh I, Forsati R, Esfahanian A-H, Radha H (2015) Network completion with node similarity: a matrix completion approach with provable guarantees. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining 2015. ACM, pp 302\u2013307","DOI":"10.1145\/2808797.2809407"},{"key":"405_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: homophily in social networks. Annu Rev Sociol 27:415\u2013444","journal-title":"Annu Rev Sociol"},{"key":"405_CR21","doi-asserted-by":"crossref","unstructured":"Menon AK, Chitrapura KP, Garg S, Agarwal D, Kota N (2011) Response prediction using collaborative filtering with hierarchies and side information. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 141\u2013149","DOI":"10.1145\/2020408.2020436"},{"key":"405_CR22","doi-asserted-by":"crossref","unstructured":"Menon AK, Elkan C (2011) Link prediction via matrix factorization. In: Gunopulos D, Hofmann T, Malerba D, Vazirgiannis M (eds) Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer Berlin, Heidelberg, pp 437\u2013452 \u00a0","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"405_CR23","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1609\/aaai.v24i1.7578","volume":"10","author":"W Pan","year":"2010","unstructured":"Pan W, Xiang EW, Liu NN, Yang Q (2010) Transfer learning in collaborative filtering for sparsity reduction. AAAI 10:230\u2013235","journal-title":"AAAI"},{"issue":"3","key":"405_CR24","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TKDE.2011.254","volume":"25","author":"M Papagelis","year":"2013","unstructured":"Papagelis M, Das G, Koudas N (2013) Sampling online social networks. Knowl Data Eng, IEEE Trans 25(3):662\u2013676","journal-title":"Knowl Data Eng, IEEE Trans"},{"key":"405_CR25","doi-asserted-by":"crossref","unstructured":"Porteous I, Asuncion AU, Welling M (2010) Bayesian matrix factorization with side information and dirichlet process mixtures.\u00a0In Proceedings of the 24th AAAI Conference\u00a0on Artificial Intelligence, pp 563\u2013568","DOI":"10.1609\/aaai.v24i1.7686"},{"key":"405_CR26","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht B (2011) A simpler approach to matrix completion. JMLR 12:3413\u20133430","journal-title":"JMLR"},{"issue":"13","key":"405_CR27","doi-asserted-by":"crossref","first-page":"i468","DOI":"10.1093\/bioinformatics\/btm173","volume":"23","author":"M Shiga","year":"2007","unstructured":"Shiga M, Takigawa I, Mamitsuka H (2007) Annotating gene function by combining expression data with a modular gene network. Bioinformatics 23(13):i468\u2013i478","journal-title":"Bioinformatics"},{"key":"405_CR28","unstructured":"Srebro N, Rennie J, Jaakkola TS (2004) Maximum-margin matrix factorization. In Advances in neural information processing systems, pp 1329\u20131336"},{"key":"405_CR29","first-page":"403","volume":"12","author":"T Zhou","year":"2012","unstructured":"Zhou T, Shan H, Banerjee A, Sapiro G (2012) Kernelized probabilistic matrix factorization: exploiting graphs and side information. SDM SIAM 12:403\u2013414","journal-title":"SDM SIAM"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0405-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-016-0405-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-016-0405-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T17:21:41Z","timestamp":1692552101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-016-0405-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,28]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["405"],"URL":"https:\/\/doi.org\/10.1007\/s13278-016-0405-2","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,28]]},"article-number":"102"}}