On the use of inclusion structure in fuzzy clustering algorithm in case of Gaussian membership functions
Research output: Contribution to journal › Article › peer-review
Colleges, School and Institutes
This article addresses the problem of incorporating an inclusion structure in the general class of fuzzy c-means algorithms. Conventionally, all the classes of fuzzy clustering algorithms involve a distance structure as the main tool to compute the interaction between the expected class prototypes and all the patterns. However, as the inclusion violates the basic metric assumptions, thereby it cannot be directly substituted for regular distance structure. The approach, advocated in this paper, consists of supporting the distance structure by a semi definite matrix A, which preserves the inclusion constraint globally for each class. Particularly, a graded inclusion index is put forward that takes into account the rational requirements underlying the definition of the inclusion of two Gaussian membership functions. Behaviour and algebraic properties of the proposed methodology are investigated. The proposed approach is then incorporated into the general fuzzy c-mean scheme, where the corresponding optimization problem is solved. Using both synthetic and real datasets, some illustrations are carried out in order to highlight the performances of the constructed algorithm and their evaluations, which are also compared to standard fuzzy c-means algorithm.
|Journal||Journal of Intelligent and Fuzzy Systems|
|Publication status||Published - 2015|