Sciweavers

801 search results - page 72 / 161
» Machine Learning with Data Dependent Hypothesis Classes
Sort
View
ECML
2003
Springer
14 years 2 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer
ML
2007
ACM
101views Machine Learning» more  ML 2007»
13 years 8 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
ANNPR
2006
Springer
14 years 15 days ago
Visual Classification of Images by Learning Geometric Appearances Through Boosting
We present a multiclass classification system for gray value images through boosting. The feature selection is done using the LPBoost algorithm which selects suitable features of a...
Martin Antenreiter, Christian Savu-Krohn, Peter Au...
ICALT
2006
IEEE
14 years 2 months ago
Vicarious Learning and Multimodal Dialogue
Vicarious Learning is learning from watching others learn. We believe that this is a powerful model for computer-based learning. Learning episodes can be captured and replayed to ...
John Lee
PRL
2011
12 years 11 months ago
A Bayes-true data generator for evaluation of supervised and unsupervised learning methods
Benchmarking pattern recognition, machine learning and data mining methods commonly relies on real-world data sets. However, there are some disadvantages in using real-world data....
Janick V. Frasch, Aleksander Lodwich, Faisal Shafa...