DocumentCode :
3037139
Title :
Concentration estimation of regularized ranking algorithm
Author :
Chen, Hong ; Tao, Yanfang ; Lu, Weijun
Author_Institution :
Coll. of Sci., Huazhong Agric. Univ., Wuhan, China
fYear :
2011
fDate :
26-28 July 2011
Firstpage :
2438
Lastpage :
2439
Abstract :
The problem of ranking has recently gained much attention in machine learning. In this paper, we investigate the generalization performance of the regularized ranking algorithm associated with least square ranking loss in a reproducing kernel Hilbert space. Based on the stability analysis, we obtain sample error bounds for this algorithm.
Keywords :
Hilbert spaces; generalisation (artificial intelligence); information retrieval; learning (artificial intelligence); least squares approximations; concentration estimation; error bounds; generalization performance; information retrieval; kernel Hilbert space; least square ranking loss; machine learning; regularized ranking algorithm; stability analysis; Algorithm design and analysis; Classification algorithms; Kernel; Machine learning; Machine learning algorithms; Stability analysis; Zinc; error estimation; ranking; stability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multimedia Technology (ICMT), 2011 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-61284-771-9
Type :
conf
DOI :
10.1109/ICMT.2011.6002413
Filename :
6002413
Link To Document :
بازگشت