Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data

نویسندگان

  • Dimitris K. Tasoulis
  • Elena C. Laskari
  • Gerasimos C. Meletiou
  • Michael N. Vrahatis
چکیده

The exponential growth of databases containing personal information has rendered the task of extracting high quality information from collections of such databases very important. This task is hindered by the security concerns that arise, due to the confidentiality of the data records, and the reluctance of the organizations to disclose their data. This paper proposes a clustering algorithmic scheme that ensures privacy and confidentiality of the data without compromising the effectiveness of the clustering algorithm nor imposing high communication costs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset

Data mining has been a popular research area for more than a decade. There are several problems associated with data mining. Among them clustering is one of the most interesting problems. However, this problem becomes more challenging when dataset is distributed between different parties and they do not want to share their data. So, in this paper we propose a privacy preserving two party hierar...

متن کامل

Privacy Preserving Data mining with Reduced Communication overhead

In today's world privacy and security are more essential elements when data is shared. A fruitful direction for future data mining research will be the development of techniques that incorporate privacy concerns. Most of the methods use random permutation techniques to mask the data, for preserving the privacy of sensitive data. The approaches for privacy preserving data mining suffer from high...

متن کامل

Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data

We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same problem in the case where the data is both horizontally and vertically distributed, a situation we refer to as grid partitioned data. We give an algorithm for privacy preserving ID3 over horizontally partitioned data invo...

متن کامل

Privacy Preserving CART Algorithm over Vertically Partitioned Data

Data mining classification algorithms are centralized algorithm and works on centralized database. In this information age, organizations uses distributed database. Since data mining of private data is one of the keys to success for an organization, it is a challenging task to implement data mining in distributed database. Collaboration of different organization brings mutual benefits to the pa...

متن کامل

A Privacy Review of Vertically Partitioned Data- based Privacy-Preserving Collaborative Filtering Schemes

E-commerce companies utilize collaborative filtering approaches to provide recommendations in order to attract customers. Consumer participation through supplying feedbacks is an important component for a recommendation system to produce accurate predictions. New companies in the marketplace might lack enough data for collaborative filtering purposes. Thus, they can come together to share their...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006