144 search results - page 3 / 29 » An Efficient Reduction of Ranking to Classification |
97
Voted
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
Kernel-based methods, e.g., support vector machine (SVM), produce high classification performances. However, the computation becomes time-consuming as the number of the vectors su...
111
Voted
ADMA
2008
Springer
15 years 1 months ago
2008
Springer
We investigate the effects of dimensionality reduction using different techniques and different dimensions on six two-class data sets with numerical attributes as pre-processing fo...
122
Voted
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
103
click to vote
VLSISP
2002
14 years 11 months ago
2002
Dimensionality reduction is an important problem in pattern recognition. There is a tendency of using more and more features to improve the performance of classifiers. However, not...
101
Voted
AI
2008
Springer
14 years 11 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...