一种可扩展的多标记学习问题转换方法
On a scalable problem transformation method for multi-label learning
摘要:
二进制相关性是解决多标签学习问题的一种简单方法,其中每个标签都构建了一个独立的二进制分类器。在现实世界的应用中,一个常见的挑战是标签空间可能非常大,这使得很难使用二进制相关性来解决更大规模的问题。在本文中,我们提出了一个可扩展的替代方案,通过将多标签问题转化为一个单一的二进制分类。我们的方法的几个变化进行了实验,并表明我们的方法实现了更高的精度比二进制相关性和更快的执行时间上的前K推荐系统任务。
英文摘要:
Binary relevance is a simple approach to solve multi-label learning problems where an independent binary classifier is built per each label. A common challenge with this in real-world applications is that the label space can be very large, making it difficult to use binary relevance to larger scale problems. In this paper, we propose a scalable alternative to this, via transforming the multi-label problem into a single binary classification. We experiment with a few variations of our method and show that our method achieves higher precision than binary relevance and faster execution times on a top-K recommender system task.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。