Fuzzy cluster analysis for probability density functions based on width criterion

Vo Van Tai * , Pham Toan Dinh and Nguyen Hoang Yen

* Corresponding author (vvtai@ctu.edu.vn)

Article Sidebar

Full Text: PDF

Received: 08 May 2017
Revised: 28 Jul 2017
Accepted: 31 Oct 2017
Published: 29 Nov 2017
DOI: 10.22144/ctu.jen.2017.047
Views
129
Downloads
41
Crossref
Scopus
Google Scholar
Europe PMC
How to Cite
Vo, V. T., Pham, T. D., & Nguyen, H. Y. (2017). Fuzzy cluster analysis for probability density functions based on width criterion. CTU Journal of Innovation and Sustainable Development , (07), 37-44. https://doi.org/10.22144/ctu.jen.2017.047
Issue
No. 07 (2017)

Main Article Content

Abstract

Based on the cluster width of probability density functions (WCD), we establish algorithms for fuzzy cluster analysis and for determining the suitable number of cluster. In addition, determining WCD for two and more than two probability density functions has been also considered by our Matlab produces. The numerical examples in both synthetic and real data are given not only to illustrate the reasonable of proposed algorithms and programs but also to show their advantages in comparing with existing ones.
Keywords: Clustering, density, distance, fuzzy, width

Article Details

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

References

Defays, D., 1997. An efficient algorithm for a complete link method. The computer Journal. 20: 364-366.

Duin, R.P., 1997. On the choice of smoothing parameters for parzen estimators of probability density functions. IEEE Transactions on computers. 25: 1175-1179.

Fukunaga, K., 1990. Introduction to statistical pattern recognition, Second Edition. New York, Academic Press, 616 pages.

Glick, N., 1973. Separation and probability of correct classification among two or more distributions. Annals of the Institute of Statistical Mathematics. 25: 373-382.

Goh, A. and Vidal, R., 2008. Unsupervised Riemannian clustering of probability functions. ECML PKDD, Par 1, LNAI 5211. 2: 377-392.

Chen, H.C. and Hung, L.H., 2015. An automatic clustering algorithm for probability density functions. Journal of statistical computation and simulation. 85: 3047-3063.

Matusita, K., 1967. On the notion of affinity of several distributions and some of its applications. Annals of the Institute of Statistical Mathematics. 19: 181-192.

Martinez, W.L. and Martinez, A.R., 2008. Computational statistics handbook with Matlab. Boca Raton, Chapman & Hall/CRC.

Montanari, A. and Carlò, D.G., 2013. Model-based clustering of probability density functions. Advances in Data Analysis and Classification. 7(3): 301-319.

Parzen, E., 1962. On estimation of a probability density function and mode. Annals of Mathematical statistics. 33: 1065-1076.

Pham-Gia, T., Turkkan, N., and Bekker, A., 2006. Bayesian analysis in the L1– norm of the mixing proportion using discriminant analysis. Metrika. 64: 1-22.

Pham-Gia, T., Turkkan, N., and Tai, V.V., 2008. The maximum function in statistical discrimination analysis. Commun.in Statistics–Simulation and Computation. 37: 320-336.

Scott, D.W., 1992. Multivariate density estimation: Theory, practice and visualization. John Wiley & Son, New York, 384 pages.

Density estimation for statistics and data analysis. Chapman and Hall. London, 175 pages.

Tai, V.V., and Pham-Gia, T., 2010. Cluster probability distributions. Journal of Applied Statistics. 37: 1891-1910.

Toussaint, G.T., 1971. Some inequalities between distance measures for feature, Evaluation. IEEE Transactions on Computers. 21(4): 409-410.

Webb, A., 2002. Statistical pattern recognition. John Wiley & Sons, New York, 504 pages.