Results 31 to 40 of about 15,852,135 (305)
Analyze the Clustering and Predicting Results of Palm Oil Production in Aceh Utara
PT. Perkebunan Nusantara 1 is engaged in oil palm production with a total land area of 1,144 Ha. The formulation of this research can determine productive land clusters based on land area, number of trees, number of stages, and palm oil production ...
Mutammimul Ula +3 more
doaj +1 more source
Skill set profile clustering: the empty K-means algorithm with automatic specification of starting cluster centers [PDF]
While students’ skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [1, 4, 6].
Nugent, R., Ayers, E., Dean, N.
core +6 more sources
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 +3 more sources
Using classification and K-means methods to predict breast cancer recurrence in gene expression data
Background: Breast cancer is a type of cancer that starts in the breast tissue and affects about 10% of women at different stages of their lives.
Mohammadreza Sehhati +3 more
doaj +1 more source
The $k$-means is one of the most important unsupervised learning techniques in statistics and computer science. The goal is to partition a data set into many clusters, such that observations within clusters are the most homogeneous and observations between clusters are the most heterogeneous.
openaire +2 more sources
The developed algorithm is similar with "Christopher F. Barnes, A new multiple path search technique for residual vector quantizers, 1994", but we conduct the research independently and apply it in data/feature compression and image ...
Jianfeng Wang +5 more
openaire +3 more sources
The $k$-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is often the practitioners' choice algorithm for optimizing the popular $k$-means clustering objective and is known to give an $O(\log k)$-approximation in expectation. To obtain higher quality solutions, Lattanzi and Sohler (ICML 2019) proposed augmenting $k$-means++ with $O(k \log \log
Lorenzo Beretta 0001 +3 more
openaire +3 more sources

