Authors: Seyed Behnam Khakbaz; Marziyeh Pourestarabadi; Nastaran Hajiheydari
Addresses: Faculty of Management, Strategy Management, University of Tehran, Jalal Al-e-Ahmad Ave., Nasr Bridge, Tehran 14155-6311, Iran ' Faculty of Management, University of Tehran, Jalal Al-e-Ahmad Ave., Nasr Bridge, Tehran 14155-6311, Iran ' Faculty of Management, University of Tehran, Jalal Al-e-Ahmad Ave., Nasr Bridge, Tehran 14155-6311, Iran
Abstract: A new automatic clustering algorithm has been proposed in this paper, which does not need clustering information, such as number of clusters and radius of density. Moreover, this algorithm generates robust results, and named Autocluster. Autocluster is a suitable algorithm for customer segmentation, and as it is known, clustering information is not available properly in customer segmentation. Autocluster applies concepts of partitioning clustering algorithms, hierarchical clustering algorithms and density-based clustering algorithm. Consequently, a new, automatic and high-precision algorithm has been proposed. Autocluster consists of four steps: developing 'distance matrix', identifying 'best point (data record)', developing 'point matrix' and 'clustering'. These steps have been explained comprehensively in this paper. Furthermore, iris database and a synthetic dataset has been analysed by Autocluster to verify its capabilities vs. K-means algorithm. Moreover, an Iranian insurance dataset has been clustered by Autocluster, which has shown satisfying results, compared to the results from K-means.
Keywords: clustering; Autocluster; hybrid clustering algorithm; K-means algorithm; segmentation.
International Journal of Data Science, 2017 Vol.2 No.3, pp.205 - 220
Accepted: 06 Apr 2015
Published online: 27 Aug 2017 *