Sciweavers

4276 search results - page 496 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
UAI
2003
15 years 8 months ago
Bayesian Hierarchical Mixtures of Experts
The Hierarchical Mixture of Experts (HME) is a well-known tree-structured model for regression and classification, based on soft probabilistic splits of the input space. In its o...
Christopher M. Bishop, Markus Svensén
UAI
2000
15 years 8 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
DEXA
2010
Springer
266views Database» more  DEXA 2010»
15 years 7 months ago
DBOD-DS: Distance Based Outlier Detection for Data Streams
Data stream is a newly emerging data model for applications like environment monitoring, Web click stream, network traffic monitoring, etc. It consists of an infinite sequence of d...
Md. Shiblee Sadik, Le Gruenwald
ICIP
2007
IEEE
15 years 6 months ago
ML Nonlinear Smoothing for Image Segmentation and its Relationship to the Mean Shift
This paper addresses the issues of nonlinear edge-preserving image smoothing and segmentation. A ML-based approach is proposed which uses an iterative algorithm to solve the probl...
Andy Backhouse, Irene Y. H. Gu, Tiesheng Wang