Results 31 to 40 of about 11,198,909 (310)
This paper presents a novel accelerated exact k-means algorithm called the Ball k-means algorithm, which uses a ball to describe a cluster, focusing on reducing the point-centroid distance computation. The Ball k-means can accurately find the neighbor clusters for each cluster resulting distance computations only between a point and its neighbor ...
Shuyin Xia +6 more
openaire +2 more sources
The comparative study of text documents clustering algorithms
Clustering is one of the most significant research area in the field of data mining and considered as an important tool in the fast developing information explosion era.Clustering systems are used more and more often in text mining, especially in ...
Mohammad Eiman Jamnezhad, Reza Fattahi
doaj +1 more source
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
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
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 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 +2 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
Introduction to Geographic and Spatial Approaches in the History of Archaeology
Who studies the historiography of archaeology? Who reads the history of the discipline? Recent years have seen growing interest in the history of archaeology as is reflected in works such as Christenson (1989), Trigger (1989; 2006), Chakrabarti (1988 ...
Neha Gupta, Bernard K Means
doaj +1 more source
Detecting Learning Patterns in Tertiary Education Using K-Means Clustering
We are in the era where various processes need to be online. However, data from digital learning platforms are still underutilised in higher education, yet, they contain student learning patterns, whose awareness would contribute to educational ...
Emmanuel Tuyishimire +3 more
doaj +1 more source
Variability of the used K-Means implementation for 1000 executions on the features provided by PCA using k-means++ initialization. (TIF)
Ana-Maria Ichim (14648702) +4 more
core +1 more source

