基于最小熵正则化的半监督分类  

Semi-Supervised Classification Based on Regularization of Minimum Entropy

作　　者：刘小兰[1,2] 郝志峰[3] 杨晓伟[2] 马献恒[4] 

机构地区：[1]华南理工大学计算机科学与工程学院,广东广州510006 [2]华南理工大学理学院,广东广州510640 [3]广东工业大学计算机学院,广东广州510090 [4]华南理工大学软件学院,广东广州510006

出　　处：《华南理工大学学报（自然科学版）》2010年第1期87-91,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：广东省-教育部产学研结合项目(2007B090400031);广东省科技计划项目(2008B080701005)

摘　　要：生成式模型需要对复杂的联合概率密度建模,并估计较多的参数,为此,文中提出了一种基于最小熵正则化的半监督分类算法.该算法利用Havrda-Charvat's结构α-熵作为目标的正则项,并用拟牛顿法进行求解.该算法既是判别式的,又是直推式的,从而降低了对模型的依赖程度,同时可以方便地预测训练集之外的示例标记.在UCI数据库上的仿真实验结果表明,所提出的算法即使在有标记数据较少的情况下仍能获得较低的分类误差.As the generative model needs modelling complex joint probability density and evaluating many parameters, a discriminant semi-supervised classification algorithm based on the regularization of minimum entropy is proposed. This algorithm uses Havrda-Charvat＇s structural α-entropy as the regularization item of the objective and employs the quasi-Newton method to solve the objective, which makes the algorithm discriminative and inductive and reduces the dependence of the algorithm on the model. At the same time, the algorithm can predict the labels of the out-of-sample data points easily. Simulated results of several UCI datasets demonstrate that the proposed algorithm is of low classification error even with few labeled data.

关 键 词：半监督学习 条件Havrda—Charvat’s结构 α-熵 正则化 模式分类 拟牛顿法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]