Sciweavers

2190 search results - page 281 / 438
» Learning with the Set Covering Machine
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Computational aspects of Bayesian partition models
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
Mikko Koivisto, Kismat Sood
ICML
2003
IEEE
14 years 10 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
ICML
2002
IEEE
14 years 10 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
ICML
2000
IEEE
14 years 10 months ago
Maximum Entropy Markov Models for Information Extraction and Segmentation
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
Andrew McCallum, Dayne Freitag, Fernando C. N. Per...
ALT
2008
Springer
14 years 6 months ago
Visual Analytics: Combining Automated Discovery with Interactive Visualizations
In numerous application areas fast growing data sets develop with ever higher complexity and dynamics. A central challenge is to filter the substantial information and to communic...
Daniel A. Keim, Florian Mansmann, Daniela Oelke, H...