Sciweavers

107 search results - page 2 / 22
» On the Optimal Selection of k in the k-Anonymity Problem
Sort
View
ECML
2003
Springer
13 years 10 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
13 years 11 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
13 years 12 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
AMC
2006
106views more  AMC 2006»
13 years 5 months ago
Selecting two different defective coins
In this paper, given a balance scale and the information that there are exactly two different defective coins present, the authors consider the problem of ascertaining the minimum...
Mingnan Qi, Sanyang Liu
ICIP
1998
IEEE
14 years 6 months ago
Simultaneous Optimal Boundary Encoding and Variable-Length Code Selection
This paper describes e cient and optimal encoding and representation of object contours. Contours are approximated by connected second-order spline segments, each de ned by three ...
Gerry Melnikov, Guido M. Schuster, Aggelos K. Kats...