Folksonomy-based collabulary learning

author: Leandro Balby Marinho, Information Systems and Machine Learning Lab, University of Hildesheim
published: Nov. 24, 2008,   recorded: October 2008,   views: 3964


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


The growing popularity of social tagging systems promises to alleviate the knowledge bottleneck that slows the full materialization of the Semantic Web, as these systems are cheap, extendable, scalable and respond quickly to user needs. However, for the sake of knowledge workflow, one needs to find a compromise between the ungoverned nature of folksonomies and the controlled vocabulary of domain-experts. In this paper, we address this concern by first devising a method that automatically combines folksonomies with domain-expert ontologies resulting in an enriched folksonomy. We then introduce a new algorithm based on frequent itemsets mining that efficiently learns an ontology over the concepts present in the enriched folksonomy. Moreover, we propose a new benchmark for ontology evaluation, which is used in the context of information finding, since this is one of the leading motivations for using ontologies in social tagging systems, to quantitatively assess our method. We conduct experiments on real data and empirically show the effectiveness of our approach.

See Also:

Download slides icon Download slides: iswc08_balby_marinho_fbcl_01.ppt (2.5┬áMB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: