Sciweavers

ALT
2006
Springer
14 years 8 months ago
Unsupervised Slow Subspace-Learning from Stationary Processes
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
Andreas Maurer
ALT
2006
Springer
14 years 8 months ago
Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
Abstract. We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thres...
Hsuan-Tien Lin, Ling Li
ALT
2006
Springer
14 years 8 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ALT
2006
Springer
14 years 8 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
ALT
2006
Springer
14 years 8 months ago
Towards a Better Understanding of Incremental Learning
Abstract. The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requi...
Sanjay Jain, Steffen Lange, Sandra Zilles
ALT
2006
Springer
14 years 8 months ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber
ALT
2006
Springer
14 years 8 months ago
General Discounting Versus Average Reward
Consider an agent interacting with an environment in cycles. In every interaction cycle the agent is rewarded for its performance. We compare the average reward U from cycle 1 to ...
Marcus Hutter
ALT
2006
Springer
14 years 8 months ago
Smooth Boosting Using an Information-Based Criterion
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
Kohei Hatano
ALT
2006
Springer
14 years 8 months ago
e-Science and the Semantic Web: A Symbiotic Relationship
e-Science is scientific investigation performed through distributed global collaborations between scientists and their resources, and the computing infrastructure that enables this...
Carole A. Goble, Óscar Corcho, Pinar Alper,...