Moment-preserving clustering

ASIA unversity > 資訊學院 > 資訊傳播學系 > 會議論文 > Item 310904400/6823

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6823

题名:	Moment-preserving clustering
作者:	S. T. Liu;W. H. Tsai
贡献者:	Department of Information Communication
关键词:	Clustering;Patterns;Moment-preserving thresholding;Karhunen-Loeve expansion;Major portion;Central region;Shrinking;Split-and-merge
日期:	1987-12
上传时间:	2009-12-23 11:34:28 (UTC+0)
出版者:	Asia University
摘要:	A new pattern clustering method based on the Karhunen-Loeve expansion and moment-preserving thresholding is proposed. For a given set of unlabeled, nonparametric patterns with the number of clusters unknown a priori, if the patterns in each cluster are densely populated and the region between any two clusters is sparsely populated, then the proposed method can be employed to classify the patterns into clusters. The method consists basically of the use of the Karhunen-Loeve expansion to determine the directions for successive cluster analysis steps, the application of moment-preserving thresholding to find the major portion of a given pattern set, and a split-and-merge process for cluster construction. The phenomenon of cluster overlapping in any direction is overcome by the idea of successively shrinking an approximation of the major portion of the pattern set, called central region, within which splitting is performed. Examples are included to show the effectiveness of the method.
關聯:	Proceedings of 1987 National Computer Symposium, Taipei, Taiwan, Republic of China
显示于类别:	[資訊傳播學系] 會議論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	389	检视/开启
310904400-6823.doc		31Kb	Microsoft Word	246	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.