Sciweavers

1106 search results - page 87 / 222
» On regularization algorithms in learning theory
Sort
View
ICML
2003
IEEE
16 years 5 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
181
Voted
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 3 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
NIPS
2004
15 years 6 months ago
Learning Syntactic Patterns for Automatic Hypernym Discovery
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
Rion Snow, Daniel Jurafsky, Andrew Y. Ng
IJACTAICIT
2010
163views more  IJACTAICIT 2010»
15 years 2 months ago
Modified Vector Field Histogram with a Neural Network Learning Model for Mobile Robot Path Planning and Obstacle Avoidance
In this work, a Modified Vector Field Histogram (MVFH) has been developed to improve path planning and obstacle avoidance for a wheeled driven mobile robot. It permits the detecti...
Bahaa I. Kazem, Ali H. Hamad, Mustafa M. Mozael
JMLR
2010
134views more  JMLR 2010»
14 years 11 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...