In:
Journal of Information Science, SAGE Publications, Vol. 35, No. 4 ( 2009-08), p. 426-438
Abstract:
In recent years, there has been considerable interest in the analysis of social annotations. Social annotations allow users to annotate web resources more easily, openly and freely than do taxonomies and ontologies. In this paper, we propose a novel algorithm for social annotations. It introduces a fuzzy biclustering algorithm to social annotations for identifying subgroups of users and of resources, and discovering the relationships between those users for social annotations. The algorithm employs a combination of pattern search and compromise programming to construct hierarchically structured biclusters. The pattern search method is used to compute a single objective optimal solution, and the compromise programming is used to trade-off between multiple objectives. The algorithm is not subject to the convexity limitations, and does not need to use the derivative information. It can automatically identify user communities and achieve high prediction accuracies.
Type of Medium:
Online Resource
ISSN:
0165-5515
,
1741-6485
DOI:
10.1177/0165551508101862
Language:
English
Publisher:
SAGE Publications
Publication Date:
2009
detail.hit.zdb_id:
439125-1
detail.hit.zdb_id:
2025062-9
SSG:
24,1
Permalink
