Regularized Ranking with Convex Losses and -Penalty

Heng Chen and Jitao Wu

Abstract and Applied Analysis, 2013, vol. 2013, 1-8

Abstract:

In the ranking problem, one has to compare two different observations and decide the ordering between them. It has received increasing attention both in the statistical and machine learning literature. This paper considers -regularized ranking rules with convex loss. Under some mild conditions, a learning rate is established.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2013/927827.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2013/927827.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:927827

DOI: 10.1155/2013/927827

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem (mohamed.abdelhakeem@hindawi.com).