نتایج جستجو برای: k means cluster
تعداد نتایج: 880962 فیلتر نتایج به سال:
We investigate, theoretically and empirically, the effectiveness of kernel K-means++ samples as landmarks in the Nyström method for low-rank approximation of kernel matrices. Previous empirical studies (Zhang et al., 2008; Kumar et al., 2012) observe that the landmarks obtained using (kernel) K-means clustering define a good lowrank approximation of kernel matrices. However, the existing work d...
The Lloyd’s algorithm, also known as the k-means algorithm, is one of the most popular algorithms for solving the k-means clustering problem in practice. However, it does not give any performance guarantees. This means that there are datasets on which this algorithm can behave very badly. One reason for poor performance on certain datasets is bad initialization. The following simple sampling ba...
In this paper we propose to jointly consider Segmental Dynamic Time Warping and distance clustering for the unsupervised learning of acoustic events. As a result, the computational complexity increases only linearly with the dababase size compared to a quadratic increase in a sequential setup, where all pairwise SDTW distances between segments are computed prior to clustering. Further, we discu...
This study presents the results of an experimental study of two document clustering techniques which are kmeans and k-means++. In particular, we compare the two main approaches in crime document clustering. The drawback of k-means is that the user needs to define the centroid point. This becomes more critical when dealing with document clustering because each center point represented by a word ...
In this paper we present an online unsupervised method based on clustering to find defects in concrete structures using hammering. First, the initial dataset of sound samples is roughly clustered using the k-means algorithm with the k-means++ seeding procedure in order to find the cluster best representative of the structure. Then the regular model for the hammering sound, the centroid of this ...
The general election is a democratic process that carried out in every country whose system of government presidential, including Indonesia, which conducts it five years. In fact, some people abstain, leading to budget wasting and missing target. Thus, very important identify clusters districts map the number voters for upcoming election. This needs prediction help reduce budgeting risk as an e...
K-means is one of the most widely used clustering algorithms in various disciplines, especially for large datasets. However the method is known to be highly sensitive to initial seed selection of cluster centers. K-means++ has been proposed to overcome this problem and has been shown to have better accuracy and computational efficiency than k-means. In many clustering problems though –such as w...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید