...
首页> 外文期刊>Knowledge and Data Engineering, IEEE Transactions on >PruDent: A Pruned and Confident Stacking Approach for Multi-Label Classification
【24h】

PruDent: A Pruned and Confident Stacking Approach for Multi-Label Classification

机译:PruDent:经过修剪和自信的多标签分类堆叠方法

获取原文
获取原文并翻译 | 示例
           

摘要

Over the past decade or so, several research groups have addressed the problem of where each example can belong to more than one class at the same time. A common approach, called  , addresses this problem by inducing a separate classifier for each class. Research has shown that this framework can be improved if mutual class dependence is exploited: an example that belongs to class is likely to belong also to class ; conversely, belonging to can make an example less likely to belong to . Several works sought to model this information by using the vector of class labels as additional example attributes. To fill the unknown values of these attributes during prediction, existing methods resort to using outputs of other classifiers, and this makes them prone to errors. This is where our paper wants to contribute. We identified two potential ways to prune unnecessary dependencies and to reduce error-propagation in our new classifier-stacking technique, which is named . Experimental results indicate that the classification performance of compares favorably with that of other state-of-the-art approaches over a broad range of testbeds. Mor- over, its computational costs grow only linearly in the number of classes.
机译:在过去十年左右的时间里,几个研究小组解决了每个示例可以同时属于多个类别的问题。一种通用的方法称为``方法'',它通过为每个类引入一个单独的分类器来解决此问题。研究表明,如果利用相互依赖的类,则可以改进此框架。相反,属于可以使一个示例不太可能属于。一些工作试图通过使用类标签的向量作为附加示例属性来对此信息进行建模。为了在预测期间填充这些属性的未知值,现有方法求助于使用其他分类器的输出,这使它们易于出错。这是我们的论文想要贡献的地方。我们在名为的新分类器堆栈技术中确定了两种修剪不必要的依赖关系并减少错误传播的潜在方法。实验结果表明,在广泛的测试平台上,的分类性能可与其他最新方法的分类性能相媲美。而且,其计算成本仅随着类的数量呈线性增长。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号