In this paper, we focus a new parametric approach, which starts with an estimate of the local distribution and efficiently avoids pre-assuming the cluster number. This clustering program is applied to both artificial and benchmark data classification and its performance is proven better than the well-known k-means algorithm.
Clustering is a typical method of grouping data points in an unsupervised learning environment. The performance of most clustering algorithms is dependent on the accurate estimate of the cluster number, which is always unknown in the real applications.
- Quote paper
- Dr. G. Bharanidharan (Author), M.Phil. M. Iqbal (Author), 2009, Geometric approach to clustering in pattern recognition, Munich, GRIN Verlag, https://www.hausarbeiten.de/document/1522363