Results 281 to 290 of about 11,198,889 (292)
Some of the next articles are maybe not open access.

Quantum Collaborative K-means

2020 International Joint Conference on Neural Networks (IJCNN), 2020
Recently, more researchers are interested in the domain of quantum machine learning as it can manipulate and classify large numbers of vectors in high dimensional space in reasonable time.In this paper, we propose a new approach called Quantum Collaborative K-means which is based on combining several clustering models based on quantum K-means.
Kaoutar Benlamine   +3 more
openaire   +1 more source

A Modified K-Means Algorithm - Two-Layer K-Means Algorithm

2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2014
In this paper, a modified K-means algorithm is proposed to categorize a set of data. K-means algorithm is a simple and easy clustering method which can efficiently classify a large number of continuous numerical data of high-dimensions. Moreover, the data in each cluster are similar to one another.
Chen-Chung Liu   +3 more
openaire   +1 more source

Generalized Reduced K–Means

Computational Statistics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bottazzi Schenone, Mariaelena   +2 more
openaire   +2 more sources

Epidemic K-Means Clustering

2011 IEEE 11th International Conference on Data Mining Workshops, 2011
The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered ...
Giuseppe Di Fatta   +3 more
openaire   +2 more sources

-Means: A new generalized k-means clustering algorithm

Pattern Recognition Letters, 2003
Summary: This paper presents a generalized version of the conventional \(k\)-means clustering algorithm. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact cluster number.
openaire   +1 more source

K-Means

2022
Christo El Morr   +3 more
openaire   +1 more source

Robustness Properties of k Means and Trimmed k Means

Journal of the American Statistical Association, 1999
Luis Angel Garcia-Escudero   +1 more
openaire   +1 more source

K-Means

2009
Joydeep Ghosh, Alexander Liu
openaire   +2 more sources

IO-K-Means: Iterative Optimization for Centroids in K-Means

Shuntai Zhang   +6 more
openaire   +1 more source

Home - About - Disclaimer - Privacy