Results 21 to 30 of about 16,020,323 (245)

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

Online k-means Clustering

open access: yesCoRR, 2019
11 pages, 1 ...
Cohen-Addad, Vincent   +3 more
openaire   +4 more sources

Initializing k-means Clustering

open access: yesProceedings of the 9th International Conference on Data Science, Technology and Applications, 2020
The quality of clustering results obtained with the k-means algorithm depends heavily on the initialization of the cluster centers. Simply sampling centers uniformly at random from the data points usually yields fairly poor and unstable results. Hence several alternatives have been suggested in the past, among which Maximin (Hathaway et al., 2006) and ...
Borgelt, Christian, Yarikova, Olha
openaire   +1 more source

Metode Elbow dan K-Means Guna Mengukur Kesiapan Siswa SMK Dalam Ujian Nasional

open access: yesJurnal Teknologi dan Sistem Informasi, 2020
Keberhasilan siswa dalam menempuh ujian nasional (UN) dapat terlihat dari perolehan nilai mata pelajaran yang diujikan, tiga diantaranya adalah nilai matematika, Bahasa Indonesia, dan Bahasa Inggris.
Ninik Tri Hartanti
doaj   +1 more source

Discriminative k-means clustering [PDF]

open access: yesThe 2013 International Joint Conference on Neural Networks (IJCNN), 2013
The k-means algorithm is a partitional clustering method. Over 60 years old, it has been successfully used for a variety of problems. The popularity of k-means is in large part a consequence of its simplicity and efficiency. In this paper we are inspired by these appealing properties of k-means in the development of a clustering algorithm which accepts
openaire   +4 more sources

Global optimality in k -means clustering [PDF]

open access: yesInformation Sciences, 2018
We study the problem of finding an optimum clustering, a problem known to be NP-hard. Existing literature contains algorithms running in time proportional to the number of points raised to a power that depends on the dimensionality and on the number of clusters.
Cristina Tîrnauca   +3 more
openaire   +4 more sources

Subspace K-means clustering

open access: yesBehavior Research Methods, 2013
To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic,
Timmerman, Marieke E.   +3 more
openaire   +2 more sources

Differentially Private K-Means Clustering [PDF]

open access: yesProceedings of the Sixth ACM Conference on Data and Application Security and Privacy, 2016
There are two broad approaches for differentially private data analysis. The interactive approach aims at developing customized differentially private algorithms for various data mining tasks. The non-interactive approach aims at developing differentially private algorithms that can output a synopsis of the input dataset, which can then be used to ...
Dong Su   +4 more
openaire   +4 more sources

An Overlapping Subspace K-Means Clustering Algorithm [PDF]

open access: yesJisuanji gongcheng, 2020
Most of existing clustering algorithms for high-dimensional sparse data do not consider overlapping class clusters and outliers,resulting in unsatisfactory clustering results.Therefore,this paper proposes an overlapping subspace K-Means clustering ...
LIU Yuhang, MA Huifang, LIU Haijiao, YU Li
doaj   +1 more source

SC3s: efficient scaling of single cell consensus clustering to millions of cells

open access: yesBMC Bioinformatics, 2022
Background Today it is possible to profile the transcriptome of individual cells, and a key step in the analysis of these datasets is unsupervised clustering.
Fu Xiang Quah, Martin Hemberg
doaj   +1 more source

Home - About - Disclaimer - Privacy