Open Access
33- https://doi.org/10.1007/978-3-540-39857-8_28
Classification Approach towards Ranking and Sorting Problems
- Jan 1, 2003
- Shyamsundar Rajaram +3 more
Abstract Recently, ranking and sorting problems have attracted the attention of researchers in the machine learning community. By ranking, we refer to categorizing examples into one of K categories. On the other hand, sorting refers to coming up with the ordering of the data that agrees with some ground truth preference function. As against standard approaches of treating ranking as a multiclass classification problem, in this paper we argue that ranking/sorting problems can be solved by exploiting the inherent structure present in data. We present efficient formulations that enable the use of standard binary classification algorithms to solve these problems, however the structure is still captured in our formulations. We further show that our approach subsumes the various approaches that were developed in the past. We evaluate our algorithm on both synthetic datasets and for a real world image processing problem. The results obtained demonstrate the superiority of our algorithm over multiclass classification and other similar approaches for ranking/sorting data.KeywordsKernel FunctionSynthetic DataDifference VectorOrdinal RegressionRanking ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- # Classification Approach
- # Sorting Problems
- # Multiclass Classification Problem
- # Multiclass Classification Approaches
- # Multiclass Classification
- # Standard Classification Algorithms
- # Synthetic Datasets
- # Binary Algorithms
- # Standard Classification
- # Real Processing
