Sciweavers

716 search results - page 89 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
130
Voted
ICML
2007
IEEE
16 years 2 months ago
Learning a meta-level prior for feature relevance from multiple related tasks
In many prediction tasks, selecting relevant features is essential for achieving good generalization performance. Most feature selection algorithms consider all features to be a p...
Su-In Lee, Vassil Chatalbashev, David Vickrey, Dap...
MIR
2005
ACM
129views Multimedia» more  MIR 2005»
15 years 7 months ago
Tracking concept drifting with an online-optimized incremental learning framework
Concept drifting is an important and challenging research issue in the field of machine learning. This paper mainly addresses the issue of semantic concept drifting in time series...
Jun Wu, Dayong Ding, Xian-Sheng Hua, Bo Zhang
129
Voted
ICML
2007
IEEE
16 years 2 months ago
Full regularization path for sparse principal component analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
COLT
2005
Springer
15 years 7 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
IJCNN
2006
IEEE
15 years 8 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang