Hypergraph spectral learning for multi-label classification

Liang Sun, Shuiwang Ji, Jieping Ye

Research output: Chapter in Book/Report/Conference proceedingConference contribution

166 Citations (Scopus)

Abstract

A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture high-order relations in various domains. In this paper, we propose a hypergraph spectral learning formulation for multi-label classification, where a hypergraph is constructed to exploit the correlation information among different labels. We show that the proposed formulation leads to an eigenvalue problem, which may be computationally expensive especially for large-scale problems. To reduce the computational cost, we propose an approximate formulation, which is shown to be equivalent to a least squares problem under a mild condition. Based on the approximate formulation, efficient algorithms for solving least squares problems can be applied to scale the formulation to very large data sets. In addition, existing regularization techniques for least squares can be incorporated into the model for improved generalization performance. We have conducted experiments using large-scale benchmark data sets, and experimental results show that the proposed hypergraph spectral learning formulation is effective in capturing the high-order relations in multi-label problems. Results also indicate that the approximate formulation is much more efficient than the original one, while keeping competitive classification performance.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Pages668-676
Number of pages9
DOIs
StatePublished - 2008
Event14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008 - Las Vegas, NV, United States
Duration: Aug 24 2008Aug 27 2008

Other

Other14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008
CountryUnited States
CityLas Vegas, NV
Period8/24/088/27/08

Fingerprint

Labels
Costs
Experiments

Keywords

  • Canonical correlation analysis
  • Efficiency
  • Hypergraph
  • Least squares
  • Multi-label classification
  • Regularization
  • Spectral learning

ASJC Scopus subject areas

  • Software
  • Information Systems

Cite this

Sun, L., Ji, S., & Ye, J. (2008). Hypergraph spectral learning for multi-label classification. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 668-676) https://doi.org/10.1145/1401890.1401971

Hypergraph spectral learning for multi-label classification. / Sun, Liang; Ji, Shuiwang; Ye, Jieping.

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2008. p. 668-676.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sun, L, Ji, S & Ye, J 2008, Hypergraph spectral learning for multi-label classification. in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 668-676, 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008, Las Vegas, NV, United States, 8/24/08. https://doi.org/10.1145/1401890.1401971
Sun L, Ji S, Ye J. Hypergraph spectral learning for multi-label classification. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2008. p. 668-676 https://doi.org/10.1145/1401890.1401971
Sun, Liang ; Ji, Shuiwang ; Ye, Jieping. / Hypergraph spectral learning for multi-label classification. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2008. pp. 668-676
@inproceedings{c116f5efe75a403cbccef427c0e773cc,
title = "Hypergraph spectral learning for multi-label classification",
abstract = "A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture high-order relations in various domains. In this paper, we propose a hypergraph spectral learning formulation for multi-label classification, where a hypergraph is constructed to exploit the correlation information among different labels. We show that the proposed formulation leads to an eigenvalue problem, which may be computationally expensive especially for large-scale problems. To reduce the computational cost, we propose an approximate formulation, which is shown to be equivalent to a least squares problem under a mild condition. Based on the approximate formulation, efficient algorithms for solving least squares problems can be applied to scale the formulation to very large data sets. In addition, existing regularization techniques for least squares can be incorporated into the model for improved generalization performance. We have conducted experiments using large-scale benchmark data sets, and experimental results show that the proposed hypergraph spectral learning formulation is effective in capturing the high-order relations in multi-label problems. Results also indicate that the approximate formulation is much more efficient than the original one, while keeping competitive classification performance.",
keywords = "Canonical correlation analysis, Efficiency, Hypergraph, Least squares, Multi-label classification, Regularization, Spectral learning",
author = "Liang Sun and Shuiwang Ji and Jieping Ye",
year = "2008",
doi = "10.1145/1401890.1401971",
language = "English (US)",
isbn = "9781605581934",
pages = "668--676",
booktitle = "Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",

}

TY - GEN

T1 - Hypergraph spectral learning for multi-label classification

AU - Sun, Liang

AU - Ji, Shuiwang

AU - Ye, Jieping

PY - 2008

Y1 - 2008

N2 - A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture high-order relations in various domains. In this paper, we propose a hypergraph spectral learning formulation for multi-label classification, where a hypergraph is constructed to exploit the correlation information among different labels. We show that the proposed formulation leads to an eigenvalue problem, which may be computationally expensive especially for large-scale problems. To reduce the computational cost, we propose an approximate formulation, which is shown to be equivalent to a least squares problem under a mild condition. Based on the approximate formulation, efficient algorithms for solving least squares problems can be applied to scale the formulation to very large data sets. In addition, existing regularization techniques for least squares can be incorporated into the model for improved generalization performance. We have conducted experiments using large-scale benchmark data sets, and experimental results show that the proposed hypergraph spectral learning formulation is effective in capturing the high-order relations in multi-label problems. Results also indicate that the approximate formulation is much more efficient than the original one, while keeping competitive classification performance.

AB - A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture high-order relations in various domains. In this paper, we propose a hypergraph spectral learning formulation for multi-label classification, where a hypergraph is constructed to exploit the correlation information among different labels. We show that the proposed formulation leads to an eigenvalue problem, which may be computationally expensive especially for large-scale problems. To reduce the computational cost, we propose an approximate formulation, which is shown to be equivalent to a least squares problem under a mild condition. Based on the approximate formulation, efficient algorithms for solving least squares problems can be applied to scale the formulation to very large data sets. In addition, existing regularization techniques for least squares can be incorporated into the model for improved generalization performance. We have conducted experiments using large-scale benchmark data sets, and experimental results show that the proposed hypergraph spectral learning formulation is effective in capturing the high-order relations in multi-label problems. Results also indicate that the approximate formulation is much more efficient than the original one, while keeping competitive classification performance.

KW - Canonical correlation analysis

KW - Efficiency

KW - Hypergraph

KW - Least squares

KW - Multi-label classification

KW - Regularization

KW - Spectral learning

UR - http://www.scopus.com/inward/record.url?scp=65449185036&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=65449185036&partnerID=8YFLogxK

U2 - 10.1145/1401890.1401971

DO - 10.1145/1401890.1401971

M3 - Conference contribution

SN - 9781605581934

SP - 668

EP - 676

BT - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

ER -