A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM

被引:37
作者
ALSULTAN, KS
SELIM, SZ
机构
[1] Department of Systems Engineering, King Fahd University of Petroleum and Minerals, Dhahran
关键词
FUZZY CLUSTERING; FUZZY C-MEANS ALGORITHM; CONTINUOUS SIMULATED ANNEALING; NONCONVEX PROGRAMMING; GLOBAL OPTIMIZATION;
D O I
10.1016/0031-3203(93)90141-I
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Fuzzy clustering (FC) problem is a non-convex mathematical program which usually possesses several local minima. The global minimum solution of the problem is found using a simulated annealing-based algorithm. Some preliminary computational experiments are reported and the solution is compared with that generated by the Fuzzy C-means algorithm.
引用
收藏
页码:1357 / 1361
页数:5
相关论文
共 8 条
[1]  
BELISLE CJP, 1990, 9025 U MICH DEP IND
[2]  
Bezdek J.C., 1973, THESIS CORNELL U ITH
[4]  
Dunn J. C., 1973, Journal of Cybernetics, V3, P32, DOI 10.1080/01969727308546046
[5]  
KAMEL MS, 1989, RELAXATION APPROACH
[6]  
Kirkpatrick S., 1983, SCIENCE, V220
[7]   EXPERIMENTS IN PROJECTION AND CLUSTERING BY SIMULATED ANNEALING [J].
KLEIN, RW ;
DUBES, RC .
PATTERN RECOGNITION, 1989, 22 (02) :213-220
[8]   A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM [J].
SELIM, SZ ;
ALSULTAN, K .
PATTERN RECOGNITION, 1991, 24 (10) :1003-1008