Using Mahalanobis Clustering Algorithm for College Student Learning Fundamental Mathematics

Abstract:

The popular fuzzy c-means algorithm based on Euclidean distance function converges to a local minimum of the objective function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, Gustafson-Kessel clustering algorithm needs added constraint of fuzzy covariance matrix, Gath-Geva clustering algorithm can only be used for the data with multivariate Gaussian distribution. In GK-algorithm, modified Mahalanobis distance with preserved volume was used. However, the added fuzzy covariance matrices in their distance measure were not directly derived from the objective function. In this paper, an improved Normalized Mahalanobis Clustering Algorithm Based on FCM by taking a new threshold value and a new convergent process is proposed. The experimental results of real data sets show that our proposed new algorithm has the best performance. Not only replacing the common covariance matrix with the correlation matrix in the objective function in the Normalized Mahalanobis Clustering Algorithm Based on FCM.

• Periodical: Advanced Materials Research (Volumes 476-478)
• Pages: 2129-2132
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.476-478.2129
• Online since: February 2012
• Authors: Chin Chun Chen
• Keywords: GG-Algorithm, GK-Algorithm, Mahalanobis Clustering Algorithm

References

[1] J. C. Bezdek, Pattern recognition with fuzzy objective function algorithms (1981), pp.65-70.

[2] C.-H. Li, W.-C. Huang, B.-C. Kuo and C.-C. Hung, A Novel Fuzzy Weighted C-Method for Image Classification, International Journal of Fuzzy Systems, 10(3), (2008), pp.168-173.

[3] R. Krishnapuram and J. Kim, A note on the Gustafson-Kessel and adaptive fuzzy clustering algorithm, IEEE Transactions on Fuzzy Systems, 7( 4), (1999), pp.453-461.

DOI: 10.1109/91.784208

[4] D. E. Gustafson and W. C. Kessel, Fuzzy Clustering with a Fuzzy Covariance Matrix, Proc. IEEE Conf. Decision Contr. San Diego, CA, (1979), pp.761-766.

[5] Gath, and A. B. Geva, Unsupervised optimal fuzzy clustering, IEEE Trans. Pattern Anal. Machine Intell. 11, (1989), pp.773-781.

DOI: 10.1109/34.192473

[6] C. Dunn, A fuzzy relative of the isodata process and its use in detecting compact, well-separated clusters J. Cybern,.3, (1973), pp.32-57.

DOI: 10.1080/01969727308546046

[7] F. Höppner, F. Klawonn, R. Kruse, T. Runkler, Fuzzy cluster analysis (John Wiley and Sons, (1999).

[8] H.-C. Liu, J.-M. Yih, T.-W. Sheu and S.-W. Liu, A new fuzzy possibility clustering algorithms based on unsupervised Mahalanobis distances, Proceedings of International conference on Machine Learning and Cybernetics, .7(7), (2007), pp.3939-3944.

DOI: 10.1109/icmlc.2007.4370834

[9] H.-C. Liu, J.-M. Yih, D.-B. Wu and S.-W. Liu, Fuzzy C-means algorithm based on "complete" Mahalanobis cistances, Proceedings of International conference on Machine Learning and Cybernetics, 7(6), (2008), pp.3569-3574.]

DOI: 10.1109/icmlc.2008.4621023

[10] H.-C. Liu, J.-M. Yih, W.-C. Lin and T.-S. Liu Fuzzy C-means algorithm based on PSO and Mahalanobis distances, International Journal of Innovative Computing, Information and Control, ISSN 1349-4198, January 21 (2009).

[11] B. Balasko, J. Abonyi and B. Feil, Fuzzy clustering and. data analysis Toolbox for use with Matlab from http://www.mathworks.com/ matlabcentral/ fileexchange/7473.

[12] H.-C. Liu, B.-C. Jeng, J.-M. Yih, and Y.-K. Yu, Fuzzy C-means algorithm based on standard mahalanobis distances. Proceedings of the 2009 International Symposium on Information Processing (ISIP'09), ISBN 928-952-5726-02-2. (2009), pp.422-427.

[13] C. Ding, T. Li, W. Ping, On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing, Computational Statistics and Data Analysis 52, (2008), pp.3913-3927.

DOI: 10.1016/j.csda.2008.01.011