Show simple item record

dc.contributor.authorHulpus, Ioana
dc.contributor.authorHayes, Conor
dc.contributor.authorKarnstedt, Marcel
dc.contributor.authorGreene, Derek
dc.contributor.editorStefano Leonardi, Alessandro Panconesi
dc.identifier.citationIoana Hulpus and Conor Hayes and Marcel Karnstedt and Derek Greene (2013) Unsupervised Graph-Based Topic Labelling using DBpedia . In: Stefano Leonardi, Alessandro Panconesi eds. Web Search and Data Mining - WSDM 2013en_US
dc.description.abstractAutomated topic labelling brings benefits for users aiming at analysing and understanding document collections, as well as for search engines targetting at the linkage between groups of words and their inherent topics. Current approaches to achieve this suffer in quality, but we argue their performances might be improved by setting the focus on the structure in the data. Building upon research for concept disambiguation and linking to DBpedia, we are taking a novel approach to topic labelling by making use of structured data exposed by DBpedia. We start from the hypothesis that words co-occuring in text likely refer to concepts that belong closely together in the DBpedia graph. Using graph centrality measures, we show that we are able to identify the concepts that best represent the topics. We comparatively evaluate our graph-based approach and the standard text-based approach, on topics extracted from three corpora, based on results gathered in a crowd-sourcing experiment. Our research shows that graph-based analysis of DBpedia can achieve better results for topic labelling in terms of both precision and topic coverage.en_US
dc.relation.ispartofWeb Search and Data Mining - WSDM 2013en
dc.titleUnsupervised Graph-Based Topic Labelling using DBpediaen_US
dc.typeConference Paperen_US
dc.local.contactIoana Rodica Hulpus, Insight, Nui Galway. Email:

Files in this item

Attribution-NonCommercial-NoDerivs 3.0 Ireland
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. Please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

The following license files are associated with this item:


This item appears in the following Collection(s)

Show simple item record