A Probabilistic Approach for Learning Folksonomies from Structured Data

11/16/2010
by   Anon Plangprasopchok, et al.
0

Learning structured representations has emerged as an important problem in many domains, including document and Web data mining, bioinformatics, and image analysis. One approach to learning complex structures is to integrate many smaller, incomplete and noisy structure fragments. In this work, we present an unsupervised probabilistic approach that extends affinity propagation to combine the small ontological fragments into a collection of integrated, consistent, and larger folksonomies. This is a challenging task because the method must aggregate similar structures while avoiding structural inconsistencies and handling noise. We validate the approach on a real-world social media dataset, comprised of shallow personal hierarchies specified by many individual users, collected from the photosharing website Flickr. Our empirical results show that our proposed approach is able to construct deeper and denser structures, compared to an approach using only the standard affinity propagation algorithm. Additionally, the approach yields better overall integration quality than a state-of-the-art approach based on incremental relational clustering.

READ FULL TEXT

page 13

page 14

research
05/26/2010

Integrating Structured Metadata with Relational Affinity Propagation

Structured and semi-structured data describing entities, taxonomies and ...
research
05/27/2010

Growing a Tree in the Forest: Constructing Folksonomies by Integrating Structured Metadata

Many social Web sites allow users to annotate the content with descripti...
research
10/04/2021

An Efficient Procedure for Mining Egocentric Temporal Motifs

Temporal graphs are structures which model relational data between entit...
research
10/10/2007

An Affinity Propagation Based method for Vector Quantization Codebook Design

In this paper, we firstly modify a parameter in affinity propagation (AP...
research
09/09/2021

Compositional Affinity Propagation: When Clusters Have Compositional Structure

We consider a new kind of clustering problem in which clusters need not ...
research
09/27/2019

Clustering Uncertain Data via Representative Possible Worlds with Consistency Learning

Clustering uncertain data is an essential task in data mining for the in...
research
02/14/2012

Hierarchical Affinity Propagation

Affinity propagation is an exemplar-based clustering algorithm that find...

Please sign up or login with your details

Forgot password? Click here to reset