AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.5 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Ranking with Adaptive Neighbors

Cixi Hanvos Yucai High School, Ningbo 315300, China.
School of Computing, Informatics, Decision Systems Engineering, Arizona State University, Tempe, AZ 85281, US.
School of Computer Science and Center for OPTical IMagery Analysis and Learning (OPTIMAL), Northwestern Polytechnical University, Xi’an 710072, China.
Show Author Information

Abstract

Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, to document retrievals. State-of-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds. Graph-based approaches, in particular, define various diffusion processes on weighted data graphs. Despite success, these approaches rely on fixed-weight graphs, making ranking sensitive to the input affinity matrix. In this study, we propose a new ranking algorithm that simultaneously learns the data affinity matrix and the ranking scores. The proposed optimization formulation assigns adaptive neighbors to each point in the data based on the local connectivity, and the smoothness constraint assigns similar ranking scores to similar data points. We develop a novel and efficient algorithm to solve the optimization problem. Evaluations using synthetic and real datasets suggest that the proposed algorithm can outperform the existing methods.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 733-738

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Li M, Li L, Nie F. Ranking with Adaptive Neighbors. Tsinghua Science and Technology, 2017, 22(6): 733-738. https://doi.org/10.23919/TST.2017.8195354

1111

Views

75

Downloads

0

Crossref

N/A

Web of Science

2

Scopus

1

CSCD

Received: 25 June 2017
Revised: 08 August 2017
Accepted: 24 August 2017
Published: 14 December 2017
© The author(s) 2017