Title
Query-specific optimal convolutional neural ranker
Abstract
In this paper, we propose a novel learning-to-rank method by developing a convolutional neural network (CNN)-based ranking score estimation function (ranker). We use the query, query-specific preference, and the neighborhood structure to regularize the learning of the CNN ranker parameters. We propose to impose the CNN outputs of a query-preferred data object to be larger than that of a data object which the query tries to avoid. Also we hope the ranking scores of the data objects can be smooth over neighborhoods and the ranking score of the query itself can be large. We construct a joint unified minimization problem by combining these regularization problems to learn the parameters of CNN, and develop an iterative algorithm based on fix-point method. The experiments over the benchmark data sets of image retrieval and ship roll motion prediction show its effectiveness.
Year
DOI
Venue
2019
10.1007/s00521-017-3257-4
Neural Computing and Applications
Keywords
Field
DocType
Learning to rank, Convolutional neural network, Query-specific preference, Ship roll motion prediction
Learning to rank,Data set,Ranking,Iterative method,Convolutional neural network,Image retrieval,Regularization (mathematics),Artificial intelligence,Data objects,Machine learning,Mathematics
Journal
Volume
Issue
ISSN
31
7
1433-3058
Citations 
PageRank 
References 
0
0.34
23
Authors
4
Name
Order
Citations
PageRank
Jingzheng Yao100.68
Jingzheng Yao200.68
Feng Liu301.35
Yanyan Geng411.04