Sciweavers

1106 search results - page 115 / 222
» On regularization algorithms in learning theory
Sort
View
KCAP
2011
ACM
14 years 7 months ago
Eliciting hierarchical structures from enumerative structures for ontology learning
Some discourse structures such as enumerative structures have typographical, punctuational and laying out characteristics which (1) make them easily identifiable and (2) convey hi...
Mouna Kamel, Bernard Rothenburger
ICML
2004
IEEE
15 years 10 months ago
Online learning of conditionally I.I.D. data
In this work we consider the task of relaxing the i.i.d assumption in online pattern recognition (or classification), aiming to make existing learning algorithms applicable to a ...
Daniil Ryabko
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 11 months ago
Effective complexity of stationary process realizations
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
Nihat Ay, Markus Müller, Arleta Szkola
GECCO
2005
Springer
111views Optimization» more  GECCO 2005»
15 years 10 months ago
XCS with eligibility traces
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investig...
Jan Drugowitsch, Alwyn Barry
MLCW
2005
Springer
15 years 10 months ago
Learning Textual Entailment on a Distance Feature Space
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
Maria Teresa Pazienza, Marco Pennacchiotti, Fabio ...