首页 | 本学科首页   官方微博 | 高级检索  
     

The upper bound of the optimal number of clusters in fuzzy clustering
作者姓名:于剑  程乾生
基金项目:This work was supported by the National Natural Science Foundation of China (Grant Nos. 69872003 and 40035010)
摘    要:The upper bound of the optimal number of clusters in clustering algorithm is studied in this paper. A new method is proposed to solve this issue. This method shows that the rule cmax≤n~(1/n), which is popular in current papers, is reasonable in some sense. The above conclusion is tested and analyzed by some typical examples in the literature, which demonstrates the validity of the new method.

收稿时间:8 August 2000

The upper bound of the optimal number of clusters in fuzzy clustering
YU Jian,CHENG Qiansheng.The upper bound of the optimal number of clusters in fuzzy clustering[J].Science in China(Information Sciences),2001,44(2):119-125.
Authors:YU Jian  CHENG Qiansheng
Affiliation:Department of Computer Science and Technology, North Jiaotang University,
Abstract:The upper bound of the optimal number of clusters in clustering algorithm is studied in this paper. A new method is proposed to solve this issue. This method shows that the rulec max ≤ √n, which is popular in current papers, is reasonable in some sense. The above conclusion is tested and analyzed by some typical examples in the literature, which demonstrates the validity of the new method.
Keywords:clustering algorithm  cluster validity  the optimal number of clusters  uncertainty  fuzzy clustering  
本文献已被 CNKI 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号