Computer Science – Learning
Scientific paper
2011-12-08
Computer Science
Learning
arXiv admin note: substantial text overlap with arXiv:1108.2820
Scientific paper
Unsupervised aggregation of independently built univariate predictors is explored as an alternative regularization approach for noisy, sparse datasets. Bipartite ranking algorithm Smooth Rank implementing this approach is introduced. The advantages of this algorithm are demonstrated on two types of problems. First, Smooth Rank is applied to two-class problems from bio-medical field, where ranking is often preferable to classification. In comparison against SVMs with radial and linear kernels, Smooth Rank had the best performance on 8 out of 12 benchmark benchmarks. The second area of application is survival analysis, which is reduced here to bipartite ranking in a way which allows one to use commonly accepted measures of methods performance. In comparison of Smooth Rank with Cox PH regression and CoxPath methods, Smooth Rank proved to be the best on 9 out of 10 benchmark datasets.
No associations
LandOfFree
Bipartite ranking algorithm for classification and survival analysis 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 Bipartite ranking algorithm for classification and survival analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite ranking algorithm for classification and survival analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-43060