Information Ranking Using Optimum-Path Forest

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (Unesp)-
Autor(es): dc.contributorUniversidade Federal de São Carlos (UFSCar)-
Autor(es): dc.contributorPetr Brasileiro SA-
Autor(es): dc.contributorUniversidade Federal da Bahia (UFBA)-
Autor(es): dc.creatorAscencao, Nathalia Q. [UNESP]-
Autor(es): dc.creatorAfonso, Luis C. S.-
Autor(es): dc.creatorColombo, Danilo-
Autor(es): dc.creatorOliveira, Luciano-
Autor(es): dc.creatorPapa, Joao P. [UNESP]-
Autor(es): dc.creatorIEEE-
Data de aceite: dc.date.accessioned2022-02-22T01:06:04Z-
Data de disponibilização: dc.date.available2022-02-22T01:06:04Z-
Data de envio: dc.date.issued2021-06-26-
Data de envio: dc.date.issued2021-06-26-
Data de envio: dc.date.issued2019-12-31-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/210714-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/210714-
Descrição: dc.descriptionThe task of learning to rank has been widely studied by the machine learning community, mainly due to its use and great importance in information retrieval, data mining, and natural language processing. Therefore, ranking accurately and learning to rank are crucial tasks. Context-Based Information Retrieval systems have been of great importance to reduce the effort of finding relevant data. Such systems have evolved by using machine learning techniques to improve their results, but they are mainly dependent on user feedback. Although information retrieval has been addressed in different works along with classifiers based on Optimum-Path Forest (OPF), these have so far not been applied to the learning to rank task. Therefore, the main contribution of this work is to evaluate classifiers based on Optimum-Path Forest, in such a context. Experiments were performed considering the image retrieval and ranking scenarios, and the performance of OPF-based approaches was compared to the well-known SVM-Rank pairwise technique and a baseline based on distance calculation. The experiments showed competitive results concerning precision and outperformed traditional techniques in terms of computational load.-
Descrição: dc.descriptionPetrobras-
Descrição: dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)-
Descrição: dc.descriptionConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)-
Descrição: dc.descriptionUNESP Univ Estadual Paulista, Sch Sci, Bauru, SP, Brazil-
Descrição: dc.descriptionUFSCar Fed Univ Sao Carlos, Dept Comp, Sao Carlos, Brazil-
Descrição: dc.descriptionPetr Brasileiro SA, Cenpes, Rio De Janeiro, RJ, Brazil-
Descrição: dc.descriptionUFBA Fed Univ Bahia, Salvador, BA, Brazil-
Descrição: dc.descriptionUNESP Univ Estadual Paulista, Sch Sci, Bauru, SP, Brazil-
Descrição: dc.descriptionPetrobras: 2014/00545-0-
Descrição: dc.descriptionFAPESP: 2013/07375-0-
Descrição: dc.descriptionFAPESP: 2014/12236-1-
Descrição: dc.descriptionFAPESP: 2017/25908-6-
Descrição: dc.descriptionFAPESP: 2018/15597-6-
Descrição: dc.descriptionFAPESP: 2019/07665-4-
Descrição: dc.descriptionCNPq: 307066/2017-7-
Descrição: dc.descriptionCNPq: 307550/2018-4-
Descrição: dc.descriptionCNPq: 427968/2018-6-
Formato: dc.format8-
Idioma: dc.languageen-
Publicador: dc.publisherIeee-
Relação: dc.relation2020 International Joint Conference On Neural Networks (ijcnn)-
???dc.source???: dc.sourceWeb of Science-
Título: dc.titleInformation Ranking Using Optimum-Path Forest-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.