Sciweavers

95 search results - page 4 / 19
» Reduction Techniques for Instance-Based Learning Algorithms
Sort
View
RSS
2007
135views Robotics» more  RSS 2007»
14 years 11 months ago
Learning omnidirectional path following using dimensionality reduction
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
J. Zico Kolter, Andrew Y. Ng
TAL
2010
Springer
14 years 7 months ago
Robust Semi-supervised and Ensemble-Based Methods in Word Sense Disambiguation
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
Anders Søgaard, Anders Johannsen
CCR
2006
114views more  CCR 2006»
14 years 9 months ago
A preliminary performance comparison of five machine learning algorithms for practical IP traffic flow classification
The identification of network applications through observation of associated packet traffic flows is vital to the areas of network management and surveillance. Currently popular m...
Nigel Williams, Sebastian Zander, Grenville J. Arm...
JMLR
2012
12 years 12 months ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...
CVPR
2009
IEEE
16 years 4 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002