Sciweavers

255 search results - page 46 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
SIGIR
2010
ACM
13 years 7 months ago
SED: supervised experimental design and its application to text classification
In recent years, active learning methods based on experimental design achieve state-of-the-art performance in text classification applications. Although these methods can exploit ...
Yi Zhen, Dit-Yan Yeung
ATAL
2011
Springer
12 years 7 months ago
Maximum causal entropy correlated equilibria for Markov games
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
Brian D. Ziebart, J. Andrew Bagnell, Anind K. Dey
WWW
2007
ACM
14 years 8 months ago
Supervised rank aggregation
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
Yu-Ting Liu, Tie-Yan Liu, Tao Qin, Zhiming Ma, Han...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 8 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
ICASSP
2008
IEEE
14 years 2 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...