Results 41 to 50 of about 13,094,494 (259)

K-means derived GECO Scores.

open access: yes, 2021
The table of GECO scores generated after clustering with k-means using each value of k listed in the first column ‘k’. (CSV)
Akul Singhania (502117)   +3 more
core   +1 more source

k -means: A revisit

open access: yesNeurocomputing, 2018
Abstract Due to its simplicity and versatility, k-means remains popular since it was proposed three decades ago. The performance of k-means has been enhanced from different perspectives over the years. Unfortunately, a good trade-off between quality and efficiency is hardly reached. In this paper, a novel k-means variant is presented.
Wanlei Zhao   +2 more
openaire   +4 more sources

Genetic K-means algorithm [PDF]

open access: yesIEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999
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   +4 more sources

RSKC: An R Package for a Robust and Sparse K-Means Clustering Algorithm

open access: yesJournal 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

Compressive K-means

open access: yes2017 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   +5 more sources

Deep k-Means: Jointly clustering with k-Means and learning representations

open access: yesPattern Recognition Letters, 2020
Under consideration at Pattern Recognition ...
Moradi Fard, Maziar   +2 more
openaire   +5 more sources

Penerapan Algoritma K-Means Untuk Mengklasifikasi Data Obat

open access: yesJurnal Sisfokom, 2023
Pengklasifikasian data obat pada sebuah instansi yang bergerak pada bidang Kesehatan merupakan hal yang sangat penting. Kegiatan tersebut tidak lepas dari pengawasan serta monitoring setiap harinya karena pengolahan data obat termasuk inti dalam ...
Ferdy Pangestu Ferdy Pangestu   +3 more
doaj   +1 more source

K−Means Clustering Microaggregation for Statistical Disclosure Control

open access: yes, 2012
This paper presents a K-means clustering technique that satisfies the bi-objective function to minimize the information loss and maintain k-anonymity. The proposed technique starts with one cluster and subsequently partitions the dataset into two or more
Abdun Naser Mahmood   +5 more
core   +1 more source

k-Means+++: Outliers-Resistant Clustering

open access: yes, 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

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

Home - About - Disclaimer - Privacy