{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:06:46Z","timestamp":1760710006656,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Evaluating scientists based on their scientific production is a controversial topic. Nevertheless, bibliometrics and algorithmic approaches can assist traditional peer review in numerous tasks, such as attributing research grants, deciding scientific committees, or choosing faculty promotions. Traditional bibliometrics rank individual entities (e.g., researchers, journals, faculties) without looking at the whole data (i.e., the whole network). Network algorithms, such as PageRank, have been used to measure node importance in a network, and have been applied to author ranking. However, traditional PageRank only uses network topology and ignores relevant features of scientific collaborations. Multiple extensions of PageRank have been proposed, more suited for author ranking. These methods enrich the network with information about the author\u2019s productivity or the venue and year of the publication\/citation. Most state-of-the-art (STOA) feature-enriched methods either ignore or do not combine effectively this information. Furthermore, STOA algorithms typically disregard that the full network is not known for most real-world cases.Here we describe OTARIOS, an author ranking method recently developed by us, which combines multiple publication\/citation criteria (i.e., features) to evaluate authors. OTARIOS divides the original network into two subnetworks,<jats:italic>insiders<\/jats:italic>and<jats:italic>outsiders<\/jats:italic>, which is an adequate representation of citation networks with missing information. We evaluate OTARIOS on a set of five real networks, each with publications in distinct areas of Computer Science, and compare it against STOA methods. When matching OTARIOS\u2019 produced ranking with a ground-truth ranking (comprised of best paper award nominations), we observe that OTARIOS is &gt;30<jats:italic>%<\/jats:italic>more accurate than traditional PageRank (i.e., topology based method) and &gt;20<jats:italic>%<\/jats:italic>more accurate than STOA (i.e., competing feature enriched methods). We obtain the best results when OTARIOS considers (i) the author\u2019s publication volume and publication recency, (ii) how recently the author\u2019s work is being cited by outsiders, and (iii) how recently the author\u2019s work is being cited by insiders and how individual he is. Our results showcase (a) the importance of efficiently combining relevant features and (b) how to adequately perform author ranking in incomplete networks.<\/jats:p>","DOI":"10.1007\/s41109-019-0182-8","type":"journal-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T13:02:41Z","timestamp":1569243761000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Feature-enriched author ranking in incomplete networks"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0239-2744","authenticated-orcid":false,"given":"Jorge","family":"Silva","sequence":"first","affiliation":[]},{"given":"David","family":"Apar\u00edcio","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"unstructured":"BV, E (2018) Research Metrics Guidebook. Elvesier.","key":"182_CR1"},{"issue":"2","key":"182_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1002\/asi.21452","volume":"62","author":"Ying Ding","year":"2010","unstructured":"Ding, Y (2009) J Am Soc Inf Sci Technol 62(2):236\u2013245. https:\/\/doi.org\/10.1002\/asi.21452 . http:\/\/arxiv.org\/abs\/https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/asi.21452 .","journal-title":"Journal of the American Society for Information Science and Technology"},{"doi-asserted-by":"crossref","unstructured":"Dunaiski, M, Visser W (2012) Comparing paper ranking algorithms In: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, 21\u201330.. ACM.","key":"182_CR3","DOI":"10.1145\/2389836.2389840"},{"issue":"46","key":"182_CR4","doi-asserted-by":"publisher","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch, JE (2005) An index to quantify an individual\u2019s scientific research output. Proc Natl Acad Sci 102(46):16569\u201316572.","journal-title":"Proc Natl Acad Sci"},{"doi-asserted-by":"crossref","unstructured":"Hwang, W-S, Chae S-M, Kim S-W, Woo G (2010) Yet another paper ranking algorithm advocating recent publications In: Proceedings of the 19th International Conference on World Wide Web, 1117\u20131118.. ACM.","key":"182_CR5","DOI":"10.1145\/1772690.1772832"},{"issue":"1","key":"182_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.jpsychores.2014.11.008","volume":"78","author":"JP Ioannidis","year":"2015","unstructured":"Ioannidis, JP (2015) A generalized view of self-citation: Direct, co-author, collaborative, and coercive induced self-citation. J Psychosom Res 78(1):7\u201311.","journal-title":"J Psychosom Res"},{"issue":"4","key":"182_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K, Kek\u00e4l\u00e4inen J (2002) Cumulated gain-based evaluation of ir techniques. ACM Trans Inf Syst (TOIS) 20(4):422\u2013446.","journal-title":"ACM Trans Inf Syst (TOIS)"},{"doi-asserted-by":"crossref","unstructured":"Kim, M, Leskovec J (2011) The network completion problem: Inferring missing nodes and edges in networks In: Proceedings of the 2011 SIAM International Conference on Data Mining, 47\u201358.. SIAM.","key":"182_CR8","DOI":"10.1137\/1.9781611972818.5"},{"unstructured":"Page, L, Brin S, Motwani R, Winograd T, et al. (1998) The pagerank citation ranking: Bringing order to the web.","key":"182_CR9"},{"issue":"5","key":"182_CR10","doi-asserted-by":"publisher","first-page":"056103","DOI":"10.1103\/PhysRevE.80.056103","volume":"80","author":"F Radicchi","year":"2009","unstructured":"Radicchi, F, Fortunato S, Markines B, Vespignani A (2009) Diffusion of scientific credits and the ranking of scientists. Phys Rev E 80(5):056103.","journal-title":"Phys Rev E"},{"issue":"12","key":"182_CR11","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1016\/j.jss.2006.01.011","volume":"79","author":"A Sidiropoulos","year":"2006","unstructured":"Sidiropoulos, A, Manolopoulos Y (2006) Generalized comparison of graph-based ranking algorithms for publications and authors. J Syst Softw 79(12):1679\u20131700.","journal-title":"J Syst Softw"},{"doi-asserted-by":"crossref","unstructured":"Silva, J, Apar\u00edcio D, Silva F (2018) Otarios: Optimizing author ranking with insiders\/outsiders subnetworks In: International Workshop on Complex Networks and Their Applications, 143\u2013154.. Springer.","key":"182_CR12","DOI":"10.1007\/978-3-030-05411-3_12"},{"doi-asserted-by":"crossref","unstructured":"Tang, J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: Extraction and mining of academic social networks In: KDD\u201908, 990\u2013998.","key":"182_CR13","DOI":"10.1145\/1401890.1402008"},{"unstructured":"Tang, J, Zhang J, Yao L, Li J, Zhang L, Su Z (2017) Citation Network Dataset. https:\/\/aminer.org\/citation . Accessed 14 Sept 2018.","key":"182_CR14"},{"issue":"1","key":"182_CR15","first-page":"16","volume":"28","author":"TW Valente","year":"2008","unstructured":"Valente, TW, Coronges K, Lakon C, Costenbader E (2008) How correlated are network centrality measures?Connect (Tor Ont) 28(1):16.","journal-title":"Connect (Tor Ont)"},{"issue":"2","key":"182_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.joi.2014.01.012","volume":"8","author":"ES Vieira","year":"2014","unstructured":"Vieira, ES, Cabral JA, Gomes JA (2014) How good is a model based on bibliometric indicators in predicting the final decisions made by peers?J Informetrics 8(2):390\u2013405.","journal-title":"J Informetrics"},{"doi-asserted-by":"crossref","unstructured":"Voorhees, EM, et al. (1999) The trec-8 question answering track report In: Trec, 77\u201382.. Citeseer.","key":"182_CR17","DOI":"10.6028\/NIST.SP.500-246.qa-overview"},{"issue":"2","key":"182_CR18","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/s11192-016-2057-4","volume":"109","author":"H Wang","year":"2016","unstructured":"Wang, H, Shen H-W, Cheng X-Q (2016) Scientific credit diffusion: Researcher level or paper level?Scientometrics 109(2):827\u2013837.","journal-title":"Scientometrics"},{"issue":"4","key":"182_CR19","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1002\/asi.22790","volume":"64","author":"JD West","year":"2013","unstructured":"West, JD, Jensen MC, Dandrea RJ, Gordon GJ, Bergstrom CT (2013) Author-level eigenfactor metrics: Evaluating the influence of authors, institutions, and countries within the social science research network community. J Am Soc Inf Sci Technol 64(4):787\u2013801.","journal-title":"J Am Soc Inf Sci Technol"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0182-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41109-019-0182-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-019-0182-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T21:51:20Z","timestamp":1721771480000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-019-0182-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,23]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["182"],"URL":"https:\/\/doi.org\/10.1007\/s41109-019-0182-8","relation":{},"ISSN":["2364-8228"],"issn-type":[{"type":"electronic","value":"2364-8228"}],"subject":[],"published":{"date-parts":[[2019,9,23]]},"assertion":[{"value":"28 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"74"}}