Title Spherical K-means Clustering
نویسندگان
چکیده
October 21, 2009 Type Package Title Spherical k-Means Clustering Version 0.1-2 Author Kurt Hornik, Ingo Feinerer, Martin Kober Maintainer Kurt Hornik Description Algorithms to compute spherical k-means partitions. Features several methods, including a genetic and a simple fixed-point algorithm and an interface to the CLUTO vcluster program. License GPL-2 Imports slam (>= 0.1-6), clue (>= 0.3-32) Enhances Matrix Repository CRAN Date/Publication 2009-10-21 14:26:36
منابع مشابه
Package 'skmeans' Title Spherical K-means Clustering
Description Algorithms to compute spherical k-means partitions. Features several methods, including a genetic and a fixed-point algorithm and an interface to the CLUTO vcluster program.
متن کاملPackage ‘ skmeans ’ June 24 , 2010
June 24, 2010 Type Package Title Spherical k-Means Clustering Version 0.1-5 Author Kurt Hornik, Ingo Feinerer, Martin Kober Maintainer Kurt Hornik Description Algorithms to compute spherical k-means partitions. Features several methods, including a genetic and a simple fixed-point algorithm and an interface to the CLUTO vcluster program. License GPL-2 Imports slam (>...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملK-Means for Spherical Clusters with Large Variance in Sizes
Data clustering is an important data exploration technique with many applications in data mining. The k-means algorithm is well known for its efficiency in clustering large data sets. However, this algorithm is suitable for spherical shaped clusters of similar sizes and densities. The quality of the resulting clusters decreases when the data set contains spherical shaped with large variance in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009