Sciweavers

1880 search results - page 65 / 376
» Robust Learning - Rich and Poor
Sort
View
ILP
2004
Springer
15 years 7 months ago
Learning an Approximation to Inductive Logic Programming Clause Evaluation
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
Frank DiMaio, Jude W. Shavlik
AIPS
2009
15 years 3 months ago
Learning User Plan Preferences Obfuscated by Feasibility Constraints
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
CORR
2000
Springer
126views Education» more  CORR 2000»
15 years 1 months ago
Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach
We investigate the performance of two machine learning algorithms in the context of antispam filtering. The increasing volume of unsolicited bulk e-mail (spam) has generated a nee...
Ion Androutsopoulos, Georgios Paliouras, Vangelis ...
NCA
2007
IEEE
15 years 1 months ago
Using evolution to improve neural network learning: pitfalls and solutions
: Autonomous neural network systems typically require fast learning and good generalization performance, and there is potentially a trade-off between the two. The use of evolutiona...
John A. Bullinaria
ICASSP
2011
IEEE
14 years 5 months ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...