QQ客服 官方微博 反馈留言

	An incremental subspace learning algorithm to categorize large scale text data
	Yan, Jun ; Cheng, Qiansheng ; Yang, Qiang ; Zhang, Benyu
	2005
英文摘要	The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Inter-class Scatter (US) algorithm. Unlike traditional batch learners, US learns from a stream of training data, not a set. US overcomes the inherent problem of some other incremental operations such as Incremental Principal Component Analysis (PCA) and Incremental Linear Discriminant Analysis (LDA). The experimental results on the synthetic datasets show that US performs as well as LDA and is more robust against noise. In addition, the experiments on the Reuters Corpus Volume l (RCV1) dataset show that US outperforms state-of-the-art Incremental Principal Component Analysis (IPCA) algorithm, a related algorithm, and Information Gain in efficiency and effectiveness respectively. ? Springer-Verlag Berlin Heidelberg 2005.; EI; 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/315569]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Yan, Jun,Cheng, Qiansheng,Yang, Qiang,et al. An incremental subspace learning algorithm to categorize large scale text data. 2005-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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