QQ客服 官方微博 反馈留言

	Counterexamples to convergence theorem of maximum-entropy clustering algorithm
	Yu, J ; Shi, HB ; Huang, HK ; Sun, XC ; Cheng, QS
	2003
关键词	entropy fixed point clustering algorithm convergence
英文摘要	In this paper, we surveyed the development of maximum-entropy clustering algorithm, pointed out that the maximum-entropy clustering algorithm is not new in essence, and constructed two examples to show that the iterative sequence given by the maximum-entropy clustering algorithm may not converge to a local minimum of its objective function, but a saddle point. Based on these results, our paper shows that the convergence theorem of maximum-entropy clustering algorithm put forward by Kenneth Rose et al. does not hold in general cases.; Computer Science, Information Systems; SCI(E); 5; ARTICLE; 5; 321-326; 46
语种	英语
出处	SCI
出版者	science in china series f information sciences
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/255682]
专题	数学科学学院
推荐引用方式 GB/T 7714	Yu, J,Shi, HB,Huang, HK,et al. Counterexamples to convergence theorem of maximum-entropy clustering algorithm. 2003-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。