Incremental unsupervised name disambiguation in cleaned digital libraries

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCarvalho, Ana Paula de-
Autor(es): dc.creatorFerreira, Anderson Almeida-
Autor(es): dc.creatorLaender, Alberto Henrique Frade-
Autor(es): dc.creatorGonçalves, Marcos André-
Data de aceite: dc.date.accessioned2019-11-06T13:25:29Z-
Data de disponibilização: dc.date.available2019-11-06T13:25:29Z-
Data de envio: dc.date.issued2012-10-22-
Data de envio: dc.date.issued2012-10-22-
Data de envio: dc.date.issued2011-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/123456789/1730-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/555081-
Descrição: dc.descriptionName ambiguity in the context of bibliographic citation sisone of t h e hardest problems currently faced by the Digital Library ( DL) community. Here we deal with the problem of disambiguating new citations records insertedint o a cleaned DL, without the need t process the whole collection , which is usually necessary for un supervised methods. Although supervised solutions can deal with this situation , there is the costly burden of generating training data besides the fact that these methods cannot and le well the insertion of record s of new author not already existent in the repository. I n t h is article, we propose a new unsupervised method that identifies the correct author sof the new citation records to be inserted in a DL. The method is based on heuristics that are also used to identify whet her the new record s belong to authors already in t h e digital library or not , correctly identifying new authors in most cases. Our experiment al evaluation , using synthetic an d real data sets, shows gains of u p t o 19% when compared to a state- of- t h e- art method without the cost of having to disambiguate the whole DL at each new load ( as d on e by u n supervised methods) or the need for any train in g ( as d on e by supervised methods) .-
Idioma: dc.languageen-
Direitos: dc.rightsA Sociedade Brasileira de Computação permite a cópia deste material para fins não comerciais. Fonte: Informação contida no artigo.-
Palavras-chave: dc.subjectBibliographic citation-
Palavras-chave: dc.subjectDigital library-
Palavras-chave: dc.subjectName libraries-
Título: dc.titleIncremental unsupervised name disambiguation in cleaned digital libraries-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.