Results 31 to 40 of about 15,644,966 (296)

The algorithm of noisy k-means

open access: yesCoRR, 2013
In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables.
Brunet, Camille, Loustau, Sébastien
openaire   +3 more sources

Adapting $k$-means algorithms for outliers

open access: yesCoRR, 2020
This paper shows how to adapt several simple and classical sampling-based algorithms for the $k$-means problem to the setting with outliers. Recently, Bhaskara et al. (NeurIPS 2019) showed how to adapt the classical $k$-means++ algorithm to the setting with outliers.
Christoph Grunau, Václav Rozhon
openaire   +3 more sources

Soil data clustering by using K-means and fuzzy K-means algorithm

open access: yesTelfor Journal, 2016
A problem of soil clustering based on the chemical characteristics of soil, and proper visual representation of the obtained results, is analysed in the paper. To that aim, K-means and fuzzy K-means algorithms are adapted for soil data clustering.
E. Hot, V. Popović-Bugarin
doaj   +1 more source

Parallel Implementation of K-Means Algorithm on FPGA

open access: yesIEEE Access, 2020
The K-means algorithm is widely used to find correlations between data in different application domains. However, given the massive amount of data stored, known as Big Data, the need for high-speed processing to analyze data has become even more critical,
Leonardo A. Dias   +2 more
doaj   +1 more source

Review of K-means Algorithm Optimization Based on Differential Privacy [PDF]

open access: yesJisuanji kexue, 2022
Differential privacy K-means algorithm (DP K-means),as a kind of privacy preserving data mining (PPDM) model based on differential privacy technology,has attracted much attention from researchers because of its simplicity,efficiency and ability to ...
KONG Yu-ting, TAN Fu-xiang, ZHAO Xin, ZHANG Zheng-hang, BAI Lu, QIAN Yu-rong
doaj   +1 more source

Optimal location of logistics distribution centres with swarm intelligent clustering algorithms.

open access: yesPLoS ONE, 2022
A clustering algorithm is a solution for grouping a set of objects and for distribution centre location problems. But the common K-means clustering algorithm may give local optimal solutions. Swarm intelligent algorithms simulate the social behaviours of
Tsung-Xian Lin   +2 more
doaj   +1 more source

Parallelization of the K-Means++ Clustering Algorithm

open access: yesIngénierie des systèmes d information, 2021
K-means++ is the clustering algorithm that is created to improve the process of getting initial clusters in the K-means algorithm. The k-means++ algorithm selects initial k-centroids arbitrarily dependent on a probability that is proportional to each data-point distance to the existing centroids.
Sara Daoudi   +3 more
openaire   +2 more sources

Patient Data Analysis with the Quantum Clustering Method

open access: yesQuantum Reports, 2023
Quantum computing is one of the most promising solutions for solving optimization problems in the healthcare world. Quantum computing development aims to light up the execution of a vast and complex set of algorithmic instructions. For its implementation,
Shradha Deshmukh   +2 more
doaj   +1 more source

Distributed k-means algorithm

open access: yesCoRR, 2013
In this paper we provide a fully distributed implementation of the k-means clustering algorithm, intended for wireless sensor networks where each agent is endowed with a possibly high-dimensional observation (e.g., position, humidity, temperature, etc.) The proposed algorithm, by means of one-hop communication, partitions the agents into measure ...
Oliva, Gabriele   +2 more
openaire   +3 more sources

An Algorithm for Online K-Means Clustering [PDF]

open access: yes2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2015
This paper shows that one can be competitive with the k-means objective while operating online. In this model, the algorithm receives vectors v_1,...,v_n one by one in an arbitrary order. For each vector the algorithm outputs a cluster identifier before receiving the next one.
Edo Liberty   +2 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy