...
首页> 外文期刊>Signal processing >Hypergraph canonical correlation analysis for multi-label classification
【24h】

Hypergraph canonical correlation analysis for multi-label classification

机译:用于多标签分类的超图典范相关分析

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

获取外文期刊封面封底 >>

       

摘要

In recent years, multi-label classification has attracted lots of attention due to its widespread applications, such as multi-topic image annotation and webpage categorization. To this end, a number of methods have been developed to explore the inherent correlations existing among multiple labels, which are essentially important for multi-label models. However, most of them cannot employ the high-order relationships among labels to learn better models. To overcome this shortcoming, we propose to construct a hypergraph for exploiting the high-order label relations and present a novel framework for multi-label classification named Hypergraph Canonical Correlation Analysis (HCCA). This approach is based on canonical correlation analysis, and it further takes into account the high-order label structure information via hypergraph regularization. Thus, the label relations can be better respected both globally by the normalized similarity matrix of CCA and locally by the normalized hypergraph Laplacian in a unified framework. In concrete, the objective function can be optimized by solving a generalized eigenvalue problem, but this requests heavy computational overheads for large-scale data. Therefore, we show a more efficient method that approximates the original problem by the least squares formulation under a mild condition. Furthermore, we have studied the influences of the ridge regularization on our method. Experimental results on several real-world multi-label data sets have justified the effectiveness of the proposed method.
机译:近年来,多标签分类由于其广泛的应用而受到了广泛的关注,例如多主题图像注释和网页分类。为此,已经开发了许多方法来探索多个标签之间存在的固有相关性,这对于多标签模型至关重要。但是,它们中的大多数不能利用标签之间的高级关系来学习更好的模型。为克服此缺点,我们建议构造一个利用高阶标签关系的超图,并提出一种用于多标签分类的新颖框架,称为超图规范相关分析(HCCA)。该方法基于规范相关分析,并且通过超图正则化进一步考虑了高阶标签结构信息。因此,在统一的框架中,可以通过CCA的归一化相似度矩阵在全局上更好地尊重标签关系,也可以通过规范化的超图Laplacian在本地更好地尊重标签关系。具体而言,可以通过解决广义特征值问题来优化目标函数,但是这需要大规模数据的大量计算开销。因此,我们显示了一种在温和条件下通过最小二乘公式近似近似原始问题的有效方法。此外,我们研究了脊正则化对我们方法的影响。在多个真实世界的多标签数据集上的实验结果证明了该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号