Scholarly record
CLUSTERING METHOD BASED ON ITERATIVE NODES PAIRING IN A DELAUNAY TRIANGULATION NET AND ITS APPLICATION FOR BUSINESS DATA ANALYSIS
Abstract
Clustering techniques are frequently applied in business and economy, for example in customer classification, enterprise grouping and in other economic data analysis. This paper presents a new clustering method, based on Delaunay triangulation and iterative aggregation of points distributed in the feature space. In the first part of the article we propose a clustering algorithm that utilises this concept. The algorithm iteratively connects specially selected pairs of nodes in the triangulation mesh and leads to systematic reduction of the mesh, together with creation and development of clusters. The procedure can be then classified as a hierarchical, agglomerative clustering method. Particular stages of the algorithm have been described and discussed, and its pseudo-code has been presented. The algorithm has been implemented in form of computer program written in C++. So far, the program can be applied to 2- or 3-dimensional problems (i.e. to datasets with only 2 or 3 numerical features), however in case of n variables (n > 2) the principal component analysis (PCA) tool used as a data preprocessing method can provide dimensionality reduction and decorrelation of variables. The method (together with PCA) has been applied to a selected business problem, concerning clustering of a set of enterprises and then identification of bankruptcy risk classes of those companies. We have obtained promising results that have been visualised and discussed. Directions of further research include generalising the algorithm to any number of variables, based on n-dimensional Delaunay tessellation.
Publication Impact Profile
Publication details
References6
Aggarwal Ch.C., Reddy Ch.K. (eds), Data Clustering. Algorithms and Applications. CRC Data Mining and Knowledge Discovery Series. Chapman and Hall/CRC, Boca Raton, 2013.
Dua D., Karra Taniskidou E. UCI Machine Learning Repository. Irvine, CA: University of California. School of Inf. and Comp. Science. Qualitative_Bankruptcy Data Set: https://archive.ics.uci.edu/ml/datasets/qualitative_bankruptcy, 2014.
Kogan J., Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press, Cambridge, 2007.
Morajda J., Wołoszyn P., A Cluster Analysis of Polish Stock Companies with a Method Based on Firefly Algorithm, Conference Proceedings on the 3rd International Multidisciplinary Scientific Conference on Social Sciences and Arts SGEM 2016, Vol. 3, Finance, Economics and Tourism, STEF92 Technology Ltd., Sofia, 2016, pp. 17-24.
Myoung-Jong K., Ingoo H., The discovery of experts' decision rules from qualitative bankruptcy data using genetic algorithms, Expert Systems with Applications, Vol. 25, Issue 4, November 2003, pp 637-646.
Wierzchoń S.T., Kłopotek M.A., Algorithms of Cluster Analysis. Institute of Computer Science, Polish Academy of Sciences, Warsaw, 2015.
View or Download full articleAccess options
SWS access login
Login as SWS Scientific CommitteeLogin as SWS Scientific PartnerLogin as SWS AuthorAuthors and approved SWS contributors will read and export their own linked papers after identity matching by SWS profile, email and SGEM GlobalID.
For librarian assistance: [email protected]
Purchase Instant Access
- Article can be downloaded after successful payment.
- Article may be used according to SWS library access terms.
- Article cannot be redistributed.
