Sciweavers

2990 search results - page 325 / 598
» Hidden Markov processes
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Variational Bayesian image modelling
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
Li Cheng, Feng Jiao, Dale Schuurmans, Shaojun Wang
ICML
2005
IEEE
16 years 7 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
ICML
1998
IEEE
16 years 7 months ago
Heading in the Right Direction
Stochastic topological models, and hidden Markov models in particular, are a useful tool for robotic navigation and planning. In previous work we have shown how weak odometric dat...
Hagit Shatkay, Leslie Pack Kaelbling
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 7 months ago
Name-ethnicity classification from open sources
The problem of ethnicity identification from names has a variety of important applications, including biomedical research, demographic studies, and marketing. Here we report on th...
Anurag Ambekar, Charles B. Ward, Jahangir Mohammed...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 7 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney