mlsanityData to 7 Oct 2026

Learning Hypergraph-regularized Attribute Predictors

arXiv 1503.05782 ↗First posted 19 Mar 2015cs.CV cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

We present a novel attribute learning framework named Hypergraph-based Attribute Predictor (HAP). In HAP, a hypergraph is leveraged to depict the attribute relations in the data. Then the attribute prediction problem is casted as a regularized hypergraph cut problem in which HAP jointly learns a collection of attribute projections from the feature space to a hypergraph embedding space aligned with the attribute space. The learned projections directly act as attribute classifiers (linear and kernelized). This formulation leads to a very efficient approach. By considering our model as a multi-graph cut task, our framework can flexibly incorporate other available information, in particular class label. We apply our approach to attribute prediction, Zero-shot and N-shot learning tasks. The results on AWA, USAA and CUB databases demonstrate the value of our methods in comparison with the state-of-the-art approaches.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Mar 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 4; 2024: 4; 2025: 3; 2026: 1.

13 papers.

Sort:

By area: