Procedia Computer Science · 2013 · 10 citations · 14 references
ComputingComputer ScienceData ScienceData MiningData StructuresRecommender SystemsCollaborative FilteringData AnonymizationData ProtectionDocument ClusteringFrequent Pattern MiningUnsupervised LearningAnonymization AlgorithmsClusteringFilteringGreedy HeuristicsK-anonymityPrivacy-preserving Data MiningSolo Construction
Privacy preserving data mining is an important issue in network societies and co-clustering is a basic technique for analyzing intrinsic data structures in cooccurrence information among objects and items. In this paper, a greedy algorithm for k-member clustering, which achieves k-anonymity by coding at least k records into a solo observation, is enhanced to a co-clustering model. In the greedy algorithm, k-member clusters are sequentially extracted one-by-one, where each cluster is composed of homogeneous objects. In numerical experiments, the applicability of the proposed algorithm to collaborative filtering tasks is discussed.
14
An Algorithmic Framework for Performing Collaborative Filtering
Jonathan L. Herlocker, Joseph A. Konstan, Al Borchers et al. · ACM SIGIR Forum · 2017 · 2.6K citations
Well-Separated Clusters and Optimal Fuzzy Partitions
J. C. Dunn · Journal of Cybernetics · 1974 · 2.5K citations