Results 41 to 50 of about 11,198,909 (310)
Metode Elbow dalam Optimasi Jumlah Cluster pada K-Means Clustering
Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer, 2023 K-Means clustering merupakan salah satu strategi yang digunakan dalam analisis data dan machine learning untuk mengelompokkan data menjadi beberapa kelompok (cluster) berdasarkan kemiripan fitur atau atributnya.
Nadia Annisa Maori, Evanita Evanita
doaj +1 more source
2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017 The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compressive version of K-means (CKM), that estimates cluster centers from a sketch, i.e. from a drastically compressed representation of the training dataset.
Keriven, Nicolas +3 more
openaire +3 more sources
RSKC: An R Package for a Robust and Sparse K-Means Clustering Algorithm
Journal of Statistical Software, 2016 Witten and Tibshirani (2010) proposed an algorithim to simultaneously find clusters and select clustering variables, called sparse K-means (SK-means).
Yumi Kondo +2 more
doaj +1 more source
Deep k-Means: Jointly clustering with k-Means and learning representations
Pattern Recognition Letters, 2020 Under consideration at Pattern Recognition ...
Moradi Fard, Maziar +2 more
openaire +4 more sources
k-Means+++: Outliers-Resistant Clustering
, 2020 The k-means problem is to compute a set of k centers (points) that minimizes the sum of squared distances to a given set of n points in a metric space. Arguably, the most common algorithm to solve it is k-means++ which is easy to implement and provides a
Feldman, Dan +5 more
core +1 more source
Scalability of efficient parallel K-Means [PDF]
, 2009 Clustering is defined as the grouping of similar items in a set, and is an important process within the field of data mining. As the amount of data for various applications continues to increase, in terms of its size and dimensionality, it is necessary ...
Giuseppe Di Fatta +3 more
core +1 more source
A parametric k-means algorithm [PDF]
Computational Statistics, 2007 The k points that optimally represent a distribution (usually in terms of a squared error loss) are called the k principal points. This paper presents a computationally intensive method that automatically determines the principal points of a parametric distribution.
openaire +4 more sources