Sciweavers

481 search results - page 26 / 97
» Learning relational probability trees
Sort
View
IJCNN
2000
IEEE
14 years 2 days ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
PAMI
2006
114views more  PAMI 2006»
13 years 7 months ago
Nonparametric Supervised Learning by Linear Interpolation with Maximum Entropy
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Maya R. Gupta, Robert M. Gray, Richard A. Olshen
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 1 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
MICAI
2007
Springer
14 years 1 months ago
An EM Algorithm to Learn Sequences in the Wavelet Domain
The wavelet transform has been used for feature extraction in many applications of pattern recognition. However, in general the learning algorithms are not designed taking into acc...
Diego H. Milone, Leandro E. Di Persia
EMNLP
2009
13 years 5 months ago
Synchronous Tree Adjoining Machine Translation
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
Steve DeNeefe, Kevin Knight