Training linear ranking SVMs in linearithmic time using red-black trees

Details Training linear ranking SVMs in linearithmic time using red-black trees Training linear ranking SVMs in linearithmic time using red-black trees

2010-05-06

arxiv.org/abs/1005.0928v2

Statistics

Machine Learning

20 pages, 4 figures

Scientific paper

We introduce an efficient method for training the linear ranking support vector machine. The method combines cutting plane optimization with red-black tree based approach to subgradient calculations, and has O(m*s+m*log(m)) time complexity, where m is the number of training examples, and s the average number of non-zero features per example. Best previously known training algorithms achieve the same efficiency only for restricted special cases, whereas the proposed approach allows any real valued utility scores in the training data. Experiments demonstrate the superior scalability of the proposed approach, when compared to the fastest existing RankSVM implementations.

Affiliated with

Also associated with

No associations

Rating

Training linear ranking SVMs in linearithmic time using red-black trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Training linear ranking SVMs in linearithmic time using red-black trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Training linear ranking SVMs in linearithmic time using red-black trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25879