Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
Journal of Information Science
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
0165551508101862v1
35/4/426    most recent
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Lixin Han
Right arrow Articles by Hong Yan
Social Bookmarking
Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

A fuzzy biclustering algorithm for social annotations

Lixin Han

College of Computer and Information Engineering, Hohai University, Nanjing, Jiangsu, People's Republic of China, lixinhan2002{at}hotmail.com, State Key Laboratory of Novel software Technology, Nanjing University, Nanjing, Jiangsu, People's Republic of China

Hong Yan

Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong, School of Electrical and information Engineering, University of Sydney, NSW 2006, Australia

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.

Key Words: biclustering • multiobjective optimization • social annotations

This version was published on August 1, 2009

Journal of Information Science, Vol. 35, No. 4, 426-438 (2009)
DOI: 10.1177/0165551508101862
Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?