Sciweavers

3607 search results - page 155 / 722
» Learning with structured sparsity
Sort
View
JMLR
2010
101views more  JMLR 2010»
14 years 9 months ago
Exploiting Feature Covariance in High-Dimensional Online Learning
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
Justin Ma, Alex Kulesza, Mark Dredze, Koby Crammer...
150
Voted
CVPR
2012
IEEE
13 years 5 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
155
Voted
UAI
1998
15 years 4 months ago
A Multivariate Discretization Method for Learning Bayesian Networks from Mixed Data
In this paper we address the problem of discretization in the context of learning Bayesian networks (BNs) from data containing both continuous and discrete variables. We describe ...
Stefano Monti, Gregory F. Cooper
117
Voted
ICML
2002
IEEE
16 years 3 months ago
Multi-Instance Kernels
Learning from structured data is becoming increasingly important. However, most prior work on kernel methods has focused on learning from attribute-value data. Only recently, rese...
Adam Kowalczyk, Alex J. Smola, Peter A. Flach, Tho...
118
Voted
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
15 years 8 months ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu