Abstract
The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we propose a new approach to this problem which is based on tabu search technique, and aims at finding a global solution of FCP. We compare the performance of the algorithm with the fuzzy C-means algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 2023-2030 |
| Number of pages | 8 |
| Journal | Pattern Recognition |
| Volume | 30 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 1997 |
Keywords
- Fuzzy C-means algorithm
- Fuzzy clustering
- Global optimization
- Tabu search technique
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence