In this paper we present a new c-means clustering algorithm for combined continuous-nominal data. We use spherical representation of nominal data. The impact of specific features is modeled with corresponding weights in metric definition. To solve constrained minimization problem we transfer the methodology of reformulation functions to the considered context. As a result we obtain a clustering algorithm with adaptation of weights. Series of numerical experiments on real and synthetic data show that the algorithm can successfully cluster raw, non-normalized data.
AsuncionA. and NewmanD.J., UCI machine learning repository, 2007.
2.
BezdekJ.C., Pattern Recognition with Fuzzy Objective Function Algorithms, Kluwer Academic Publishers, Norwell, MA, USA, 1981.
3.
DenisiukA. and GrabowskiM., A variant of the k-means clustering algorithm for continuous-nominal data, in: BurdukR.JackowskiK.KurzyńskiM.WoźniakM. and ŻołnierekA., editors, Proceedings of the 9th International Conference on Computer Recognition Systems CORES 2015, volume 403 of Advances in Intelligent Systems and Computing, Springer, 2016, pages 17–26.
4.
DenisiukA. and GrabowskiM., Low distortion embedding of the Hamming space into a sphere with quadrance metric and k-means clustering of nominal-continuous data, Fundamenta Informaticae153(3) (2017), 221–233.
5.
DezaE. and DezaM.M., Encyclopedia of Distances, Springer-Verlag, Berlin Heidelberg, 2009.
6.
DyckhoffH. and PedryczW., Generalized means as model of compensative connectives, Fuzzy Sets and Systems14(2) (1984), 143–154.
7.
IndykP. and MatoušekJ., Low-distortion embeddings of finite metric spaces, In Handbook of Discrete and Computational Geometry, 2004, pages 177–196. CRC Press.
8.
KaratzoglouA.SmolaA.HornikK. and ZeileisA., kernlab – an S4 package for kernel methods in R, Journal of Statistical Software11(9) (refyear2004), 1–20.
9.
KarayiannisN.B. and Randolph-GipsM.M., Non-euclidean c-means clustering algorithms, Intell. Data Anal7(5) (2003), 405–425.
10.
KaufmanL. and RousseeuwP.J., Finding Groups in Data: An Introduction to Cluster Analysis, volume 344 of Wiley Series in Probability and Statistics, John Wiley, 2008.
11.
LinialN., Finite metric spaces – combinatorics, geometry and algorithms, in: Ta-TsienL., editor, Proceedings of the International Congress of Mathematicians 2002, volume III, 2002, pages 573–586.
12.
MaechlerM.RousseeuwP.StruyfA.HubertM. and HornikK., Cluster: Cluster Analysis Basics and Extensions, 2016. R package version 2.0.5 – For new features, see the ’Changelog’ file (in the package source).
13.
MirkinB., Clustering: A Data Recovery Approach, Second Edition, Chapman & Hall/CRC Computer Science & Data Analysis. CRC Press, 2016.
14.
von LuxburgU., A tutorial on spectral clustering, Statistics and Computing17(4) (2007), 395–416.
