Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Some Pairwise Constrained Semi-Supervised Fuzzy c-Means Clustering Algorithms
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Robust fuzzy clustering of relational data
IEEE Transactions on Fuzzy Systems
| Hi-index | 0.00 |
This paper proposes two types of kernel fuzzy c-means algorithms with an indefinite kernel. Both algorithms are based on the fact that the relational fuzzy c-means algorithm is a special case of the kernel fuzzy c-means algorithm. The first proposed algorithm adaptively updated the indefinite kernel matrix such that the dissimilarity between each datum and each cluster center in the feature space is non-negative, instead of subtracting the minimal eigenvalue of the given kernel matrix as its preprocess. This derivation follows the manner in which the non-Euclidean relational fuzzy c-means algorithm is derived from the original relational fuzzy c-means one. The second proposed method produces the memberships by solving the optimization problem in which the constraint of non-negative memberships is added to the one of K-sFCM. This derivation follows the manner in which the non-Euclidean fuzzy relational clustering algorithm is derived from the original relational fuzzy c-means one. Through a numerical example, the proposed algorithms are discussed.