{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T23:27:09Z","timestamp":1769556429509,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T00:00:00Z","timestamp":1552953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Interuniversity Attraction Poles Programme","award":["DYSCO"],"award-info":[{"award-number":["DYSCO"]}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["ANR-15-CE38-0001"],"award-info":[{"award-number":["ANR-15-CE38-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["ANR-13-CORD-0017-01"],"award-info":[{"award-number":["ANR-13-CORD-0017-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10994-019-05792-4","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T12:28:11Z","timestamp":1555504091000},"page":"1729-1756","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["RankMerging: a supervised learning-to-rank framework to predict links in large social networks"],"prefix":"10.1007","volume":"108","author":[{"given":"Lionel","family":"Tabourier","sequence":"first","affiliation":[]},{"given":"Daniel F.","family":"Bernardes","sequence":"additional","affiliation":[]},{"given":"Anne-Sophie","family":"Libert","sequence":"additional","affiliation":[]},{"given":"Renaud","family":"Lambiotte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,19]]},"reference":[{"key":"5792_CR1","unstructured":"Al Hasan, M., Chaoji, V., Salem, S., & Zaki, M. (2006). Link prediction using supervised learning. In SDM\u201906: Workshop on link analysis, counter-terrorism and security."},{"key":"5792_CR2","unstructured":"Al Hasan, M., & Zaki, M. (2011). A survey of link prediction in social networks. In Social network data analytics (pp. 243\u2013275). Berlin: Springer."},{"key":"5792_CR3","volume-title":"Social choice and individual values","author":"KJ Arrow","year":"2012","unstructured":"Arrow, K. J. (2012). Social choice and individual values (Vol. 12). New Haven: Yale University Press."},{"key":"5792_CR4","doi-asserted-by":"crossref","unstructured":"Backstrom, L., & Leskovec, J. (2011). Supervised random walks: Predicting and recommending links in social networks. In Proceedings of the fourth ACM international conference on web search and data mining (pp. 635\u2013644). ACM.","DOI":"10.1145\/1935826.1935914"},{"key":"5792_CR5","doi-asserted-by":"crossref","unstructured":"Benchettara, N., Kanawati, R., & Rouveirol, C. (2010). Supervised machine learning applied to link prediction in bipartite social networks. In International conference on advances in social networks analysis and mining (ASONAM) (pp. 326\u2013330). IEEE.","DOI":"10.1109\/ASONAM.2010.87"},{"key":"5792_CR6","unstructured":"Bliss, C. A., Frank, M. R., Danforth, C. M., & Dodds, P. S. (2013). An evolutionary algorithm approach to link prediction in dynamic social networks. \n                    arXiv:1304.6257\n                    \n                  ."},{"key":"5792_CR7","first-page":"25","volume":"14","author":"CJC Burges","year":"2011","unstructured":"Burges, C. J. C., Svore, K. M., Bennett, P. N., Pastusiak, A., & Wu, Q. (2011). Learning to rank using an ensemble of lambda-gradient models. Journal of Machine Learning Research-Proceedings Track, 14, 25\u201335.","journal-title":"Journal of Machine Learning Research-Proceedings Track"},{"key":"5792_CR8","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T. Y., Tsai, M. F., & Li, H. (2007). Learning to rank: From pairwise approach to listwise approach. In Proceedings of the 24th international conference on machine learning (pp. 129\u2013136). ACM.","DOI":"10.1145\/1273496.1273513"},{"key":"5792_CR9","unstructured":"Chapelle, O., Chang, Y., & Liu, T. Y. (2011). Future directions in learning to rank. In Yahoo! learning to rank challenge (pp. 91\u2013100)."},{"issue":"3","key":"5792_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10791-009-9109-9","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle, O., & Keerthi, S. S. (2010). Efficient algorithms for ranking with SVMs. Information Retrieval, 13(3), 201\u2013215.","journal-title":"Information Retrieval"},{"key":"5792_CR11","doi-asserted-by":"crossref","unstructured":"Comar, P. M., Tan, P. N., & Jain, A. K. (2011). Linkboost: A novel cost-sensitive boosting framework for community-level network link prediction. In 11th international conference on data mining (ICDM) (pp. 131\u2013140). IEEE.","DOI":"10.1109\/ICDM.2011.93"},{"key":"5792_CR12","unstructured":"Dasgupta, K., Singh, R., Viswanathan, B., Chakraborty, D., Mukherjea, S., Nanavati, A. A., & Joshi, A. (2008). Social ties and their relevance to churn in mobile telecom networks. In Proceedings of the 11th international conference on extending database technology (pp. 668\u2013677). New York: ACM."},{"issue":"2","key":"5792_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s13278-012-0068-6","volume":"3","author":"D Davis","year":"2013","unstructured":"Davis, D., Lichtenwalter, R., & Chawla, N. V. (2013). Supervised methods for multi-relational link prediction. Social Network Analysis and Mining, 3(2), 127\u2013141.","journal-title":"Social Network Analysis and Mining"},{"key":"5792_CR14","unstructured":"de Borda, J. C. (1781). M\u00e9moire sur les \u00e9lections au scrutin. In Histoire de l\u2019Acad\u00e9mie Royale des Sciences."},{"key":"5792_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. In Proceedings of the 10th international conference on world wide web (pp. 613\u2013622). ACM.","DOI":"10.1145\/371920.372165"},{"key":"5792_CR16","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R. E., & Singer, Y. (2003). An efficient boosting algorithm for combining preferences. The Journal of Machine Learning Research, 4, 933\u2013969.","journal-title":"The Journal of Machine Learning Research"},{"key":"5792_CR17","unstructured":"Herbrich, R., Graepel, T., & Obermayer, K. (1999). Large margin rank boundaries for ordinal regression. In Advances in neural information processing systems (pp. 115\u2013132)."},{"key":"5792_CR18","doi-asserted-by":"crossref","unstructured":"Huang, Z., Li, X., & Chen, H. (2005). Link prediction approach to collaborative filtering. In Proceedings of the 5th ACM\/IEEE-CS joint conference on digital libraries (pp. 141\u2013142). ACM.","DOI":"10.1145\/1065385.1065415"},{"key":"5792_CR19","doi-asserted-by":"crossref","unstructured":"Kashima, H., Kato, T., Yamanishi, Y., Sugiyama, M., & Tsuda, K. (2009). Link propagation: A fast semi-supervised learning algorithm for link prediction. In SDM (Vol. 9, pp. 1099\u20131110). SIAM.","DOI":"10.1137\/1.9781611972795.94"},{"issue":"5757","key":"5792_CR20","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets, G., & Watts, D. J. (2006). Empirical analysis of an evolving social network. Science, 311(5757), 88\u201390.","journal-title":"Science"},{"key":"5792_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kumar, R., & Tomkins, A. (2008). Microscopic evolution of social networks. In Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 462\u2013470). ACM.","DOI":"10.1145\/1401890.1401948"},{"issue":"7","key":"5792_CR22","doi-asserted-by":"publisher","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. Journal of the American Society for Information Science and Technology, 58(7), 1019\u20131031.","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"5792_CR23","doi-asserted-by":"crossref","unstructured":"Lichtenwalter, R. N., Lussier, J. T., & Chawla, N. V. (2010). New perspectives and methods in link prediction. In Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 243\u2013252). ACM.","DOI":"10.1145\/1835804.1835837"},{"issue":"3","key":"5792_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu, T. Y. (2009). Learning to rank for information retrieval. Foundations and Trends in Information Retrieval, 3(3), 225\u2013331.","journal-title":"Foundations and Trends in Information Retrieval"},{"key":"5792_CR25","doi-asserted-by":"crossref","unstructured":"Liu, Y. T., Liu, T. Y., Qin, T., Ma, Z. M., & Li, H. (2007). Supervised rank aggregation. In Proceedings of the 16th international conference on world wide web (pp. 481\u2013490). ACM.","DOI":"10.1145\/1242572.1242638"},{"issue":"6","key":"5792_CR26","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc, L., & Zhou, T. (2011). Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, 390(6), 1150\u20131170.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"5792_CR27","unstructured":"Menon, A. K., & Elkan, C. (2011). Link prediction via matrix factorization. In Joint european conference on machine learning and knowledge discovery in databases (pp. 437\u2013452). Berlin: Springer."},{"key":"5792_CR28","doi-asserted-by":"crossref","unstructured":"Murata, T., & Moriyasu, S. (2007). Link prediction of social networks based on weighted proximity measures. In International conference on web intelligence (pp. 85\u201388). IEEE.","DOI":"10.1109\/WI.2007.52"},{"key":"5792_CR29","doi-asserted-by":"crossref","unstructured":"Ngonmang, B., Viennet, E., & Tchuente, M. (2012). Churn prediction in a real online social network using local community analysis. In Proceedings of the 2012 international conference on advances in social networks analysis and mining (ASONAM 2012) (pp. 282\u2013288). IEEE Computer Society.","DOI":"10.1109\/ASONAM.2012.55"},{"key":"5792_CR30","first-page":"42","volume":"290","author":"M Pavlov","year":"2007","unstructured":"Pavlov, M., & Ichise, R. (2007). Finding experts by link prediction in co-authorship networks. FEWS, 290, 42\u201355.","journal-title":"FEWS"},{"key":"5792_CR31","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"5792_CR32","doi-asserted-by":"crossref","unstructured":"Pujari, M., & Kanawati, R. (2012). Supervised rank aggregation approach for link prediction in complex networks. In Proceedings of the 21st international conference companion on world wide web (pp. 1189\u20131196). ACM.","DOI":"10.1145\/2187980.2188260"},{"issue":"4","key":"5792_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.socnet.2011.07.002","volume":"33","author":"T Raeder","year":"2011","unstructured":"Raeder, T., Lizardo, O., Hachen, D., & Chawla, N. V. (2011). Predictors of short-term decay of cell phone contacts in a large scale communication network. Social Networks, 33(4), 245\u2013257.","journal-title":"Social Networks"},{"key":"5792_CR34","doi-asserted-by":"crossref","unstructured":"Scellato, S., Noulas, A., & Mascolo, C. (2011). Exploiting place features in link prediction on location-based social networks. In Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1046\u20131054). ACM.","DOI":"10.1145\/2020408.2020575"},{"key":"5792_CR35","unstructured":"Sculley, D. (2007). Rank aggregation for similar items. In Proceedings of the 2007 SIAM international conference on data mining (pp. 587\u2013592). Philadelphia: SIAM."},{"key":"5792_CR36","doi-asserted-by":"crossref","unstructured":"Subbian, K., & Melville, P. (2011). Supervised rank aggregation for predicting influencers in Twitter. In Privacy, security, risk and trust (PASSAT) and 2011 IEEE third international conference on social computing (SocialCom), 2011 IEEE third international conference on (pp. 661\u2013665). IEEE.","DOI":"10.1109\/PASSAT\/SocialCom.2011.167"},{"key":"5792_CR37","doi-asserted-by":"crossref","unstructured":"Tylenda, T., Angelova, R., & Bedathur, S. (2009). Towards time-aware link prediction in evolving social networks. In Proceedings of the 3rd workshop on social network mining and analysis (p. 9). ACM.","DOI":"10.1145\/1731011.1731020"},{"key":"5792_CR38","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009). On the evolution of user interaction in Facebook. In Proceedings of the 2nd ACM SIGCOMM workshop on social networks (WOSN\u201909).","DOI":"10.1145\/1592665.1592675"},{"issue":"3","key":"5792_CR39","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s10115-014-0789-0","volume":"45","author":"Y Yang","year":"2015","unstructured":"Yang, Y., Lichtenwalter, R. N., & Chawla, N. V. (2015). Evaluating link prediction methods. Knowledge and Information Systems, 45(3), 751\u2013782.","journal-title":"Knowledge and Information Systems"},{"issue":"4","key":"5792_CR40","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou, T., L\u00fc, L., & Zhang, Y. C. (2009). Predicting missing links via local information. The European Physical Journal B, 71(4), 623\u2013630.","journal-title":"The European Physical Journal B"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05792-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05792-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05792-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T01:12:13Z","timestamp":1584580333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05792-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,19]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["5792"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05792-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,19]]},"assertion":[{"value":"13 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}