Sciweavers

476 search results - page 17 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
NIPS
2007
13 years 9 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
JMLR
2010
144views more  JMLR 2010»
13 years 2 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
ICANN
2009
Springer
14 years 2 days ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
ICDT
2005
ACM
117views Database» more  ICDT 2005»
14 years 1 months ago
Privacy in Database Publishing
We formulate and study a privacy guarantee to data owners, who share information with clients by publishing views of a proprietary database. The owner identifies the sensitive pro...
Alin Deutsch, Yannis Papakonstantinou
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
14 years 3 days ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux