Sciweavers

4903 search results - page 593 / 981
» The Set Covering Machine
Sort
View
ICML
2009
IEEE
16 years 7 months ago
On primal and dual sparsity of Markov networks
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
Jun Zhu, Eric P. Xing
ICML
2009
IEEE
16 years 7 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
ICML
2009
IEEE
16 years 7 months ago
Tractable nonparametric Bayesian inference in Poisson processes with Gaussian process intensities
The inhomogeneous Poisson process is a point process that has varying intensity across its domain (usually time or space). For nonparametric Bayesian modeling, the Gaussian proces...
Ryan Prescott Adams, Iain Murray, David J. C. MacK...
ICML
2009
IEEE
16 years 7 months ago
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
Xuan Vinh Nguyen, Julien Epps, James Bailey
ICML
2009
IEEE
16 years 7 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy