Search Results - parallel data clustering algorithm*
Search alternatives:
- data clustering »
-
1
An efficient parallel clustering algorithm on big data using Spark
Published 2022“…Here we are proposing a new parallel fuzzy clustering algorithm called "An efficient parallel clustering algorithm on big data using spark" which deals with real-time processing. …”
Get full text
Get full text
Get full text
Article -
2
The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data
Published 2024“…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
Get full text
Get full text
Get full text
Get full text
Article -
3
Parallelization of noise reduction algorithm for seismic data on a beowulf cluster
Published 2010“…This paper presents the parallelization of a sequential noise reduction algorithm for seismic data processing into a parallel algorithm. …”
Get full text
Get full text
Citation Index Journal -
4
Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm
Published 2025“…Data vectors are generated based on the time needed, sequential and parallel candidate feature data are obtained, and the data rate is combined. …”
Article -
5
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. …”
Get full text
Get full text
Thesis -
6
A spark-based parallel fuzzy C median algorithm for web log big data
Published 2022“…At the moment, the situation is such that we are starved for knowledge while drowning in data. Due to these factors, the data mining clustering technique is one of the most crucial tools for collecting useful data from the web. …”
Get full text
Get full text
Get full text
Get full text
Article -
7
-
8
-
9
-
10
-
11
Dynamic partitioning and data allocation method on heterogeneous architecture / Muhammad Helmi Rosli
Published 2015“…Processing images are computationally complex due to its data and task intensive nature. This can be solved by parallelizing the process in cluster environment. …”
Get full text
Get full text
Thesis -
12
-
13
Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform
Published 2009“…New Iterative Alternating Group Explicit (NAGE) is a powerful parallel numerical algorithm for multidimensional temperature prediction. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes
Published 2007“…Genetic Algorithm as one of the Evolutionary Computation method improve the execution of parallel programming codes by optimizing the number of processors and the distribution of data. …”
Get full text
Get full text
Research Report -
15
Parallel Processing of Forward-backward Time-stepping Method for Time Domain Inverse Scattering
Published 2008“…A 3-D reconstruction of wooden hollow cylinder from the experimental data is examined by parallel FBTS algorithm. It is shown that the parallel processing reduces the calculation time and FBTS algorithm provides proper reconstructed profiles of target with respect to relative permittivity and conductivity.…”
Get full text
Get full text
Get full text
Article -
16
Parallel Implementation of Two Level Barotropic Models Applied to the Weather Prediction Problem
Published 2004“…Then the parallel algorithms are constructed and run using the Beowulf Cluster machine. …”
Get full text
Get full text
Thesis -
17
K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata
Published 2018“…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
Get full text
Get full text
Get full text
Article -
18
Quantification and segmentation of breast cancer diagnosis: efficient hardware accelerator approach
Published 2022“…Segmentation clustering algorithms have setbacks on overlapping clusters, proportion, and multidimensional scaling to map and leverage the data. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Parallel batch self-organizing map on graphics processing unit using CUDA
Published 2018“…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
Get full text
Get full text
Article -
20
Parallel batch self-organizing map on graphics processing unit using CUDA
Published 2018“…The most computationally expensive parts of its training algorithm (such as steps to compute distance between each data vector and neuron, and determining the Best Matching Unit based on minimum distance) are identified and mapped on GPU to be processed in parallel. …”
Get full text
Get full text
Article
