{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:29:02Z","timestamp":1780421342960,"version":"3.54.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T00:00:00Z","timestamp":1508889600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["307647\/2012-9"],"award-info":[{"award-number":["307647\/2012-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"crossref","award":["Student Scholarship"],"award-info":[{"award-number":["Student Scholarship"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10115-017-1121-6","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T03:18:09Z","timestamp":1508901489000},"page":"85-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Automatic feature selection for supervised learning in link prediction applications: a comparative study"],"prefix":"10.1007","volume":"56","author":[{"given":"Antonio","family":"Pecli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria Claudia","family":"Cavalcanti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronaldo","family":"Goldschmidt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,10,25]]},"reference":[{"key":"1121_CR1","doi-asserted-by":"crossref","unstructured":"Adafre SF, de Rijke M (2005) Discovering missing links in Wikipedia. In: Proceedings of the 3rd international workshop on Link discovery. ACM, pp 90\u201397","DOI":"10.1145\/1134271.1134284"},{"issue":"3","key":"1121_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"key":"1121_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: VLDB\u201994, Proceedings of 20th international conference on very large data bases, Santiago de Chile, Chile, 12\u201315 September 1994, pp 487\u2013499"},{"key":"1121_CR4","doi-asserted-by":"publisher","unstructured":"Aha D, Bankert R (1996) A comparative evaluation of sequential feature selection algorithms. In: Fisher D, Lenz H-J (eds) Learning from data, volume 112 of Lecture Notes in Statistics. Springer, New York, pp 199\u2013206. doi: 10.1007\/978-1-4612-2404-4-19","DOI":"10.1007\/978-1-4612-2404-4-19"},{"key":"1121_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2180861.2180866","volume":"6","author":"LM Aiello","year":"2012","unstructured":"Aiello LM, Barrat A, Schifanella R, Cattuto C, Markines B, Menczer F (2012) Friendship prediction and homophily in social media. TWEB 6:9. doi: 10.1145\/2180861.2180866","journal-title":"TWEB"},{"key":"1121_CR6","first-page":"1981","volume":"9","author":"EM Airoldi","year":"2008","unstructured":"Airoldi EM, Blei DM, Fienberg SE, Xing EP (2008) Mixed membership stochastic blockmodels. J Mach Learn Res 9:1981\u20132014","journal-title":"J Mach Learn Res"},{"key":"1121_CR7","unstructured":"Airoldi EM, Blei DM, Fienberg SE, Xing EP, Jaakkola T (2006) Mixed membership stochastic block models for relational data with application to protein\u2013protein interactions. In: Proceedings of the international biometrics society annual meeting, pp 1\u201334"},{"key":"1121_CR8","doi-asserted-by":"publisher","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 WSDM \u201911. ACM, New York, NY, USA, pp 635\u2013644. doi: 10.1145\/1935826.1935914","DOI":"10.1145\/1935826.1935914"},{"key":"1121_CR9","first-page":"211","volume":"25","author":"AL Barabasi","year":"2001","unstructured":"Barabasi AL, Jeong H, Neda Z, Ravasz E (2001) Evolution of the social network of scientific collaboration. Soc Netw 25:211\u2013230","journal-title":"Soc Netw"},{"key":"1121_CR10","unstructured":"Batagelj V, Zaversnik M (2003) An O(m) algorithm for cores decomposition of networks. CoRR, cs.DS\/0310049"},{"key":"1121_CR11","doi-asserted-by":"crossref","unstructured":"Benzi M, Estrada E, Klymko C (2012) Ranking hubs and authorities using matrix functions. CoRR","DOI":"10.1016\/j.laa.2012.10.022"},{"key":"1121_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0378-8733(01)00038-7","volume":"23","author":"P Bonacich","year":"2001","unstructured":"Bonacich P, Lloyd P (2001) Eigenvector-like measures of centrality for asymmetric relations. Soc Netw 23:191\u2013201. doi: 10.1016\/S0378-8733(01)00038-7","journal-title":"Soc Netw"},{"key":"1121_CR13","doi-asserted-by":"publisher","unstructured":"Caruana R, Karampatziakis N, Yessenalina A (2008) An empirical evaluation of supervised learning in high dimensions. In: Proceedings of the twenty-fifth international conference machine learning (ICML 2008), Helsinki, Finland, 5\u20139 June 2008, pp. 96\u2013103. doi: 10.1145\/1390156.1390169","DOI":"10.1145\/1390156.1390169"},{"key":"1121_CR14","doi-asserted-by":"publisher","unstructured":"Dash M, Liu H (2007) Dimensionality reduction. In: Wiley Encyclopedia of Computer Science and Engineering. Wiley, Hoboken. doi: 10.1002\/9780470050118.ecse112","DOI":"10.1002\/9780470050118.ecse112"},{"key":"1121_CR15","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"1121_CR16","doi-asserted-by":"crossref","unstructured":"Dong Y, Tang J, Wu S, Tian J, Chawla NV, Rao J, Cao H (2012) Link prediction and recommendation across heterogeneous social networks. In: 2012 IEEE 12th international conference on data mining (ICDM). IEEE, pp 181\u2013190","DOI":"10.1109\/ICDM.2012.140"},{"key":"1121_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","volume":"19","author":"AK Elmagarmid","year":"2007","unstructured":"Elmagarmid AK, Ipeirotis PG, Verykios VS (2007) Duplicate record detection: a survey. IEEE Trans Knowl Data Eng 19:1\u201316. doi: 10.1109\/TKDE.2007.250581","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1121_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199591756.001.0001","volume-title":"The structure of complex networks: theory and applications","author":"E Estrada","year":"2011","unstructured":"Estrada E (2011) The structure of complex networks: theory and applications. Oxford University Press, Inc., New York"},{"key":"1121_CR19","doi-asserted-by":"crossref","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification In: Social Networks, vol 1, Issue 3. Elsevier, Lausanne, pp 215\u2013239","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"1121_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04923-5","volume-title":"Data mining and knowledge discovery with evolutionary algorithms","author":"AA Freitas","year":"2002","unstructured":"Freitas AA (2002) Data mining and knowledge discovery with evolutionary algorithms. Springer-Verlag New York, Inc., Secaucus"},{"key":"1121_CR21","doi-asserted-by":"publisher","unstructured":"Freschi V (2009) A graph-based semi-supervised algorithm for protein function prediction from interaction maps. In: Third international conference learning and intelligent optimization, LION 3, Trento, Italy, 14\u201318 January 2009, Selected Papers, pp 249\u2013258. doi: 10.1007\/978-3-642-11169-3-18","DOI":"10.1007\/978-3-642-11169-3-18"},{"key":"1121_CR22","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32:675\u2013701","journal-title":"J Am Stat Assoc"},{"key":"1121_CR23","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using networkX. In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th Python in Science Conference. Pasadena, pp 11\u201315","DOI":"10.25080\/TCWV9851"},{"key":"1121_CR24","doi-asserted-by":"publisher","unstructured":"Hasan M, Zaki M (2011) A survey of link prediction in social networks. In: Aggarwal CC (ed) Social network data analytics. Springer US, Berlin, pp 243\u2013275. doi: 10.1007\/978-1-4419-8462-3-9","DOI":"10.1007\/978-1-4419-8462-3-9"},{"key":"1121_CR25","unstructured":"Hasan MA, Chaoji V, Salem S, Zaki M (2006) Link prediction using supervised learning. In: Proceedings of SDM 06 workshop on Link Analysis, Counterterrorism and Security"},{"key":"1121_CR26","doi-asserted-by":"crossref","unstructured":"Hsieh C-J, Chiang K-Y, Dhillon IS (2012) Low rank modeling of signed networks. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 507\u2013515","DOI":"10.1145\/2339530.2339612"},{"key":"1121_CR27","doi-asserted-by":"crossref","unstructured":"Huang D, Meyn SP (2012) Feature selection for composite hypothesis testing with small samples: fundamental limits and algorithms. In: ICASSP. IEEE, pp 1917\u20131920","DOI":"10.1109\/ICASSP.2012.6288279"},{"key":"1121_CR28","doi-asserted-by":"publisher","unstructured":"Huang Z, Li X, Chen H (2005) Link prediction approach to collaborative filtering. In: ACM\/IEEE Joint Conference on Digital Libraries, JCDL 2005, Denver, CO, USA, 7\u201311 June 2005, Proceedings, pp 141\u2013142. doi: 10.1145\/1065385.1065415","DOI":"10.1145\/1065385.1065415"},{"key":"1121_CR29","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511763113","volume-title":"Recommender systems: an introduction","author":"D Jannach","year":"2010","unstructured":"Jannach D, Zanker M, Felfernig A, Friedrich G (2010) Recommender systems: an introduction, 1st edn. Cambridge University Press, New York","edition":"1"},{"key":"1121_CR30","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18:39\u201343","journal-title":"Psychometrika"},{"key":"1121_CR31","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97:273\u2013324. doi: 10.1016\/S0004-3702(97)00043-X","journal-title":"Artif Intell"},{"key":"1121_CR32","first-page":"43","volume":"24","author":"VE Krebs","year":"2002","unstructured":"Krebs VE (2002) Mapping networks of terrorist cells. Connections 24:43\u201352","journal-title":"Connections"},{"key":"1121_CR33","doi-asserted-by":"publisher","first-page":"211","DOI":"10.6029\/smartcr.2014.03.007","volume":"4","author":"V Kumar","year":"2014","unstructured":"Kumar V, Minz S (2014) Feature selection: a literature review. Smart CR 4:211\u2013229. doi: 10.6029\/smartcr.2014.03.007","journal-title":"Smart CR"},{"key":"1121_CR34","doi-asserted-by":"publisher","unstructured":"Lee J, Bengio S, Kim S, Lebanon G, Singer Y (2014) Local collaborative ranking. In: Proceedings of the 23rd international conference on World Wide Web WWW \u201914. ACM, New York, NY, USA, pp 85\u201396. doi: 10.1145\/2566486.2567970","DOI":"10.1145\/2566486.2567970"},{"key":"1121_CR35","doi-asserted-by":"publisher","unstructured":"Leicht EA, Holme P, Newman MEJ (2006) Vertex similarity in networks. Phys Rev E. doi: 10.1103\/PhysRevE.73.026120","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"1121_CR36","unstructured":"Leskovec J (2011) Stanford network analysis project. http:\/\/snap.stanford.edu\/data"},{"key":"1121_CR37","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"1121_CR38","doi-asserted-by":"publisher","unstructured":"Li X, Chen H (2009) Recommendation as link prediction: a graph kernel-based machine learning approach. In: Proceedings of the 2009 Joint International Conference on Digital Libraries, JCDL 2009, Austin, TX, USA, 15\u201319 June 2009, pp 213\u2013216. doi: 10.1145\/1555400.1555433","DOI":"10.1145\/1555400.1555433"},{"key":"1121_CR39","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 JM (2007) The link-prediction problem for social networks. JASIST 58:1019\u20131031. doi: 10.1002\/asi.20591","journal-title":"JASIST"},{"key":"1121_CR40","doi-asserted-by":"crossref","unstructured":"Lind PG, Gonzalez MC, Herrmann HJ (2005) Cycles and clustering in bipartite networks. Phys Rev E Stat Nonlin Soft Matter Phys 72(5 Pt 2):056127","DOI":"10.1103\/PhysRevE.72.056127"},{"key":"1121_CR41","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/1345448.1345462","volume":"9","author":"Y Liu","year":"2007","unstructured":"Liu Y, Kou Z (2007) Predicting who rated what in large-scale datasets. SIGKDD Explor 9:62\u201365. doi: 10.1145\/1345448.1345462","journal-title":"SIGKDD Explor"},{"issue":"6","key":"1121_CR42","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2010","unstructured":"L\u00fc L, Zhou T (2010) Link prediction in complex networks: a survey. Physica A 390(6):1150\u20131170","journal-title":"Physica A"},{"key":"1121_CR43","doi-asserted-by":"crossref","first-page":"18001","DOI":"10.1209\/0295-5075\/89\/18001","volume":"89","author":"L L\u00fc","year":"2010","unstructured":"L\u00fc L, Zhou T (2010) Link prediction in weighted networks: the role of weak ties. EPL (Europhys Lett) 89:18001","journal-title":"EPL (Europhys Lett)"},{"key":"1121_CR44","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10588-005-3940-3","volume":"11","author":"B Malin","year":"2005","unstructured":"Malin B, Airoldi E, Carley KM (2005) A network analysis model for disambiguation of names in lists. Comput Math Organ. Theory 11:119\u2013139. doi: 10.1007\/s10588-005-3940-3","journal-title":"Comput Math Organ. Theory"},{"key":"1121_CR45","doi-asserted-by":"publisher","unstructured":"Menon A, Elkan C (2011) Link prediction via matrix factorization. In: Gunopulos D, Hofmann T, Malerba D, Vazirgiannis M (eds) Machine learning and knowledge discovery in databases, volume 6912 of Lecture Notes in Computer Science. Springer, Berlin, pp 437\u2013452. doi: 10.1007\/978-3-642-23783-6-28","DOI":"10.1007\/978-3-642-23783-6-28"},{"key":"1121_CR46","doi-asserted-by":"publisher","first-page":"10402","DOI":"10.1016\/j.eswa.2012.01.202","volume":"39","author":"J Mori","year":"2012","unstructured":"Mori J, Kajikawa Y, Kashima H, Sakata I (2012) Machine learning approach for finding business partners and building reciprocal relationships. Expert Syst Appl 39:10402\u201310407. doi: 10.1016\/j.eswa.2012.01.202","journal-title":"Expert Syst Appl"},{"key":"1121_CR47","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/2020976.2021004","volume":"36","author":"T Ngo","year":"2011","unstructured":"Ngo T (2011) Data mining: practical machine learning tools and technique, third edition by ian h. witten, eibe frank, mark a. hell. ACM SIGSOFT Softw Eng Notes 36:51\u201352. doi: 10.1145\/2020976.2021004","journal-title":"ACM SIGSOFT Softw Eng Notes"},{"key":"1121_CR48","doi-asserted-by":"crossref","unstructured":"Oyama S, Hayashi K, Kashima H (2011) Cross-temporal link prediction. In: IEEE 11th International Conference on Data Mining (ICDM). IEEE, Vancouver, pp 1188\u20131193","DOI":"10.1109\/ICDM.2011.45"},{"key":"1121_CR49","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the Web. Technical Report 1999-66 Stanford InfoLab. Previous number = SIDL-WP-1999-0120"},{"key":"1121_CR50","doi-asserted-by":"crossref","unstructured":"Pecli A, Giovanini B, Pacheco CC, Moreira C, Ferreira F, Tosta F, Tesolin J, Dias MV, Filho S, Cavalcanti MC, Goldschmidt RR (2015) Dimensionality reduction for supervised learning in link prediction problems. In: ICEIS 2015\u2014Proceedings of the 17th international conference on enterprise information systems, vol 1, Barcelona, Spain, 27\u201330 April 2015, pp 295\u2013302","DOI":"10.5220\/0005371802950302"},{"key":"1121_CR51","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Thirion B, Grisel VM, Blondel O, Prettenhofer M, Weiss P, Dubourg R, Vanderplas V, Passos J, Cournapeau A, Brucher D, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"1121_CR52","unstructured":"Pourebrahimi A, Shirazi B, Chamani T (2014) Improving link prediction in social network with population based metaheuristics algorithm. Int J Mechatron Electr Comput Technol 12: 1202\u20131213"},{"key":"1121_CR53","doi-asserted-by":"crossref","unstructured":"Raymond R, Kashima H (2010) Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs. In: Proceedings of the 2010 European Conference on Machine Learning and Knowledge Discovery in Databases: Part III ECML PKDD\u201910. Springer, Berlin, pp 131\u2013147","DOI":"10.1007\/978-3-642-15939-8_9"},{"key":"1121_CR54","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) Bpr: Bayesian personalized ranking from implicit feedback. In: Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence. AUAI Press, pp 452\u2013461"},{"key":"1121_CR55","volume-title":"Statistics: an introduction","author":"AD Rickmers","year":"1967","unstructured":"Rickmers AD, Todd HN (1967) Statistics: an introduction. McGraw-Hill, New York"},{"key":"1121_CR56","doi-asserted-by":"crossref","unstructured":"Saram\u00e4ki J, Kivel\u00e4 M, Onnela J, Kaski K, Kertesz (2007) Generalizations of the clustering coefficient to weighted complex networks. Phys Rev E 75:027105","DOI":"10.1103\/PhysRevE.75.027105"},{"key":"1121_CR57","doi-asserted-by":"publisher","unstructured":"Shi Y, Larson M, Hanjalic A (2010) List-wise learning to rank with matrix factorization for collaborative filtering. In: Proceedings of the fourth ACM Conference on Recommender Systems RecSys \u201910. ACM, New York, NY, USA, pp 269\u2013272. doi: 10.1145\/1864708.1864764","DOI":"10.1145\/1864708.1864764"},{"key":"1121_CR58","doi-asserted-by":"crossref","unstructured":"Song D, Meyer DA (2015) Recommending positive links in signed social networks by optimizing a generalized AUC. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9167"},{"key":"1121_CR59","doi-asserted-by":"publisher","unstructured":"Song D, Meyer DA, Tao D (2015) Efficient latent link recommendation in signed networks. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining KDD \u201915. ACM, New York, NY, USA, pp 1105\u20131114. doi: 10.1145\/2783258.2783358","DOI":"10.1145\/2783258.2783358"},{"key":"1121_CR60","unstructured":"Souza G (2015) Recomendacao em Redes Sociais Baseada em Grafos. Technical Report S2729r Military Institute of Engineering"},{"key":"1121_CR61","doi-asserted-by":"publisher","first-page":"100","DOI":"10.3390\/a6010100","volume":"6","author":"FW Takes","year":"2013","unstructured":"Takes FW, Kosters WA (2013) Computing the eccentricity distribution of large graphs. Algorithms 6:100. doi: 10.3390\/a6010100","journal-title":"Algorithms"},{"key":"1121_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-014-5237-y","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P, Xu B, Wu Y, Zhou X (2015) Link prediction in social networks: the state-of-the-art. SCIENCE China Inf Sci 58:1\u201338. doi: 10.1007\/s11432-014-5237-y","journal-title":"SCIENCE China Inf Sci"},{"key":"1121_CR63","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1:80\u201383. doi: 10.2307\/3001968","journal-title":"Biom Bull"},{"key":"1121_CR64","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1:67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"key":"1121_CR65","doi-asserted-by":"publisher","unstructured":"Wu S, Sun J, Tang J (2013) Patent partner recommendation in enterprise social networks. In: Sixth ACM international conference on Web Search and Data Mining, WSDM 2013, Rome, Italy, 4\u20138 February 2013, pp 43\u201352. doi: 10.1145\/2433396.2433404","DOI":"10.1145\/2433396.2433404"},{"key":"1121_CR66","doi-asserted-by":"crossref","unstructured":"Xu Y, Rockmore D (2012) Feature selection for link prediction. In: Proceedings of the 5th Ph.D. Workshop on Information and Knowledge. ACM, pp 25\u201332","DOI":"10.1145\/2389686.2389692"},{"key":"1121_CR67","doi-asserted-by":"crossref","unstructured":"Yang Y, Lichtenwalter RN, Chawla NV (2015) Evaluating link prediction methods. CoRR, abs\/1505.04094","DOI":"10.1007\/s10115-014-0789-0"},{"key":"1121_CR68","unstructured":"Yu L, Liu H (2003) Feature selection for high-dimensional data: A fast correlation-based filter solution. In: Proceedings of the twentieth international conference machine learning (ICML 2003), 21\u201324 August 2003, Washington, DC, USA, pp 856\u2013863"},{"key":"1121_CR69","doi-asserted-by":"publisher","unstructured":"Zhu J, Hong J, Hughes JG (2002) Using Markov models for web site link prediction. In: HYPERTEXT 2002, Proceedings of the 13th ACM conference on hypertext and hypermedia, 11\u201315 June 2002, University of Maryland, College Park, MD, USA, pp 169\u2013170. doi: 10.1145\/513338.513381","DOI":"10.1145\/513338.513381"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1121-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1121-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1121-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T18:38:39Z","timestamp":1750963119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1121-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,25]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1121"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1121-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,25]]}}}