期刊文献+

排序问题中的范数学习算法

Norm Learning Methods for Ranking
下载PDF
导出
摘要 为了更直接地定义点对间的序关系,引入了排序问题的范数学习模型。该模型利用样本空间中的范数类描述样本间的不同序关系。借鉴范数学习的思想,得到了有效处理此类排序学习问题的贪婪学习算法。实验结果表明,此类算法排序效果良好。 Ranking is a valuable problem in the field of machine learning. To directly measure the ranking relation between both elements, a novel norm learning ranking model is reported. The model uses different ranking relations of the norm functions defined on the sample space. By using the norm learning methods, an optimal learning algorithm is obtained. Experimental results show that the reported ranking algorithm is effective.
作者 黄斌
出处 《江南大学学报(自然科学版)》 CAS 2013年第2期145-151,共7页 Joural of Jiangnan University (Natural Science Edition) 
基金 福建省科技重点项目(2012H0033) 福建星火科技基金项目(2010S0017) 瞬态光学与光子技术国家重点实验室开放基金项目(SKLST201113) 莆田市科技基金项目(2011G04-2)
关键词 排序问题 范数学习 贪婪学习 ranking, norm learning, greedy learning
  • 相关文献

参考文献19

  • 1Herbrich R, Graepel T, Obermayer K. Large marginrank boundaries for ordinal regression [ C ]// Advances in Large Margin Classifiers Cambridge. MA : MIT Press ,2000 : 115-132.
  • 2Crammer K, Singer Y. Pranking with ranking[ C ]// Advances in Neural Information Processing Systemsl4. Vancouver: MIT Press, 2001:641-647.
  • 3Rudin C. The P-Norm Push : a simple convex ranking algorithm that concentrates at the top of the list [ J ]. Journal of Machine Learning Research, 2009, 10: 2233-2271.
  • 4Cossock D, ZHANG T. Subset ranking using regression [ J ]. Lecture Notes in Computer Science, 2006,4005:605-619.
  • 5Freund Y, Iyer R, Schapire R, et al. An efficient boosting algorithm for combining preferences [ J ]. Journal of Machine Learning Research, 2003, 4 : 933-969.
  • 6Rudin C, Schapire R. Margin-based ranking and an equivalence between adaBoost and rankBoost [ J ]. Journal of Machine Learning Research, 2009, 10: 2193-2232.
  • 7Clemencon S, Vayatis N. Ranking the best instances[ J]. Journal of Machine Learning Research, 2007, 8: 2671-2699.
  • 8Clemencon S, Vayatis N. Empirical performance maximization for linear rank statistics[ C ]// Advances in Neural Information Processing Systems 21. Vancouver: MIT Press, 2008 : 305-312.
  • 9Clemencon S, Lugosi G, Vayatis N. Ranking and empirical minimization of U-statistics [ J]. The Annals of Statistics,2008, 36 (2) :844-874.
  • 10Ailon N, Mohri M. An efficient reduction of ranking to classification [ C ]//Proceedings of the 21st Annual Conference on Learn- ing Theory. Heidelberg : Springer, 2008 : 87-98.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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