Sciweavers

1599 search results - page 147 / 320
» Probabilistic Analysis of Anonymity
Sort
View
GECCO
2009
Springer
101views Optimization» more  GECCO 2009»
14 years 2 months ago
Modeling UCS as a mixture of experts
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...
Narayanan Unny Edakunni, Tim Kovacs, Gavin Brown, ...
SIGIR
2009
ACM
14 years 2 months ago
Counting ancestors to estimate authority
The AncestorRank algorithm calculates an authority score by using just one characteristic of the web graph—the number of ancestors per node. For scalability, we estimate the num...
Jian Wang, Brian D. Davison
MLG
2007
Springer
14 years 2 months ago
Abductive Stochastic Logic Programs for Metabolic Network Inhibition Learning
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
Jianzhong Chen, Stephen Muggleton, Jose Santos
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 1 months ago
Real-coded crossover as a role of kernel density estimation
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
Jun Sakuma, Shigenobu Kobayashi
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
14 years 1 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint