Sciweavers

72 search results - page 6 / 15
» Two Kinds of Probabilistic Induction
Sort
View
FCS
2006
14 years 10 months ago
Principles of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
ECML
2007
Springer
15 years 3 months ago
Probabilistic Models for Action-Based Chinese Dependency Parsing
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
Xiangyu Duan, Jun Zhao, Bo Xu
PVLDB
2008
111views more  PVLDB 2008»
14 years 9 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
ICML
2005
IEEE
15 years 10 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
COLT
2010
Springer
14 years 7 months ago
Strongly Non-U-Shaped Learning Results by General Techniques
In learning, a semantic or behavioral U-shape occurs when a learner rst learns, then unlearns, and, nally, relearns, some target concept (on the way to success). Within the framew...
John Case, Timo Kötzing