z-logo
open-access-imgOpen Access
FCM Clustering Algorithm Based on Laplacian Coefficient Optimized Objective Function
Author(s) -
Sheng Huang
Publication year - 2016
Publication title -
revista tecnica de la facultad de ingenieria universidad del zulia
Language(s) - English
Resource type - Journals
eISSN - 2477-9377
pISSN - 0254-0770
DOI - 10.21311/001.39.7.26
Subject(s) - cluster analysis , function (biology) , algorithm , mathematics , computer science , pattern recognition (psychology) , artificial intelligence , biology , evolutionary biology
FCM (Fuzzy c-means) clustering algorithm can be used to build sample generic uncertainty description. In this paper, we propose a FCM clustering algorithm based on the Laplacian Coefficient optimization objective function. The Laplacian Coefficient is introduced in the objective function, the structure of information between the object into the weight, thus improve the quality and efficiency of algorithm, and then through the compactness and separability measure two parts to optimize clustering validity, and use the method of maximum effectiveness will function for standardization, in order to improve the antinoise performance of improved algorithm. In the UCI standard data sets of Iris and Wine simulation experiments show that the proposed improved FCM algorithm compared with standard algorithm has more accurate clustering effect, and less affected by noise and higher robustness.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom