“Anti-Bayesian” Flat and Hierarchical Clustering Using Symmetric Quantiloids
A myriad of works has been published for achieving data clustering based on the Bayesian paradigm, where the clustering sometimes resorts to Naïve-Bayes decisions. Within the domain of clustering, the Bayesian principle corresponds to assigning the unlabelled samples to the cluster whose mean (or centroid) is the closest. Recently, Oommen and his co-authors have proposed a novel, counter-intuitive and pioneering PR scheme that is radically opposed to the Bayesian principle. The rational for this paradigm, referred to as the “Anti-Bayesian” (AB) paradigm, involves classification based on the non-central quantiles of the distributions. The first-reported work to achieve clustering using the AB paradigm was in , where we proposed a flat clustering method which assigned unlabelled points to clusters based on the AB paradigm, and where the distances to the respective learned clusters was based on their quantiles rather than the clusters’ centroids for uni-dimensional and two-dimensional data. This paper, extends the results of  in many directions. Firstly, we generalize our previous AB clustering , initially proposed for handling uni-dimensional and two-dimensional spaces, to arbitrary d-dimensional spaces using their so-called “quantiloids”. Secondly, we extend the AB paradigm to consider how the clustering can be achieved in hierarchical ways, where we analyze both the Top-Down and the Bottom-Up clustering options. Extensive experimentation demonstrates that our clustering achieves results competitive to the state-of-the-art flat, Top-Down and Bottom-Up clustering approaches, demonstrating the power of the AB paradigm.
KeywordsCluster Algorithm Multivariate Normal Distribution Cluster Scheme True Cluster Unlabelled Sample
- 1.Hammer, H.L., Yazidi, A., Oommen, B.J.: A novel clustering algorithm based on a non-parametric “Anti-Bayesian” paradigm. In: Ali, M., Kwon, Y.S., Lee, C.-H., Kim, J., Kim, Y. (eds.) IEA/AIE 2015. LNCS, vol. 9101, pp. 536–545. Springer, Heidelberg (2015)Google Scholar
- 4.Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure, pp. 49–60. ACM Press (1999)Google Scholar
- 5.Ester, M., Kriegel, H.P., S, J., Xu, X.: A density-based algorithm for discovering clusters in large spatialdatabases with noise, pp. 226–231. AAAI Press (1996)Google Scholar
- 6.Murtagh, F., Contreras, P.: Methods of hierarchical clustering. CoRR abs/1105.0121 (2011)Google Scholar