By Topic

A fuzzy variant of k-member clustering for collaborative filtering with data anonymization

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
$33 $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

4 Author(s)
Honda, K. ; Grad. Sch. of Eng., Osaka Prefecture Univ., Sakai, Japan ; Kawano, A. ; Notsu, A. ; Ichihashi, H.

Privacy preserving data mining is a promising approach for encouraging users to exploit the IT supports without fear of information leaks. k-member clustering is a basic technique for achieving k-anonymization, in which data samples are summarized so that any sample is indistinguishable from at least k - 1 other samples. This paper proposes a fuzzy variant of k-member clustering with the goal of improving the quality of data summarization with k-anonymity. Each k-member cluster is extracted considering the fuzzy membership degrees of samples, which are estimated based on the distance from clusters. The proposed anonymization method is also applied to collaborative filtering, in which the main task is estimation of the applicability of unevaluated items. Several experimental results demonstrate the characteristic features of the proposed anonymization method.

Published in:

Fuzzy Systems (FUZZ-IEEE), 2012 IEEE International Conference on

Date of Conference:

10-15 June 2012