Sciweavers

99 search results - page 4 / 20
» Feature Selection by Transfer Learning with Linear Regulariz...
Sort
View
ICML
2010
IEEE
13 years 6 months ago
From Transformation-Based Dimensionality Reduction to Feature Selection
Many learning applications are characterized by high dimensions. Usually not all of these dimensions are relevant and some are redundant. There are two main approaches to reduce d...
Mahdokht Masaeli, Glenn Fung, Jennifer G. Dy
JMLR
2010
154views more  JMLR 2010»
13 years 16 days ago
Infinite Predictor Subspace Models for Multitask Learning
Given several related learning tasks, we propose a nonparametric Bayesian model that captures task relatedness by assuming that the task parameters (i.e., predictors) share a late...
Piyush Rai, Hal Daumé III
ACMSE
2010
ACM
13 years 24 days ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
CORR
2010
Springer
228views Education» more  CORR 2010»
13 years 4 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ICML
2007
IEEE
14 years 6 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji