By Topic

Web Clustering Using Social Bookmarking Data with Dimension Reduction Regarding Similarity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yanagimoto, H. ; Sch. of Eng., Osaka Prefecture Univ., Sakai, Japan ; Yoshioka, M. ; Omatu, S.

We propose a web clustering method using social bookmarking data with dimension reduction regarding similarity. To realize this idea we construct the similarity matrix between web pages based on their cooccurrence frequency. Since the similarity matrix includes various kind of noise, we map the similarity matrix onto lower dimension feature space to reduce the noise. Especially we carry out dimension reduction regarding web pages' similarity. This approach uses generalized eigenvectors and is different from usual eigenvalue problems. Using artificially generated data, we explain that the feature space constructed with our proposed method emphasizes the essential relationship between web pages. And using real social bookmarking data, we describe our proposed method can make good clusters.

Published in:

Advances in Social Networks Analysis and Mining (ASONAM), 2010 International Conference on

Date of Conference:

9-11 Aug. 2010