Results 21 to 30 of about 17,495,651 (287)

$k$-means clustering of extremes [PDF]

open access: yesElectronic Journal of Statistics, 2020
The $k$-means clustering algorithm and its variant, the spherical $k$-means clustering, are among the most important and popular methods in unsupervised learning and pattern detection. In this paper, we explore how the spherical $k$-means algorithm can be applied in the analysis of only the extremal observations from a data set.
Janßen, Anja, Wan, Phyllis
openaire   +5 more sources

K-means** - a fast and efficient K-means algorithms

open access: yesInternational Journal of Intelligent Information and Database Systems, 2018
K-means often converges to a local optimum. In improved versions of K-means, k-means++ is well-known for achieving a rather optimum solution with its cluster initialisation strategy and high computational efficiency. Incremental K-means is recognised for its converging to the empirically global optimum but having a high complexity due to its stepping ...
Cuong Duc Nguyen, Trong Hai Duong
openaire   +2 more sources

Noisy k-means++ Revisited

open access: yesCoRR, 2023
Leibniz International Proceedings in Informatics (LIPIcs ...
Grunau, Christoph   +2 more
openaire   +5 more sources

K-Means variability.

open access: yes, 2023
Variability of the used K-Means implementation for 1000 executions on the features provided by PCA using k-means++ initialization. (TIF)
Ana-Maria Ichim (14648702)   +4 more
core   +1 more source

Optimized Cartesian K-Means [PDF]

open access: yesIEEE Transactions on Knowledge and Data Engineering, 2015
Product quantization-based approaches are effective to encode high-dimensional data points for approximate nearest neighbor search. The space is decomposed into a Cartesian product of low-dimensional subspaces, each of which generates a sub codebook. Data points are encoded as compact binary codes using these sub codebooks, and the distance between two
Jianfeng Wang   +5 more
openaire   +6 more sources

Ball k-means

open access: yesCoRR, 2020
This paper presents a novel accelerated exact k-means algorithm called the Ball k-means algorithm, which uses a ball to describe a cluster, focusing on reducing the point-centroid distance computation. The Ball k-means can accurately find the neighbor clusters for each cluster resulting distance computations only between a point and its neighbor ...
Shuyin Xia   +6 more
openaire   +2 more sources

Improved YOLOv5m model based on Swin Transformer, K-means++, and Efficient Intersection over Union (EIoU) loss function for cocoa tree (Theobroma cacao) disease detection [PDF]

open access: yesJournal of Plant Protection Research
The cocoa tree is prone to diverse diseases such as stem borer, stem canker, swollen shot, and root rot disease which impedes high yield. Early disease detection is a critical component of diverse management processes that are implemented throughout the ...
Benedicta Nana Esi Nyarko   +3 more
doaj   +1 more source

K-means and fuzzy c-means algorithm comparison on regency/city grouping in Central Java Province

open access: yesDesimal, 2022
The Human Development Index (HDI) is very important in measuring the country's success as an effort to build the quality of life of people in a region, including Indonesia. The government needs to make groupings based on the needs of a city/district.
Ummu Wachidatul Latifah   +2 more
doaj   +1 more source

K-Means clustering.

open access: yes, 2023
K-Means clustering.
Armand Joseph D. Esteller (14636924)   +9 more
core   +1 more source

The comparative study of text documents clustering algorithms

open access: yesEnvironment Conservation Journal, 2015
Clustering is one of the most significant research area in the field of data mining and considered as an important tool in the fast developing information explosion era.Clustering systems are used more and more often in text mining, especially in ...
Mohammad Eiman Jamnezhad, Reza Fattahi
doaj   +1 more source

Home - About - Disclaimer - Privacy