摘要
求与一个模糊相似矩阵“距离”最近的模糊等价矩阵，至今已提出了两个求局部最优解的算法和一些启发式算法，本文也提出一个简便可行的求局部最优解的算法，这算法与线性规划的单纯形算法一样，也是在有限个“顶点”上寻优．
UP to now two algorithms for computing a local optimum of the optimal fuzzy equivalent matrix of a fuzzy similarity matrix and some heuristic methods have been introduced. This paper also presents a simple and convenient algorithm which searches a local optimum in a finite set,just as the simplex algorithm does.
出处
《科技通报》
1996年第1期1-3,9,共4页
Bulletin of Science and Technology
基金
国家自然科学基金
关键词
模糊相似矩阵
最优化算法
模糊聚类
clustering
fuzzy similarity matrix
fuzzy equivalent matrix
optimization algorithm
