期刊文献+

基于相近原则的半指导直推学习机及其增量算法 被引量:2

Transductive Learning Machines Based on the Affinity-rule for Semi-supervised Problem and Its Incremental Algorithm
原文传递
导出
摘要 半指导问题是近来机器学习研究中的备受关注一个重要内容.本文以满足“在输入空间中相近的对象其输出也相近”这一源于直观事实的原则(相近原则)去解决半指导学习问题,给出在这个原则下的一个一般的直接推理方法—基于相近原则的半指导问题直推学习机,得到了这个问题的解析解及迭代算法,用模式分类实例验证该方法的有效性,并给出适于在线处理的增量学习算法,这些增量算法尤其还适于新增了有指导的信息的场合. Semi-supervised problem, as one of important contents in machine learning, has gained much attention in recent years. In this paper, the so-called affinity-rule, which comes from the intuitive fact is that if two objects are close in input space then their outputs should also be close, is used to obtain a transductive inference for semi-supervised problem. To get the solution of semi-supervised learning problem satisfying the rule, transductive learning machines based on the affinity-rule are introduced as general method. The analytical solution for the problem and its iterated algorithm are obtained. Some examples about pattern classification are given to explain the validity of this method. A incremental learning algorithm adapted to on-line data processing is introduced. In addition, this incremental learning algorithm can be used to new supervised samples.
出处 《应用数学学报》 CSCD 北大核心 2006年第4期619-632,共14页 Acta Mathematicae Applicatae Sinica
基金 973计划(2002CB312206号)资助项目.
关键词 半指导学习 直推学习机 相近度量 增量算法 semi-supervised learning transductive learning machines kernel affinity measure incremental algorithm
  • 相关文献

参考文献1

二级参考文献6

  • 1张--,湖南数学年刊,1986年,2期,23页
  • 2逄明贤,数学年刊.A,1985年,6卷,3期,323页
  • 3胡家赣,计算数学,1983年,1期,72页
  • 4高益明,东北师大学报,1982年,3期,23页
  • 5游兆永,华中理工大学学报,1981年
  • 6沈光星.连对角占优矩阵的一些性质[J].计算数学,1990,12(2):132-135. 被引量:41

共引文献196

同被引文献15

  • 1科夫卡.机器学习[M].杭州:浙江教育出版社,1997.
  • 2Tu Z. Probabilistic boosting--tree: learning discriminative models for classification, recognition, and clustering [C]//. Proceeding of the 10th IEEE International Conference on Computer Vision, Beijing: IEEE Computer Society Press, 2005: 1589-1596.
  • 3Nigam K,McCallum A K,Thrun S,Mitchell T.Text classification from labeled and unlabeled documents using EM[J].Machine Learning,2000,39(2-3):103-134.
  • 4Joachims T.Transductive inference for text classification using support vector machines[G].In:Proc 16th Int'l Conf Machine Learning,Bled,Slovenia,1999,200-209.
  • 5Blum A,Mitchell T.Combining labeled and unlabeled data with co-training[G].In:Proc 16th Annual Conf Computational Learning Theory,Madison,WI,1998,92-100.
  • 6Breiman L.,Friedman,J.,Olshen,R.,and Stone,C.Classification and Regression Trees[M].Wadsworth,1984.
  • 7Breiman L.Random forests[J].Machine Learning,2001,45(1):5-32.
  • 8Cortes,C.,Vapnik,V.M.,.Support Vector Networks[J].Machine Learning,1995,20:273-297.
  • 9Dietterich,T.G.An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees:Bagging,Boosting,and Randomization[J].Machine Learning,2000,40:139-157.
  • 10Breiman,L.,Bagging Predictors[J].Machine Learning,1996,24(2):123-140.

引证文献2

二级引证文献83

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部