DocumentCode
578539
Title
A novel clustering algorithm using voronoi diagram
Author
Edla, D.R. ; Jana, Prasanta K.
Author_Institution
Dept. of Comput. Sci. & Eng., Indian Sch. of Mines, Dhanbad, India
fYear
2012
fDate
22-24 Aug. 2012
Firstpage
35
Lastpage
40
Abstract
Clustering is an indispensable solution for many problems in a wide variety of domains. In this paper, we propose a new clustering algorithm which is based on Voronoi diagram. The algorithm uses a real valued function defined by the radii of Voronoi circles. This function enables to deal with the inner points of the clusters followed by the boundary points. The proposed scheme is applied on various artificial and biological data. The experimental results of the proposed method are also compared with K-means and a few existing clustering techniques. For the sake of evaluation of multi-dimensional data, we have used Normalized Information Gain (NIG). It is observed from the experimental results that the proposed method outperforms the existing methods.
Keywords
biology computing; computational geometry; data mining; pattern clustering; Voronoi diagram; artificial data; biological data; multidimensional data; normalized information gain; novel clustering algorithm; real valued function; Algorithm design and analysis; Biology; Clustering algorithms; Economics; Entropy; Geology; Partitioning algorithms; Voronoi diagram; biological data; clustering; entropy; normalized information gain;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Information Management (ICDIM), 2012 Seventh International Conference on
Conference_Location
Macau
ISSN
pending
Print_ISBN
978-1-4673-2428-1
Type
conf
DOI
10.1109/ICDIM.2012.6360125
Filename
6360125
Link To Document