Sciweavers

1454 search results - page 230 / 291
» Learning with cost intervals
Sort
View
P2PKM
2004
15 years 2 months ago
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
Giovanni Tummarello, Christian Morbidoni, Joackin ...
AAAI
2000
15 years 2 months ago
Selective Sampling with Redundant Views
Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a ...
Ion Muslea, Steven Minton, Craig A. Knoblock
ATAL
2010
Springer
15 years 2 months ago
Cultivating desired behaviour: policy teaching via environment-dynamics tweaks
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
Zinovi Rabinovich, Lachlan Dufton, Kate Larson, Ni...
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 2 months ago
Empirical investigations on parallel competent genetic algorithms
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 2 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu