Privacy-preserving clustering with distributed EM mixture modeling
نویسندگان
چکیده
منابع مشابه
EM-Based Clustering with Privacy Preserving
The aim of this work is to propose a privacypreserving EM-based clustering algorithm for horizontally partitioned data sets between two parties. To this end, we propose basic protocols based on oblivious polynomial evaluation and prove the secrecy of protocols based on the semi-honest security model and the composition theorem. We have also given an extension of the proposed method to address t...
متن کاملPrivacy-preserving distributed clustering
Clustering is a very important tool in data mining and is widely used in on-line services for medical, financial and social environments. The main goal in clustering is to create sets of similar objects in a data set. The data set to be used for clustering can be owned by a single entity, or in some cases, information from different databases is pooled to enrich the data so that the merged data...
متن کاملPrivacy-preserving Distributed Clustering using Generative Models
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than sharing parts of the original or perturbed data, we instead transmit the parameters of suitable generative models built at each local data site to a central location. We mathematically show that the best representativ...
متن کاملPrivacy-preserving agent-based distributed data clustering
A growing number of applications in distributed environment involve very large data sets that are inherently distributed among a large number of autonomous sources over a network. The demand to extend data mining technology to such distributed data sets has motivated the development of several approaches to distributed data mining and knowledge discovery, of which only a few make use of agents....
متن کاملPrivacy preserving clustering with constraints
The k-center problem is a classical combinatorial optimization problem which asks to find k centers such that the maximum distance of any input point in a set P to its assigned center is minimized. The problem allows for elegant 2-approximations. However, the situation becomes significantly more difficult when constraints are added to the problem. We raise the question whether general methods c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge and Information Systems
سال: 2005
ISSN: 0219-1377,0219-3116
DOI: 10.1007/s10115-004-0148-7