马军,邵陆.模糊聚类计算的最佳算法.软件学报,2001,12(4):578-581 |
模糊聚类计算的最佳算法 |
An Optimal Algorithm for Fuzzy Classification Problem |
投稿时间:1999-09-14 修订日期:1999-12-08 |
DOI: |
中文关键词: 模糊理论 模糊关系 模糊聚类 模糊应用 |
英文关键词:fuzzy theory fuzzy relation fuzzy classification fuzzy application |
基金项目:国家863高科技发展计划资助项目(863-306-ZT06-01-4);山东省自然科学基金资助项目(Z99G01) |
|
摘要点击次数: 3206 |
全文下载次数: 2805 |
中文摘要: |
给出模糊关系传递闭包在对应模糊图上的几何意义,并提出一个基于图连通分支计算的模糊聚类最佳算法.对任给的n个样本,新算法最坏情况下的时间复杂性函数T(n)满足O(n)≤T(n)≤O(n2).与经典的基于模糊传递闭包计算的模糊聚类算法的O(n3logn)计算时间相比,新算法至少降低了O(n |
英文摘要: |
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(n2). 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(n3log 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. |
HTML 下载PDF全文 查看/发表评论 下载PDF阅读器 |