Results 41 to 50 of about 1,981,824 (263)
Traditionally, practitioners initialize the {\tt k-means} algorithm with centers chosen uniformly at random. Randomized initialization with uneven weights ({\tt k-means++}) has recently been used to improve the performance over this strategy in cost and run-time.
Yoder, Jordan, Priebe, Carey E.
openaire +2 more sources
Faster K-Means Cluster Estimation
There has been considerable work on improving popular clustering algorithm `K-means' in terms of mean squared error (MSE) and speed, both. However, most of the k-means variants tend to compute distance of each data point to each cluster centroid for ...
A Likas, DT Pham, SP Lloyd, T Kanungo
core +1 more source
Dynamic load balancing in parallel KD-tree k-means [PDF]
One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions.
Di Fatta, Giuseppe, Pettinger, David
core +1 more source
Soil data clustering by using K-means and fuzzy K-means algorithm
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
Fast k-means algorithm clustering
k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is ...
Kecman, Vojislav +4 more
core +1 more source
A Feature-Reduction Multi-View k-Means Clustering Algorithm
The k-means clustering algorithm is the oldest and most known method in cluster analysis. It has been widely studied with various extensions and applied in a variety of substantive areas.
Miin-Shen Yang, Kristina P. Sinaga
doaj +1 more source
New bounds for $k$-means and information $k$-means
In this paper, we derive a new dimension-free non-asymptotic upper bound for the quadratic $k$-means excess risk related to the quantization of an i.i.d sample in a separable Hilbert space. We improve the bound of order $\mathcal{O} \bigl( k / \sqrt{n} \bigr)$ of Biau, Devroye and Lugosi, recovering the rate $\sqrt{k/n}$ that has already been proved by
Appert, Gautier, Catoni, Olivier
openaire +2 more sources
PCA and K-Means decipher genome
In this paper, we aim to give a tutorial for undergraduate students studying statistical methods and/or bioinformatics. The students will learn how data visualization can help in genomic sequence analysis.
A Zinovyev +8 more
core +2 more sources
ABSTRACT Background Pediatric patients with extracranial solid tumors (ST) receiving chemotherapy are at an increased risk for Pneumocystis jirovecii pneumonia (PJP). However, evidence guiding prophylaxis practices in this population is limited. A PJP‐related fatality at our institution highlighted inconsistent prescribing approaches and concerns about
Kriti Kumar +8 more
wiley +1 more source
Sickle Cell Disease Is an Inherent Risk for Asthma in a Sibling Comparison Study
ABSTRACT Introduction Sickle cell disease (SCD) and asthma share a complex relationship. Although estimates vary, asthma prevalence in children with SCD is believed to be comparable to or higher than the general population. Determining whether SCD confers an increased risk for asthma remains challenging due to overlapping symptoms and the ...
Suhei C. Zuleta De Bernardis +9 more
wiley +1 more source

