Large-scale Linear RankSVM
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 101 === Linear rankSVM is one of the widely used methods for learning to rank. Although its performance may be inferior to nonlinear methods such as kernel rankSVM and gradient boosting decision trees, linear rankSVM is useful to quickly produce a baseline model. Furth...
Main Authors: | Ching-Pei Lee, 李靜沛 |
---|---|
Other Authors: | Chih-Jen Lin |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/95333963386449972611 |
Similar Items
-
Analysis and Implementation of Large-scale Linear RankSVM in Distributed Environments
by: Wei-Lun Huang, et al.
Published: (2016) -
Data selection techniques for large-scale RankSVM
by: Ken-Yi Lin, et al.
Published: (2010) -
Application of MapReduce to Ranking SVM for Large-Scale Datasets
by: Su-Hsien Hu, et al.
Published: (2010) -
An SVM ranking approach to stress assignment
by: Dou, Qing
Published: (2009) -
Active Sampling of Pairs and Points for Large-scale Linear Bipartite Ranking
by: Wei-Yuan Shen, et al.
Published: (2013)