Results 1 to 10 of about 1,981,824 (263)
K-Means Cloning: Adaptive Spherical K-Means Clustering [PDF]
We propose a novel method for adaptive K-means clustering. The proposed method overcomes the problems of the traditional K-means algorithm. Specifically, the proposed method does not require prior knowledge of the number of clusters.
Abdel-Rahman Hedar +3 more
doaj +3 more sources
Optimized Cartesian K-Means [PDF]
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
Wang, Jianfeng +5 more
openaire +4 more sources
Exact Acceleration of K-Means++ and K-Means|| [PDF]
K-Means++ and its distributed variant K-Means|| have become de facto tools for selecting the initial seeds of K-means. While alternatives have been developed, the effectiveness, ease of implementation,and theoretical grounding of the K-means++ and || methods have made them difficult to "best" from a holistic perspective.
openaire +2 more sources
Mengembangkan wilayah untuk mengurangi kesenjangan dan menjamin pemerataan merupakan salah satu dari tujuh agenda Pembangunana RPJMN IV Tahun 2020-2024. Setiap wilayah tentunya memiliki potensi yang berbeda, baik potensi fisik maupun non-fisik. Perbedaan
Muhamad Budiman Johra
doaj +1 more source
t-k-means: A ROBUST AND STABLE k-means VARIANT [PDF]
$k$-means algorithm is one of the most classical clustering methods, which has been widely and successfully used in signal processing. However, due to the thin-tailed property of the Gaussian distribution, $k$-means algorithm suffers from relatively poor performance on the dataset containing heavy-tailed data or outliers.
Li, Yiming +5 more
openaire +2 more sources
Genetic K-means algorithm [PDF]
In this paper, we propose a novel hybrid genetic algorithm (GA) that finds a globally optimal partition of a given data into a specified number of clusters. GA's used earlier in clustering employ either an expensive crossover operator to generate valid child chromosomes from parent chromosomes or a costly fitness function or both.
Krishna, K, Murty, Narasimha M
openaire +3 more sources
K-means and fuzzy c-means algorithm comparison on regency/city grouping in Central Java Province
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
Two new initialization methods for K-means clustering are proposed. Both proposals are based on applying a divide-and-conquer approach for the K-means‖ type of an initialization strategy. The second proposal also uses multiple lower-dimensional subspaces
Joonas Hämäläinen +2 more
doaj +1 more source
The development of a GIS for New Deal Archaeology
I have recently launched an effort to create a GIS of all New Deal-funded archaeological investigations conducted in the 48 states that comprised the USA during the Great Depression (Means 2011).
Bernard K. Means
doaj +1 more source
Over half a century old and showing no signs of aging, k -means remains one of the most popular data processing algorithms. As is well-known, a proper initialization of k -means is crucial for obtaining a good final solution.
Bahmani, Bahman +4 more
openaire +2 more sources

