Sciweavers

7378 search results - page 1035 / 1476
» Introduction to Machine Learning
Sort
View
ICML
2002
IEEE
16 years 7 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
16 years 7 months ago
A Nonparametric Approach to Noisy and Costly Optimization
This paper describes Pairwise Bisection: a nonparametric approach to optimizing a noisy function with few function evaluations. The algorithm uses nonparametric reasoning about si...
Brigham S. Anderson, Andrew W. Moore, David Cohn
ICML
2000
IEEE
16 years 7 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...
ICML
1999
IEEE
16 years 7 months ago
Abstracting from Robot Sensor Data using Hidden Markov Models
ing from Robot Sensor Data using Hidden Markov Models Laura Firoiu, Paul Cohen Computer Science Department, LGRC University of Massachusetts at Amherst, Box 34610 Amherst, MA 01003...
Laura Firoiu, Paul R. Cohen
ICML
1999
IEEE
16 years 7 months ago
Detecting Motifs from Sequences
The problemofmultipleglobalcomparisonin familiesof biologicalsequences has been wellstudied. Fewer algorithms have been developed for identifying local consensus patterns or motif...
Yuh-Jyh Hu, Suzanne B. Sandmeyer, Dennis F. Kibler
« Prev « First page 1035 / 1476 Last » Next »