Use este identificador para citar ou linkar para este item: https://rd.uffs.edu.br/handle/prefix/5001
Registro completo de metadados
Campo DCValorIdioma
dc.contributor.advisor1Dal Bianco, Guilherme-
dc.creatorTodescato, Matheus Vinícius-
dc.date2021-05-12-
dc.date.accessioned2022-02-01T19:53:55Z-
dc.date.available2022-02-01-
dc.date.available2022-02-01T19:53:55Z-
dc.date.issued2021-05-12-
dc.identifier.urihttps://rd.uffs.edu.br/handle/prefix/5001-
dc.description.abstractHigh Recall Information Retrieval (HIRE) aims at identifying all (or nearly all) relevant documents given a query. HIRE, for example, is used in the systematic literature review task, where the goal is to identify all relevant scientific articles. The documents selected by HIRE as relevant define the user effort to identify the target information. On this way, one of HIRE goals is only to return relevant documents avoiding overburning the user with non-relevant information. Traditionally, supervised machine learning algorithms are used as HIRE’ core to produce a ranking of relevant documents (e.g. SVM). However, such algorithms depend on an initial training set (seed) to start the process of learning. In this work, we propose a new approach to produce the initial seed for HIRE focus on reducing the user effort. Our approach combines an active learning approach with a raking strategy to select only the informative examples. The experimentation shows that our approach is able to reduce until 18% the labeling effort with competitive recall.pt_BR
dc.description.provenanceSubmitted by Rafael Pinheiro de Almeida (rafael.almeida@uffs.edu.br) on 2022-02-01T18:32:16Z No. of bitstreams: 1 TODESCATO.pdf: 930671 bytes, checksum: 79dafcab46e574bba99e6ceb0eb9582c (MD5)en
dc.description.provenanceApproved for entry into archive by Franciele Scaglioni da Cruz (franciele.cruz@uffs.edu.br) on 2022-02-01T19:53:55Z (GMT) No. of bitstreams: 1 TODESCATO.pdf: 930671 bytes, checksum: 79dafcab46e574bba99e6ceb0eb9582c (MD5)en
dc.description.provenanceMade available in DSpace on 2022-02-01T19:53:55Z (GMT). No. of bitstreams: 1 TODESCATO.pdf: 930671 bytes, checksum: 79dafcab46e574bba99e6ceb0eb9582c (MD5) Previous issue date: 2021-05-12en
dc.languageporpt_BR
dc.publisherUniversidade Federal da Fronteira Sulpt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentCampus Chapecópt_BR
dc.publisher.initialsUFFSpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectInformaçãopt_BR
dc.subjectAprendizagempt_BR
dc.subjectDocumentopt_BR
dc.subjectRecuperação da informaçãopt_BR
dc.subjectCiência da computaçãopt_BR
dc.titleA new strategy to seed selection for the high recall taskpt_BR
dc.typeArtigo Cientificopt_BR
Aparece nas coleções:Ciência da Computação

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
TODESCATO.pdf908,86 kBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.