Sciweavers

475 search results - page 21 / 95
» TSSP: A Reinforcement Algorithm to Find Related Papers
Sort
View
EDBT
2010
ACM
135views Database» more  EDBT 2010»
13 years 10 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin

Publication
233views
12 years 6 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
ML
2000
ACM
103views Machine Learning» more  ML 2000»
13 years 7 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta
LREC
2008
155views Education» more  LREC 2008»
13 years 9 months ago
L-ISA: Learning Domain Specific Isa-Relations from the Web
Automated extraction of ontological knowledge from text corpora is a relevant task in Natural Language Processing. In this paper, we focus on the problem of finding hypernyms for ...
Alessandra Potrich, Emanuele Pianta
FGCS
2000
139views more  FGCS 2000»
13 years 7 months ago
Ant algorithms
This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, an...
Marco Dorigo, Gianni Di Caro, Thomas Stützle