On kernel information propagation for tag clustering in social annotation systems
- Publication Type:
- Conference Proceeding
- Citation:
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6882 LNAI (PART 2), pp. 505 - 514
- Issue Date:
- 2011-09-29
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2013002789OK.pdf | 259.94 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
In social annotation systems, users label digital resources by using tags which are freely chosen textual descriptors. Tags are used to index, annotate and retrieve resource as an additional metadata of resource. Poor retrieval performance remains a major challenge of most social annotation systems resulting from the severe problems of ambiguity, redundancy and less semantic nature of tags. Clustering method is a useful approach to handle these problems in the social annotation systems. In this paper, we propose a novel clustering algorithm named kernel information propagation for tag clustering. This approach makes use of the kernel density estimation of the KNN neighbor directed graph as a start to reveal the prestige rank of tags in tagging data. The random walk with restart algorithm is then employed to determine the center points of tag clusters. The main strength of the proposed approach is the capability of partitioning tags from the perspective of tag prestige rank rather than the intuitive similarity calculation itself. Experimental studies on three real world datasets demonstrate the effectiveness and superiority of the proposed method. © 2011 Springer-Verlag.
Please use this identifier to cite or link to this item: