Please use this identifier to cite or link to this item:
|Title:||Graph-based pairwise learning to rank for video search|
Learning to rank
|Source:||Liu, Y.,Mei, T.,Tang, J.,Wu, X.,Hua, X.-S. (2009). Graph-based pairwise learning to rank for video search. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5371 LNCS : 175-184. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-92892-8_18|
|Abstract:||Learning-based ranking is a promising approach to a variety of search tasks, which is aimed at automatically creating the ranking model based on training samples and machine learning techniques. However, the problem of lacking training samples labeled with relevancy degree or ranking orders is frequently encountered. To address this problem, we propose a novel graph-based learning to rank (GLRank) for video search by leveraging the vast amount of unlabeled samples. A relation graph is constructed by using sample (i.e., video shot) pairs rather than individual samples as vertices. Each vertex in this graph represents the "relevancy relation" between two samples in a pair (i.e., which sample is more relevant to the given query). Such relevancy relation is discovered through a set of pre-trained concept detectors and then propagated among the pairs. When all the pairs, constructed with the samples to be searched, receive the propagated relevancy relation, a round robin criterion is proposed to obtain the final ranking list. We have conducted comprehensive experiments on automatic video search task over TRECVID 2005-2007 benchmarks and shown significant and consistent improvements over the other state-of-the-art ranking approaches. © 2008 Springer Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 22, 2018
checked on Jan 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.