Cost-effective on-demand associative author name disambiguation.
| dc.contributor.author | Veloso, Adriano Alonso | |
| dc.contributor.author | Ferreira, Anderson Almeida | |
| dc.contributor.author | Gonçalves, Marcos André | |
| dc.contributor.author | Laender, Alberto Henrique Frade | |
| dc.contributor.author | Meira Júnior, Wagner | |
| dc.date.accessioned | 2012-10-22T16:46:00Z | |
| dc.date.available | 2012-10-22T16:46:00Z | |
| dc.date.issued | 2012 | |
| dc.description.abstract | Authorship disambiguation is an urgent issue that affects the quality of digital library ser-vices and for which supervised solutions have been proposed, delivering state-of-the-art effectiveness. However, particular challenges such as the prohibitive cost of labeling vast amounts of examples (there are many ambiguous authors), the huge hypothesis space (there are several features and authors from which many different disambiguation func-tions may be derived), and the skewed author popularity distribution (few authors are very prolific, while most appear in only few citations), may prevent the full potential of such techniques. In this article, we introduce an associative author name disambiguation approach that identifies authorship by extracting, from training examples, rules associating citation features (e.g., coauthor names, work title, publication venue) to specific authors. As our main contribution we propose three associative author name disambiguators: (1) EAND (Eager Associative Name Disambiguation), our basic method that explores associa-tion rules for name disambiguation; (2) LAND (Lazy Associative Name Disambiguation), that extracts rules on a demand-driven basis at disambiguation time, reducing the hypoth-esis space by focusing on examples that are most suitable for the task; and (3) SLAND (Self-Training LAND), that extends LAND with self-training capabilities, thus drastically reducing the amount of examples required for building effective disambiguation functions, besides being able to detect novel/unseen authors in the test set. Experiments demonstrate that all our disambigutators are effective and that, in particular, SLAND is able to outperform state-of-the-art supervised disambiguators, providing gains that range from 12% to more than 400%, being extremely effective and practical. | pt_BR |
| dc.identifier.citation | VELOSO, A. A. et al. Cost-effective on-demand associative author name disambiguation. Information Processing and Management, v. 48, n. 4, p. 680-697, 2012. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0306457311000847>. Acesso em: 22 out. 2012 | pt_BR |
| dc.identifier.uri | http://www.repositorio.ufop.br/handle/123456789/1727 | |
| dc.language.iso | en_US | pt_BR |
| dc.rights.license | O periódico Information Processing and Management concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3291850076753. | |
| dc.subject | Machine learning | pt_BR |
| dc.subject | Digital libraries | pt_BR |
| dc.subject | Author name disambiguation | pt_BR |
| dc.subject | Associative methods | pt_BR |
| dc.subject | Lazy strategies | pt_BR |
| dc.title | Cost-effective on-demand associative author name disambiguation. | pt_BR |
| dc.type | Artigo publicado em periodico | pt_BR |