Sciweavers

481 search results - page 9 / 97
» Learning relational probability trees
Sort
View
ACL
2001
13 years 10 months ago
Parse Forest Computation of Expected Governors
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
Helmut Schmid, Mats Rooth
EMNLP
2008
13 years 10 months ago
Phrase Translation Probabilities with ITG Priors and Smoothing as Learning Objective
The conditional phrase translation probabilities constitute the principal components of phrase-based machine translation systems. These probabilities are estimated using a heurist...
Markos Mylonakis, Khalil Sima'an
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
14 years 2 months ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
IPPS
2007
IEEE
14 years 2 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 8 months ago
The asymptotic equipartition property in reinforcement learning and its relation to return maximization
We discuss an important property called the asymptotic equipartition property on empirical sequences in reinforcement learning. This states that the typical set of empirical seque...
Kazunori Iwata, Kazushi Ikeda, Hideaki Sakai