Parallel and distributed clustering framework for big spatial data mining

Abstract

Clustering techniques are very attractive for identifying and extracting patterns of interests from datasets. However, their application to very large spatial datasets presents numerous challenges such as high-dimensionality, heterogeneity, and high complexity of some algorithms. Distributed clustering techniques constitute a very good alternative to the Big Data challenges (e.g., Volume, Variety, Veracity, and Velocity). In this paper, we developed and implemented a Dynamic Parallel and Distributed clustering (DPDC) approach that can analyse Big Data within a reasonable response time and produce accurate results, by using existing and current computing and storage infrastructure, such as cloud computing. The DPDC approach consists of two phases. The first phase is fully parallel and it generates local clusters and the second phase aggregates the local results to obtain global clusters. The aggregation phase is designed in such a way that the final clusters are compact and accurate while the overall process is efficient in time and memory allocation. DPDC was thoroughly tested and compared to wellknown clustering algorithms BIRCH and CURE. The results show that the approach not only produces high-quality results but also scales up very well by taking advantage of the Hadoop MapReduce paradigm or any distributed system.

A New Algorithm for Digital Image Encryption Based on Chaos Theory

“…Image enhancement denotes highlighting and sharpening definite features. It includes the contours, edges, and contrast of an image to display, observe, or further analyze and process the image [ 39 , 40 , 41 , 42 ]. Chaos theory presents the 1st Transdisciplinary understanding of bifurcation and transformational change.…”

Lung Infection Segmentation for COVID-19 Pneumonia Based on a Cascade Convolutional Network from CT Images

“…Clustering can be outlined as an unsupervised strategy that is aimed at fragmenting the input data (image or signal etc.) into the predefined segments (such as K-means method) or automated recognize parts (such as mean-shift method) based on certain criteria such as differences in the color, magnitude, and location [27][28][29][30]. The fuzzy c-means (FCM) algorithm used in our work is an unsupervised data dividing/splitting strategy.…”

Towards an Automatic Data Value Analysis Method for Relational Databases

“…With recent advances in information and communication technologies, such as digital sensor technologies, social media and digital transformation of organisations, we are able to collect huge amounts of data across a wide variety of fields. Furthermore, we live in an era where all what we do is leaving a digital footprint (data) which can be recorded, collected and used to provide insights (Bendechache et al, 2019).…”