When coding meets ranking: A joint framework based on local learning

09/08/2014
by   Jim Jing-Yan Wang, et al.
0

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/31/2015

A novel multivariate performance optimization method based on sparse coding and hyper-predictor learning

In this paper, we investigate the problem of optimization multivariate p...
research
11/26/2013

Semi-Supervised Sparse Coding

Sparse coding approximates the data sample as a sparse linear combinatio...
research
11/24/2020

The Interpretable Dictionary in Sparse Coding

Artificial neural networks (ANNs), specifically deep learning networks, ...
research
03/14/2018

Ranking with Adaptive Neighbors

Retrieving the most similar objects in a large-scale database for a give...
research
11/20/2019

Discriminative Local Sparse Representation by Robust Adaptive Dictionary Pair Learning

In this paper, we propose a structured Robust Adaptive Dic-tionary Pair ...
research
10/04/2017

Energy-Based Spherical Sparse Coding

In this paper, we explore an efficient variant of convolutional sparse c...
research
06/18/2012

Learning Efficient Structured Sparse Models

We present a comprehensive framework for structured sparse coding and mo...

Please sign up or login with your details

Forgot password? Click here to reset