Title :
Generating Optimum Number of Clusters Using Median Search and Projection Algorithms
Author :
Suresh, Lalith ; Simha, Jay B. ; Veluru, Rajappa
Author_Institution :
CSE Dept., CITech, Bangalore, India
Abstract :
K-means Clustering is an important algorithm for identifying the structure in data. In this work, a novel approach to seeding the clusters with the latent data structure is proposed. This is expected to minimize: the need for number of clusters apriory and time for convergence by providing near optimal cluster centers. Also these algorithms are tested on the latest standards for data warehouses – the column store databases.
Keywords :
Clustering algorithms; Computer architecture; Convergence; Data structures; Data warehouses; Databases; Programming profession; Projection algorithms; Shape measurement; Testing; Clustering; DBMS; Median Projection; Median Selection; SQL; k-means Algorithm;
Conference_Titel :
Advances in Computer Engineering (ACE), 2010 International Conference on
Conference_Location :
Bangalore, Karnataka, India
Print_ISBN :
978-1-4244-7154-6
DOI :
10.1109/ACE.2010.95
