模糊聚类计算的最佳算法

马军; 邵陆

引用本文:	马军,邵陆.模糊聚类计算的最佳算法.软件学报,2001,12(4):578-581

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 4338次下载 5458次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
模糊聚类计算的最佳算法
马军¹, 邵陆²
1.山东大学计算机科学系,山东济南 250100;2.山东省医药工业研究所,山东济南 250100

摘要:

给出模糊关系传递闭包在对应模糊图上的几何意义,并提出一个基于图连通分支计算的模糊聚类最佳算法.对任给的n个样本,新算法最坏情况下的时间复杂性函数T(n)满足O(n)≤T(n)≤O(n²).与经典的基于模糊传递闭包计算的模糊聚类算法的O(n³logn)计算时间相比,新算法至少降低了O(n

关键词: 模糊理论模糊关系模糊聚类模糊应用

DOI：

分类号:

基金项目:国家863高科技发展计划资助项目(863-306-ZT06-01-4)；山东省自然科学基金资助项目(Z99G01)

An Optimal Algorithm for Fuzzy Classification Problem

MA Jun,SHAO Lu

Abstract:

In this paper, the geometric meaning of the transitive closure of a fuzzy relation in corresponding fuzzy graph is first given. An optimal algorithm, which is based on the computation of graph connected components, for fuzzy classification problem is proposed. For any given n samples, the worst case time complexity T(n) of the algorithm satisfies that O(n)≤T(n)≤O(n²). Compared with the classic fuzzy classification algorithm, which is based on the computation of the transitive closure of a given relative matrix and of the O(n³log n) time, the new algorithm decreases O(nlog n) time factor at least. The theoretic analysis and computer performance show that the real computing time of the new algorithm is acceptable when it is used for fuzzy classification on large data.

Key words: fuzzy theory fuzzy relation fuzzy classification fuzzy application

引用本文: