首页> 外文会议>International conference on artificial neural networks >Learning Preferences for Large Scale Multi-label Problems
【24h】

Learning Preferences for Large Scale Multi-label Problems

机译:大规模多标签问题的学习偏好

获取原文

摘要

Despite that the majority of machine learning approaches aim to solve binary classification problems, several real-world applications require specialized algorithms able to handle many different classes, as in the case of single-label multi-class and multi-label classification problems. The Label Ranking framework is a generalization of the above mentioned settings, which aims to map instances from the input space to a total order over the set of possible labels. However, generally these algorithms are more complex than binary ones, and their application on large-scale datasets could be untractable. The main contribution of this work is the proposal of a novel general on-line preference-based label ranking framework. The proposed framework is able to solve binary, multi-class, multi-label and ranking problems. A comparison with other baselines has been performed, showing effectiveness and efficiency in a real-world large-scale multi-label task.
机译:尽管大多数机器学习方法都旨在解决二进制分类问题,但在一些实际应用中,需要能够处理许多不同类别的专用算法,例如在单标签多分类和多标签分类问题中。标签排名框架是上述设置的概括,旨在将实例从输入空间映射到可能标签集上的总顺序。但是,通常这些算法比二进制算法更复杂,并且它们在大规模数据集上的应用可能难以处理。这项工作的主要贡献是提出了一种新颖的,基于偏好的新型在线在线标签排名框架。所提出的框架能够解决二进制,多类,多标签和排名问题。已与其他基准进行了比较,显示了在现实世界中大规模多标签任务的有效性和效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号