On the convergence rate and some applications of regularized ranking algorithms

dc.contributor.authorKriukova, Galyna
dc.contributor.authorPereverzyev, Sergei V.
dc.contributor.authorTkachenko, Pavlo
dc.date.accessioned2017-06-14T14:22:32Z
dc.date.available2017-06-14T14:22:32Z
dc.date.issued2016
dc.description.abstractThis paper studies the ranking problem in the context of the regularization theory that allows a simultaneous analysis of a wide class of ranking algorithms. Some of them were previously studied separately. For such ones, our analysis gives a better convergence rate compared to the reported in the literature. We also supplement our theoretical results with numerical illustrations and discuss the application of ranking to the problem of estimating the risk from errors in blood glucose measurements of diabetic patients.en
dc.identifier.citationKriukova Galyna. On the convergence rate and some applications of regularized ranking algorithms / Galyna Kriukova, Sergei V. Pereverzyev, Pavlo Tkachenko // Journal of Complexity. - 2016. - Vol. 33, April. - P. 14-29.uk
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/11576
dc.identifier.urihttp://dx.doi.org/10.1016/j.jco.2015.09.004en
dc.language.isoenuk
dc.relation.sourceJournal of Complexityuk
dc.statuspublished earlieruk
dc.subjectrankingen
dc.subjectconvergence rateen
dc.subjectsource conditionen
dc.subjectblood glucose error griden
dc.titleOn the convergence rate and some applications of regularized ranking algorithmsen
dc.typeArticleuk
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.54 KB
Format:
Item-specific license agreed upon to submission
Description: