Article Brapci-Autoridades

Algoritmo de classificação de especialistas em áreas na base de currículos Lattes

An algorithm for expert finding in areas based on Lattes’ curriculum

Fellipe de Melo Chagas
José de Jésus Pérez-Alcázar
Luciano Antonio Digiampietri

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.@en

Este trabalho propõe um algoritmo para construir um ranking de especialistas na base de currículos Lattes. Para isto, foi elaborado um algoritmo composto por três estágios de processamento: Score Alfa, que analisa os títulos dos documentos baseado na ontologia definida para selecionar os assuntos e importâncias destes assuntos para cada publicação; Score Beta, que analisa a qualidade das publicações utilizando conceitos definidos pela CAPES para beneficiar produções publicadas em veículos mais importantes; e Score Propagated, que analisa a importância de estar bem conectado a demais pesquisadores especialistas propagando o conhecimento obtido. Para o teste de precisão do algoritmo, utilizaram-se dados reais da área de Nanotecnologia.@pt

. An algorithm for expert finding in areas based on lattes’ curriculum algoritmo de classificação de especialistas em áreas na base de currículos lattes. Em questão, [????].

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: . 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: . 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 and 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.
NLP0.29
Visto 24 vezes
sem referências
Array
(
    [dateOfAvailability] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [2015-09-17] => 8495
                        )

                )

        )

    [hasAuthor] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [Fellipe de Melo Chagas] => 10549
                        )

                    [1] => Array
                        (
                            [José de Jésus Pérez-Alcázar] => 10550
                        )

                    [2] => Array
                        (
                            [Luciano Antonio Digiampietri] => 10551
                        )

                )

        )

    [hasFileStorage] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [_repository/47/2018/09/oai_seer_ufrgs_br_article_52652#00002.pdf] => 46949
                        )

                )

        )

    [hasPageEnd] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [139] => 491
                        )

                )

        )

    [hasPageStart] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [119] => 1663
                        )

                )

        )

    [hasSectionOf] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [Artigo] => 3
                        )

                )

        )

    [hasSubject] => Array
        (
            [en] => Array
                (
                    [0] => Array
                        (
                            [Expert finding] => 10545
                        )

                    [1] => Array
                        (
                            [Lattes’ curriculum] => 10546
                        )

                    [2] => Array
                        (
                            [Social network analysis] => 267633
                        )

                    [3] => Array
                        (
                            [Information retrieval] => 227532
                        )

                    [4] => Array
                        (
                            [Lattes’ curriculum] => 267700
                        )

                    [5] => Array
                        (
                            [Information retrieval] => 298771
                        )

                )

            [pt] => Array
                (
                    [0] => Array
                        (
                            [Ciëncia social aplicada] => 2102
                        )

                    [1] => Array
                        (
                            [Ciência da informação] => 237157
                        )

                    [2] => Array
                        (
                            [Localização de especialista] => 10547
                        )

                    [3] => Array
                        (
                            [Currículo latte] => 10548
                        )

                    [4] => Array
                        (
                            [Análise de rede social] => 280049
                        )

                    [5] => Array
                        (
                            [Recuperação da informação] => 261956
                        )

                    [6] => Array
                        (
                            [Localização de especialistas] => 267698
                        )

                    [7] => Array
                        (
                            [Currículos lattes] => 267699
                        )

                    [8] => Array
                        (
                            [Análise de redes sociais] => 234525
                        )

                )

        )

    [wasPublicationInDate] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [2015-09-17] => 267627
                        )

                )

        )

    [hasLanguageExpression] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [pt] => 232736
                        )

                )

        )

    [hasLicense] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [Copyright (c)] => 232755
                        )

                    [1] => Array
                        (
                            [CCBY4.0] => 232756
                        )

                )

        )

    [isPartOfSource] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [Em questão] => 47
                        )

                )

        )

    [hasIssueOf] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [ISSUE:JNL:00002-2015-21-2] => 8493
                        )

                )

        )

    [hasAbstract] => Array
        (
            [en] => Array
                (
                    [0] => Array
                        (
                            [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.] => 0
                        )

                    [1] => Array
                        (
                            [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.] => 0
                        )

                )

            [pt] => Array
                (
                    [0] => Array
                        (
                            [Este trabalho propõe um algoritmo para construir um ranking de especialistas na base de currículos Lattes. Para isto, foi elaborado um algoritmo composto por três estágios de processamento: Score Alfa, que analisa os títulos dos documentos baseado na ontologia definida para selecionar os assuntos e importâncias destes assuntos para cada publicação; Score Beta, que analisa a qualidade das publicações utilizando conceitos definidos pela CAPES para beneficiar produções publicadas em veículos mais importantes; e Score Propagated, que analisa a importância de estar bem conectado a demais pesquisadores especialistas propagando o conhecimento obtido. Para o teste de precisão do algoritmo, utilizaram-se dados reais da área de Nanotecnologia.] => 0
                        )

                )

        )

    [hasID] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [oai:seer.ufrgs.br:article/52652] => 0
                        )

                )

        )

    [hasRegisterId] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [http://seer.ufrgs.br/EmQuestao/article/view/52652] => 0
                        )

                    [1] => Array
                        (
                            [10.19132/1808-5245212.119-139] => 0
                        )

                    [2] => Array
                        (
                            [https://seer.ufrgs.br/EmQuestao/article/view/52652] => 0
                        )

                )

        )

    [hasSource] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [Em Questão; v.21, n.2, mai./ago. 2015; 119-139] => 0
                        )

                    [1] => Array
                        (
                            [1808-5245] => 0
                        )

                )

            [nn] => Array
                (
                    [0] => Array
                        (
                            [1807-8893] => 0
                        )

                )

        )

    [hasTitle] => Array
        (
            [en] => Array
                (
                    [0] => Array
                        (
                            [An algorithm for expert finding in areas based on Lattes’ curriculum] => 0
                        )

                    [1] => Array
                        (
                            [An algorithm for expert finding in areas based on Lattes’ curriculum] => 0
                        )

                )

            [pt] => Array
                (
                    [0] => Array
                        (
                            [Algoritmo de classificação de especialistas em áreas na base de currículos Lattes] => 0
                        )

                )

        )

    [hasUrl] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [http://seer.ufrgs.br/EmQuestao/article/view/52652/34063] => 0
                        )

                    [1] => Array
                        (
                            [https://seer.ufrgs.br/EmQuestao/article/view/52652/34063] => 0
                        )

                )

            [nn] => Array
                (
                    [0] => Array
                        (
                            [https://seer.ufrgs.br/index.php/EmQuestao/article/view/52652] => 0
                        )

                    [1] => Array
                        (
                            [https://seer.ufrgs.br/index.php/EmQuestao/article/view/52652/34063] => 0
                        )

                )

        )

    [prefLabel] => Array
        (
            [pt] => Array
                (
                    [0] => Array
                        (
                            [Oai:seer.ufrgs.br:article/52652#00002] => 0
                        )

                )

        )

    [hasDOI] => Array
        (
            [nn] => Array
                (
                    [0] => Array
                        (
                            [10.19132/1808-5245212.119-139] => 0
                        )

                )

        )

)