A tabu search-based algorithm for the fuzzy clustering problem

Khaled S. Al-Sultan*, Chawki A. Fedjki

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

62 Scopus citations

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 languageEnglish
Pages (from-to)2023-2030
Number of pages8
JournalPattern Recognition
Volume30
Issue number12
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'A tabu search-based algorithm for the fuzzy clustering problem'. Together they form a unique fingerprint.

Cite this