Random walks on the reputation graph

Detalhes bibliográficos
Autor(a) principal: Sabir Ribas
Data de Publicação: 2017
Tipo de documento: Tese
Idioma: por
Título da fonte: Repositório Institucional da UFMG
Texto Completo: http://hdl.handle.net/1843/31006
Resumo: The identification of reputable entities is an important task in business, education, and in many other fields. In general, the reputation of an entity reflects its public perception, which touches upon a variety of aspects that may impact the identity of the entity, such as its prowess, integrity, and trustworthiness. Indeed, more reputable entities are presumably a better fit for most purposes. Thus, while reputation is a widespread notion in society, it is albeit an arguably ill-defined one. As a consequence, quantifyingreputationischallenging. Indeed, existingattemptstoquantifyreputation rely on either manual assessments or on a restrictive definition of reputation. Inthisthesis,insteadofrelyingonasingleandprecisedefinitionofreputation,we proposetoexploitthetransference ofreputationamongentitiesinordertoidentifythe most reputable ones. To this end, we introduce a conceptual framework of reputation flowsandproposeametricbasedonit, whichwecallP-score. Thisframeworkconsists of a random walk model that allows inferring the reputation of a target set of entities with respect to suitable sources of reputation. By using it, we can better understand how reputation flows between distinct entities in a reputation graph. Weinstantiateourmodelinanacademicsearchsettingtoaddressthreecommon ranking tasks namely, research group ranking, author ranking, and publication venue ranking. By relying on publishing behavior as a reputation signal, we demonstrate the effectiveness of our model in contrast to standard citation-based approaches for identifying reputable venues, authors, and research groups in the broad area of Computer Science. In addition, we demonstrate the robustness of our model to perturbations in the selection of reputation sources. Finally, we show that effective reputation sources can be chosen via the proposed model itself in a fully automatic fashion.
id UFMG_6962a07f9f04b44cd2c379ea931b2512
oai_identifier_str oai:repositorio.ufmg.br:1843/31006
network_acronym_str UFMG
network_name_str Repositório Institucional da UFMG
repository_id_str
spelling Berthier Ribeiro-Netohttp://lattes.cnpq.br/5461069167314414Nivio ZivianiAltigran Soares da SilvaEdmundo Albuquerque Souza e SilvaRodrygo Luis Teodoro Santoshttp://lattes.cnpq.br/5070120158504459Sabir Ribas2019-11-18T15:24:33Z2019-11-18T15:24:33Z2017-04-06http://hdl.handle.net/1843/31006The identification of reputable entities is an important task in business, education, and in many other fields. In general, the reputation of an entity reflects its public perception, which touches upon a variety of aspects that may impact the identity of the entity, such as its prowess, integrity, and trustworthiness. Indeed, more reputable entities are presumably a better fit for most purposes. Thus, while reputation is a widespread notion in society, it is albeit an arguably ill-defined one. As a consequence, quantifyingreputationischallenging. Indeed, existingattemptstoquantifyreputation rely on either manual assessments or on a restrictive definition of reputation. Inthisthesis,insteadofrelyingonasingleandprecisedefinitionofreputation,we proposetoexploitthetransference ofreputationamongentitiesinordertoidentifythe most reputable ones. To this end, we introduce a conceptual framework of reputation flowsandproposeametricbasedonit, whichwecallP-score. Thisframeworkconsists of a random walk model that allows inferring the reputation of a target set of entities with respect to suitable sources of reputation. By using it, we can better understand how reputation flows between distinct entities in a reputation graph. Weinstantiateourmodelinanacademicsearchsettingtoaddressthreecommon ranking tasks namely, research group ranking, author ranking, and publication venue ranking. By relying on publishing behavior as a reputation signal, we demonstrate the effectiveness of our model in contrast to standard citation-based approaches for identifying reputable venues, authors, and research groups in the broad area of Computer Science. In addition, we demonstrate the robustness of our model to perturbations in the selection of reputation sources. Finally, we show that effective reputation sources can be chosen via the proposed model itself in a fully automatic fashion.porUniversidade Federal de Minas GeraisPrograma de Pós-Graduação em Ciência da ComputaçãoUFMGBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃORandom walks on the reputation graphRandom walks on the reputation graphinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFMGinstname:Universidade Federal de Minas Gerais (UFMG)instacron:UFMGORIGINALSabirRibas.pdfSabirRibas.pdfAbertoapplication/pdf1682124https://repositorio.ufmg.br/bitstream/1843/31006/1/SabirRibas.pdf543016a5ea2e182c8efd412d2fb2c06eMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-82119https://repositorio.ufmg.br/bitstream/1843/31006/2/license.txt34badce4be7e31e3adb4575ae96af679MD52TEXTSabirRibas.pdf.txtSabirRibas.pdf.txtExtracted texttext/plain218102https://repositorio.ufmg.br/bitstream/1843/31006/3/SabirRibas.pdf.txt7bebeb1bfa2740b8741ed6befef77701MD531843/310062019-11-19 03:27:13.52oai:repositorio.ufmg.br:1843/31006TElDRU7Dh0EgREUgRElTVFJJQlVJw4fDg08gTsODTy1FWENMVVNJVkEgRE8gUkVQT1NJVMOTUklPIElOU1RJVFVDSU9OQUwgREEgVUZNRwoKQ29tIGEgYXByZXNlbnRhw6fDo28gZGVzdGEgbGljZW7Dp2EsIHZvY8OqIChvIGF1dG9yIChlcykgb3UgbyB0aXR1bGFyIGRvcyBkaXJlaXRvcyBkZSBhdXRvcikgY29uY2VkZSBhbyBSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRk1HIChSSS1VRk1HKSBvIGRpcmVpdG8gbsOjbyBleGNsdXNpdm8gZSBpcnJldm9nw6F2ZWwgZGUgcmVwcm9kdXppciBlL291IGRpc3RyaWJ1aXIgYSBzdWEgcHVibGljYcOnw6NvIChpbmNsdWluZG8gbyByZXN1bW8pIHBvciB0b2RvIG8gbXVuZG8gbm8gZm9ybWF0byBpbXByZXNzbyBlIGVsZXRyw7RuaWNvIGUgZW0gcXVhbHF1ZXIgbWVpbywgaW5jbHVpbmRvIG9zIGZvcm1hdG9zIMOhdWRpbyBvdSB2w61kZW8uCgpWb2PDqiBkZWNsYXJhIHF1ZSBjb25oZWNlIGEgcG9sw610aWNhIGRlIGNvcHlyaWdodCBkYSBlZGl0b3JhIGRvIHNldSBkb2N1bWVudG8gZSBxdWUgY29uaGVjZSBlIGFjZWl0YSBhcyBEaXJldHJpemVzIGRvIFJJLVVGTUcuCgpWb2PDqiBjb25jb3JkYSBxdWUgbyBSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRk1HIHBvZGUsIHNlbSBhbHRlcmFyIG8gY29udGXDumRvLCB0cmFuc3BvciBhIHN1YSBwdWJsaWNhw6fDo28gcGFyYSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gcGFyYSBmaW5zIGRlIHByZXNlcnZhw6fDo28uCgpWb2PDqiB0YW1iw6ltIGNvbmNvcmRhIHF1ZSBvIFJlcG9zaXTDs3JpbyBJbnN0aXR1Y2lvbmFsIGRhIFVGTUcgcG9kZSBtYW50ZXIgbWFpcyBkZSB1bWEgY8OzcGlhIGRlIHN1YSBwdWJsaWNhw6fDo28gcGFyYSBmaW5zIGRlIHNlZ3VyYW7Dp2EsIGJhY2stdXAgZSBwcmVzZXJ2YcOnw6NvLgoKVm9jw6ogZGVjbGFyYSBxdWUgYSBzdWEgcHVibGljYcOnw6NvIMOpIG9yaWdpbmFsIGUgcXVlIHZvY8OqIHRlbSBvIHBvZGVyIGRlIGNvbmNlZGVyIG9zIGRpcmVpdG9zIGNvbnRpZG9zIG5lc3RhIGxpY2Vuw6dhLiBWb2PDqiB0YW1iw6ltIGRlY2xhcmEgcXVlIG8gZGVww7NzaXRvIGRlIHN1YSBwdWJsaWNhw6fDo28gbsOjbywgcXVlIHNlamEgZGUgc2V1IGNvbmhlY2ltZW50bywgaW5mcmluZ2UgZGlyZWl0b3MgYXV0b3JhaXMgZGUgbmluZ3XDqW0uCgpDYXNvIGEgc3VhIHB1YmxpY2HDp8OjbyBjb250ZW5oYSBtYXRlcmlhbCBxdWUgdm9jw6ogbsOjbyBwb3NzdWkgYSB0aXR1bGFyaWRhZGUgZG9zIGRpcmVpdG9zIGF1dG9yYWlzLCB2b2PDqiBkZWNsYXJhIHF1ZSBvYnRldmUgYSBwZXJtaXNzw6NvIGlycmVzdHJpdGEgZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGF1dG9yYWlzIHBhcmEgY29uY2VkZXIgYW8gUmVwb3NpdMOzcmlvIEluc3RpdHVjaW9uYWwgZGEgVUZNRyBvcyBkaXJlaXRvcyBhcHJlc2VudGFkb3MgbmVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3Ugbm8gY29udGXDumRvIGRhIHB1YmxpY2HDp8OjbyBvcmEgZGVwb3NpdGFkYS4KCkNBU08gQSBQVUJMSUNBw4fDg08gT1JBIERFUE9TSVRBREEgVEVOSEEgU0lETyBSRVNVTFRBRE8gREUgVU0gUEFUUk9Dw41OSU8gT1UgQVBPSU8gREUgVU1BIEFHw4pOQ0lBIERFIEZPTUVOVE8gT1UgT1VUUk8gT1JHQU5JU01PLCBWT0PDiiBERUNMQVJBIFFVRSBSRVNQRUlUT1UgVE9ET1MgRSBRVUFJU1FVRVIgRElSRUlUT1MgREUgUkVWSVPDg08gQ09NTyBUQU1Cw4lNIEFTIERFTUFJUyBPQlJJR0HDh8OVRVMgRVhJR0lEQVMgUE9SIENPTlRSQVRPIE9VIEFDT1JETy4KCk8gUmVwb3NpdMOzcmlvIEluc3RpdHVjaW9uYWwgZGEgVUZNRyBzZSBjb21wcm9tZXRlIGEgaWRlbnRpZmljYXIgY2xhcmFtZW50ZSBvIHNldSBub21lKHMpIG91IG8ocykgbm9tZXMocykgZG8ocykgZGV0ZW50b3IoZXMpIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBkYSBwdWJsaWNhw6fDo28sIGUgbsOjbyBmYXLDoSBxdWFscXVlciBhbHRlcmHDp8OjbywgYWzDqW0gZGFxdWVsYXMgY29uY2VkaWRhcyBwb3IgZXN0YSBsaWNlbsOnYS4KCg==Repositório de PublicaçõesPUBhttps://repositorio.ufmg.br/oaiopendoar:2019-11-19T06:27:13Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)false
dc.title.pt_BR.fl_str_mv Random walks on the reputation graph
title Random walks on the reputation graph
spellingShingle Random walks on the reputation graph
Sabir Ribas
Random walks on the reputation graph
title_short Random walks on the reputation graph
title_full Random walks on the reputation graph
title_fullStr Random walks on the reputation graph
title_full_unstemmed Random walks on the reputation graph
title_sort Random walks on the reputation graph
author Sabir Ribas
author_facet Sabir Ribas
author_role author
dc.contributor.advisor1.fl_str_mv Berthier Ribeiro-Neto
dc.contributor.advisor1Lattes.fl_str_mv http://lattes.cnpq.br/5461069167314414
dc.contributor.advisor-co1.fl_str_mv Nivio Ziviani
dc.contributor.referee1.fl_str_mv Altigran Soares da Silva
dc.contributor.referee2.fl_str_mv Edmundo Albuquerque Souza e Silva
dc.contributor.referee3.fl_str_mv Rodrygo Luis Teodoro Santos
dc.contributor.authorLattes.fl_str_mv http://lattes.cnpq.br/5070120158504459
dc.contributor.author.fl_str_mv Sabir Ribas
contributor_str_mv Berthier Ribeiro-Neto
Nivio Ziviani
Altigran Soares da Silva
Edmundo Albuquerque Souza e Silva
Rodrygo Luis Teodoro Santos
dc.subject.por.fl_str_mv Random walks on the reputation graph
topic Random walks on the reputation graph
description The identification of reputable entities is an important task in business, education, and in many other fields. In general, the reputation of an entity reflects its public perception, which touches upon a variety of aspects that may impact the identity of the entity, such as its prowess, integrity, and trustworthiness. Indeed, more reputable entities are presumably a better fit for most purposes. Thus, while reputation is a widespread notion in society, it is albeit an arguably ill-defined one. As a consequence, quantifyingreputationischallenging. Indeed, existingattemptstoquantifyreputation rely on either manual assessments or on a restrictive definition of reputation. Inthisthesis,insteadofrelyingonasingleandprecisedefinitionofreputation,we proposetoexploitthetransference ofreputationamongentitiesinordertoidentifythe most reputable ones. To this end, we introduce a conceptual framework of reputation flowsandproposeametricbasedonit, whichwecallP-score. Thisframeworkconsists of a random walk model that allows inferring the reputation of a target set of entities with respect to suitable sources of reputation. By using it, we can better understand how reputation flows between distinct entities in a reputation graph. Weinstantiateourmodelinanacademicsearchsettingtoaddressthreecommon ranking tasks namely, research group ranking, author ranking, and publication venue ranking. By relying on publishing behavior as a reputation signal, we demonstrate the effectiveness of our model in contrast to standard citation-based approaches for identifying reputable venues, authors, and research groups in the broad area of Computer Science. In addition, we demonstrate the robustness of our model to perturbations in the selection of reputation sources. Finally, we show that effective reputation sources can be chosen via the proposed model itself in a fully automatic fashion.
publishDate 2017
dc.date.issued.fl_str_mv 2017-04-06
dc.date.accessioned.fl_str_mv 2019-11-18T15:24:33Z
dc.date.available.fl_str_mv 2019-11-18T15:24:33Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/doctoralThesis
format doctoralThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1843/31006
url http://hdl.handle.net/1843/31006
dc.language.iso.fl_str_mv por
language por
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.publisher.program.fl_str_mv Programa de Pós-Graduação em Ciência da Computação
dc.publisher.initials.fl_str_mv UFMG
dc.publisher.country.fl_str_mv Brasil
dc.publisher.department.fl_str_mv ICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃO
publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFMG
instname:Universidade Federal de Minas Gerais (UFMG)
instacron:UFMG
instname_str Universidade Federal de Minas Gerais (UFMG)
instacron_str UFMG
institution UFMG
reponame_str Repositório Institucional da UFMG
collection Repositório Institucional da UFMG
bitstream.url.fl_str_mv https://repositorio.ufmg.br/bitstream/1843/31006/1/SabirRibas.pdf
https://repositorio.ufmg.br/bitstream/1843/31006/2/license.txt
https://repositorio.ufmg.br/bitstream/1843/31006/3/SabirRibas.pdf.txt
bitstream.checksum.fl_str_mv 543016a5ea2e182c8efd412d2fb2c06e
34badce4be7e31e3adb4575ae96af679
7bebeb1bfa2740b8741ed6befef77701
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)
repository.mail.fl_str_mv
_version_ 1801677055873515520