Show simple item record

dc.contributor.authorWang, Jim Jing-Yan
dc.contributor.authorCui, Xuefeng
dc.contributor.authorYu, Ge
dc.contributor.authorGuo, Lili
dc.contributor.authorGao, Xin
dc.date.accessioned2017-10-03T12:49:31Z
dc.date.available2017-10-03T12:49:31Z
dc.date.issued2017-06-28
dc.identifier.citationWang JJ-Y, Cui X, Yu G, Guo L, Gao X (2017) When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores. Neural Computing and Applications. Available: http://dx.doi.org/10.1007/s00521-017-3102-9.
dc.identifier.issn0941-0643
dc.identifier.issn1433-3058
dc.identifier.doi10.1007/s00521-017-3102-9
dc.identifier.urihttp://hdl.handle.net/10754/625649
dc.description.abstractSparse 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.
dc.description.sponsorshipThe research reported in this publication was supported by funding from King Abdullah University of Science and Technology (KAUST) and the National Natural Science Foundation of China under the Grant No. 61502463.
dc.publisherSpringer Nature
dc.relation.urlhttp://link.springer.com/article/10.1007/s00521-017-3102-9
dc.rightsThe final publication is available at Springer via http://dx.doi.org/10.1007/s00521-017-3102-9
dc.subjectDatabase retrieval
dc.subjectData representation
dc.subjectSparse coding
dc.subjectLearning to rank
dc.subjectNearest neighbors
dc.titleWhen sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores
dc.typeArticle
dc.contributor.departmentComputational Bioscience Research Center (CBRC)
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentComputer Science Program
dc.identifier.journalNeural Computing and Applications
dc.eprint.versionPost-print
dc.contributor.institutionKey Laboratory of Space Utilization, Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, Beijing, China
kaust.personWang, Jim Jing-Yan
kaust.personCui, Xuefeng
kaust.personGao, Xin
refterms.dateFOA2018-06-28T00:00:00Z
dc.date.published-online2017-06-28
dc.date.published-print2019-03


Files in this item

Thumbnail
Name:
SparCod-Rank NCAA R1 170427.pdf
Size:
218.9Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record