An algorithm for expert finding in areas based on Lattes’ curriculum
DOI:
https://doi.org/10.19132/1808-5245212.119-139Keywords:
Expert finding. Lattes’ Curriculum. Social Network Analysis. Information retrieval.Abstract
This paper proposes to formulate an algorithm made for building a ranking of experts based on Lattes’ curriculum data base. For this purpose, it was developed an algorithm based in three processing stages: Score Alfa, which analyzes the titles of documents based on ontology established to define the issues and priority of these subjects for each publication; Score Beta, that analyzes the publications’ quality using concepts defined by CAPES to benefit productions that are published in most important vehicles; and Score Propagated, which examines the importance of being well connected to other specialist researchers, spreading the knowledge gained through this contact. In order to validate the accuracy of the algorithm, it was used the actual data of the Nanotechnology’s area.Downloads
References
ALUISIO, S. M. et al. Desenvolvimento de uma estrutura conceitual (ontologia) para área de nanociência e nanotecnologia. 2005. Relatório Científico. Instituto de Ciências Matemáticas e de Computação (ICMC), Universidade de São Paulo, São Carlos, 2005.
BAEZA-YATES, R.; RIBEIRO NETO, B. Modern Information Retrieval. New York: ACM Press, 1999.
BALOG, K. et al. Formal models for expert finding in enterprise corpora. In: ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 29., 2006, Seatle, USA, Proceedings… Seatle, 2006. p. 43-50.
BRASIL. Ministério da Ciência, Tecnologia e Inovação. Portal da inovação. Disponível em: <http://www.portalinovacao.mct.gov.br/>. Acesso em: 10 jan. 2013.
BRIN, S.; PAGE, L. The anatomy of a large-scale hypertextual web search engine. In: INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW’98), 7., 1998, Brisbane, Australia, Proceedings… Brisbane, 1998. p. 107-117.
CAMPBELL, C.S. et al. Expertise identification using email communications. In: INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 12., 2003, New Orleans, USA. Proceedings… New Orleans, 2003.
DIGIAMPIETRI, L. A. et al. Minerando e caracterizando dados de currículos lattes. In: BRAZILIAN WORKSHOP ON SOCIAL NETWORK ANALYSIS AND MINING (BRASNAM), 2., 2012, Curitiba. Proceedings… Curitiba, 2012.
DIGIAMPIETRI, L. A. et al. BraX-Ray: an X-Ray of the Brazilian Computer Science Graduate Programs. PLoS ONE, v. 9, n. 4, p. e94541, 2014.
DOM, B. et al. Graph-based ranking algorithms for e-mail expertise analysis. In: ACM SIGMOD WORKSHOP ON RESEARCH ISSUES IN DATA MINING AND KNOWLEDGE DISCOVERY, 8., 2003, San Diego, USA. Proceedings… San Diego, 2003. p. 42-48.
FREITAS, C. M. D. S. et al. Extração de conhecimento e análise visual de redes sociais. In: SEMINÁRIO INTEGRADO DE SOFTWARE E HARDWARE (SEMISH), 33., 2008, Belém. Proceedings… Belém, 2008. p. 108.
HAN, J.; KAMBER, M. Data mining: concepts and techniques. Burlington: Morgan Kaufmann, 2001.
JANEV, V. et al. Semantic web based integration of knowledge resources for expertise finding. International Journal of Enterprise Information Systems, Philadelphia, v. 5, n. 4, p. 53-71, 2009.
KLEINBERG, J. M. Authoritative sources in a hyperlinked environment. Journal of the ACM, New York, v. 46, n. 5, p. 604-632, 1999.
KRULWICH, B.; BURKEY, C. Contactfinder agent: answering bulletin board questions with referrals. In: NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, 13., 1996, Portland, USA. Proceedings… Portland, 1996.
LAPPAS, T.; LIU, K.; TERZI, E. A survey of algorithms and systems for expert location in social networks. In: AGGARWAL, C. C. (Org.). Social network data analytics. Berlin: Springer Verlag, 2011. p. 215-241.
MARROCCO, C. et al. A linear combination of classifiers via rank margin maximization. In: JOINT IAPR INTERNATIONAL CONFERENCE ON STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, 20., 2010, Cesme, Turkey. Proceedings… Cesme, 2010. p. 650-659.
MAYBURY, M. T. Expert finding systems. Nov. 2006. Technical paper, The MITRE Corporation. p. 1-35. Disponível em: <http://www.mitre.org/publications/technical-papers/expert-finding-systems>. Acesso em: 10 jan. 2013.
PAGE, L. et al. The pagerank citation ranking: bringing order to the web. 1998. Technical Report Computer Science. Stanford: University of Stanford, 1998.
SALTON, G.; MCGILL, M. J. Introduction to modern information retrieval. New York: McGraw-Hill, 1983.
STAAB, S.; STUDER, R. (Org.). Handbook on ontologies. 2. ed. Berlin: Springer Verlag, 2009.
STANKOVIC, M. Open innovation and semantic web: problem solver search on linked data. In: INTERNATIONAL SEMANTIC WEB CONFERENCE (ISWC), 7., 2010, Shanghai, China. Proceedings… Shanghai, 2010.
TAX, D.M.J. et al. Comparison between product and mean classifier combination rules. In: WORKSHOP ON STATISTICAL PATTERN RECOGNITION, 1., 1997, Prague, Czech Republic. Proceedings… Prague, 1997.
WANG, L. et al. A cascade ranking model for efficient ranked retrieval. In: INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 34., 2011, Beijing, China, Proceedings… Beijing, 2011. p. 105-114.
WANG, G. A. et al. Expertrank: a topic-aware expert finding algorithm for online knowledge communities. Decision Support Systems, Amsterdam, v. 54, p. 1442-1445, 2013.
WU, S. Linear combination of component results in information retrieval. Data & Knowledge Engineering, Amsterdam, v. 71, n. 1, p. 114-126, 2011.
ZHANG, J. et al. Expert finding in a social network. In: INTERNATIONAL CONFERENCE ON DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA) 12., 2007, Bangkok, Thailand. Proceedings… Berlin: Springer, 2007, p. 1066-1069.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Fellipe de Melo Chagas, José de Jésus Pérez-Alcázar, Luciano Antonio Digiampietri
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
Authors will keep their copyright and grant the journal with the right of first publication, the work licensed under License Creative Commons Attribution (CC BY 4.0), which allows for the sharing of work and the recognition of authorship.
Authors can take on additional contracts separately for non-exclusive distribution of the version of the work published in this journal, such as publishing in an institutional repository, acknowledging its initial publication in this journal.
The articles are open access and free. In accordance with the license, you must give appropriate credit, provide a link to the license, and indicate if changes were made. You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
