.png){kind=icon}
返回
Efficient voting prediction for pairwise multilabel classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2009.11.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The pairwise approach to multilabel classification reduces the problem to learning and aggregating preference predictions among the possible labels. A key problem is the need to query a quadratic number of preferences for making a prediction. To solve this problem, we extend the recently proposed QWeighted algorithm for efficient pairwise multiclass voting to the multilabel setting, and evaluate the adapted algorithm on several real-world datasets. We achieve an average-case reduction of classifier evaluations from n(2) to n + dn log n, where n is the total number of possible labels and d is the average number of labels per instance, which is typically quite small in real-world datasets. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Multilabel classification
Voting aggregation
Learning by pairwise comparison
Efficient classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。