Sciweavers

174 search results - page 19 / 35
» Advances in Instance Selection for Instance-Based Learning A...
Sort
View
DAWAK
2010
Springer
14 years 9 months ago
Modelling Complex Data by Learning Which Variable to Construct
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...
Françoise Fessant, Aurélie Le Cam, M...
98
Voted
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
14 years 8 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
Daniel Hernández-Lobato, José Miguel...
ICML
2009
IEEE
15 years 10 months ago
Semi-supervised learning using label mean
Semi-Supervised Support Vector Machines (S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances ...
Yu-Feng Li, James T. Kwok, Zhi-Hua Zhou
ACMSE
2006
ACM
15 years 3 months ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen
ICML
2007
IEEE
15 years 10 months ago
A kernel path algorithm for support vector machines
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
Gang Wang, Dit-Yan Yeung, Frederick H. Lochovsky