Density based Clustering Algorithm for Distributed Datasets using Mutual k-Nearest Neighbors

Abstract

Privacy and security have always been a concern that prevents the sharing of data and impedes the success of many projects. Distributed knowledge computing, if done correctly, plays a key role in solving such a problem. The main goal is to obtain valid results while ensuring the non-disclosure of data. Density-based clustering is a powerful algorithm in analyzing uncertain data that naturally occur and affect the performance of many applications like location-based services. Nowadays, a huge number of datasets have been introduced for researchers which involve high-dimensional data points with varying densities. Such datasets contain data points with high-density regions surrounded by data points with sparse density. The existing clustering approaches handle these situations inefficiently, especially in the context of distributed data. In this paper, we design a new decomposable density-based clustering algorithm for distributed datasets (DDBC). DDBC utilizes the concept of mutual k-nearest neighbor relationship to cluster distributed datasets with different density. The proposed DDBC algorithm is capable of preserving the privacy and security of data on each site by requiring a minimal number of transmissions to other sites.

Authors and Affiliations

Ahmed Salim

Keywords

Related Articles

A Coreference Resolution Approach using Morphological Features in Arabic

Coreference resolution is considered one of the challenges in natural language processing. It is an important task that includes determining which pronouns are referring to which entities. Most of the earlier approaches...

TinyCO – A Middleware Model for Heterogeneous Nodes in Wireless Sensor Networks

Wireless sensor networks (WSNs) contain multiple nodes of the same configuration and type. The biggest challenge nowadays is to communicate with heterogeneous nodes of different WSNs. To communicate with distinct network...

Towards a Context-Dependent Approach for Evaluating Data Quality Cost

Data-related expertise is a central and determining factor in the success of many organizations. Big Tech companies have developed an operational environment that extracts benefit from collected data to increase the effi...

Colored Image Retrieval based on Most used Colors

The Fast Development of the image capturing in digital form leads to the availability of large databases of images. The manipulation and management of images within these databases depend mainly on the user interface and...

Video conference Android platform by your mobile phone

Video conferencing is a visual and audio communications technology dedicated to Smartphones. It is based on the client-server communication model that this requires many limits since using the server. In this paper, we p...

Download PDF file
  • EP ID EP499687
  • DOI 10.14569/IJACSA.2019.0100380
  • Views 102
  • Downloads 0

How To Cite

Ahmed Salim (2019). Density based Clustering Algorithm for Distributed Datasets using Mutual k-Nearest Neighbors. International Journal of Advanced Computer Science & Applications, 10(3), 620-630. https://europub.co.uk/articles/-A-499687