کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6865109 1439554 2018 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Error bound of magnitude-preserving ranking with Fredholm kernel
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Error bound of magnitude-preserving ranking with Fredholm kernel
چکیده انگلیسی
Data-dependent Fredholm kernel has attracted much attention in machine learning literatures for its flexibility to utilize the empirical information. However, the previous theoretical results are limited to the classification or density ratio estimation problems. In this paper, we extend the framework of learning with Fredholm kernel to the ranking setting. A new magnitude-preserving ranking with Fredholm kernel is proposed, and its generalization error analysis is established by using the concentrate estimate techniques. The derived result implies that the proposed method can achieve the satisfactory learning rate with polynomial decay.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 273, 17 January 2018, Pages 296-303
نویسندگان
, , , ,