Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ALT
2003
Springer
11 years 11 months ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
ALT
2003
Springer
11 years 11 months ago
Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumot...
ALT
2003
Springer
11 years 11 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
ALT
2003
Springer
12 years 5 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
ALT
2003
Springer
12 years 5 months ago
Kernel Trick Embedded Gaussian Mixture Model
In this paper, we present a kernel trick embedded Gaussian Mixture Model (GMM), called kernel GMM. The basic idea is to embed kernel trick into EM algorithm and deduce a parameter ...
Jingdong Wang, Jianguo Lee, Changshui Zhang
ALT
2003
Springer
12 years 5 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles
ALT
2003
Springer
12 years 5 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
ALT
2003
Springer
12 years 5 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...
books