
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Cluster
analysis
or
clustering
is the task of grouping a set of objects in such a way that objects in the same
group (called a
cluster
) are more similar (in some sense or another) to each other than to those in other
groups (clusters)
.
K

means
is
one of the simplest unsupervised learning algorithms that solve the well
known clustering problem.
The
process of k means algorithm data
is partiti
oned int
o K clusters and the
data are randomly choose
to the clusters resulti
ng in clusters that have
the sa
me number of data
set
.
This
paper is proposed a new K means clustering algorithm we calculate the initial
centroids
systemically
instead of random assigned due to which accuracy and time
improved.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment