Sciweavers

ECML
2005
Springer
13 years 10 months ago
On the LearnAbility of Abstraction Theories from Observations for Relational Learning
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
ECML
2005
Springer
13 years 10 months ago
Rotational Prior Knowledge for SVMs
Incorporation of prior knowledge into the learning process can significantly improve low-sample classification accuracy. We show how to introduce prior knowledge into linear supp...
Arkady Epshteyn, Gerald DeJong
ECML
2005
Springer
13 years 10 months ago
Severe Class Imbalance: Why Better Algorithms Aren't the Answer
This paper argues that severe class imbalance is not just an interesting technical challenge that improved learning algorithms will address, it is much more serious. To be useful, ...
Chris Drummond, Robert C. Holte
ECML
2005
Springer
13 years 10 months ago
Thwarting the Nigritude Ultramarine: Learning to Identify Link Spam
The page rank of a commercial web site has an enormous economic impact because it directly influences the number of potential customers that find the site as a highly ranked sear...
Isabel Drost, Tobias Scheffer
ECML
2005
Springer
13 years 10 months ago
Nonrigid Embeddings for Dimensionality Reduction
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
Matthew Brand
ECML
2005
Springer
13 years 10 months ago
Learning from Positive and Unlabeled Examples with Different Data Distributions
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
Xiaoli Li, Bing Liu
ECML
2005
Springer
13 years 10 months ago
Estimation of Mixture Models Using Co-EM
We study estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers ...
Steffen Bickel, Tobias Scheffer
ECML
2005
Springer
13 years 10 months ago
Learning to Complete Sentences
Abstract. We consider the problem of predicting how a user will continue a given initial text fragment. Intuitively, our goal is to develop a “tab-complete” function for natura...
Steffen Bickel, Peter Haider, Tobias Scheffer
ECML
2005
Springer
13 years 10 months ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
ECML
2005
Springer
13 years 10 months ago
Inducing Hidden Markov Models to Model Long-Term Dependencies
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
Jérôme Callut, Pierre Dupont