Row and Column Generation Algorithm for Maximization of Minimum Margin for Ranking Problems

Yoichi Izunaga (), Keisuke Sato (), Keiji Tatsumi () and Yoshitsugu Yamamoto ()
Additional contact information
Yoichi Izunaga: University of Tsukuba
Keisuke Sato: Railway Technical Research Institute
Keiji Tatsumi: Osaka University
Yoshitsugu Yamamoto: University of Tsukuba

A chapter in Operations Research Proceedings 2014, 2016, pp 249-255 from Springer

Abstract: Abstract We consider the ranking problem of learning a ranking function from the data set of objects each of which is endowed with an attribute vector and a ranking label chosen from the ordered set of labels. We propose two different formulations: primal problem, primal problem with dual representation of normal vector, and then propose to apply the kernel technique to the latter formulation. We also propose algorithms based on the row and column generation in order to mitigate the computational burden due to the large number of objects.

Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-319-28697-6_35

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_35

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().