Sciweavers

144 search results - page 3 / 29
» An Efficient Reduction of Ranking to Classification
Sort
View
ICIP
2009
IEEE
13 years 5 months ago
Efficient reduction of support vectors in kernel-based methods
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...
Takumi Kobayashi, Nobuyuki Otsu
ADMA
2008
Springer
124views Data Mining» more  ADMA 2008»
13 years 9 months ago
Dimensionality Reduction for Classification
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...
Frank Plastria, Steven De Bruyne, Emilio Carrizosa
IWPEC
2010
Springer
13 years 5 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
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...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
VLSISP
2002
139views more  VLSISP 2002»
13 years 7 months ago
A Modified Minimum Classification Error (MCE) Training Algorithm for Dimensionality Reduction
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...
Xuechuan Wang, Kuldip K. Paliwal
AI
2008
Springer
13 years 7 months ago
Label ranking by learning pairwise preferences
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 ...
Eyke Hüllermeier, Johannes Fürnkranz, We...