Sciweavers

520 search results - page 27 / 104
» Subset Counting in Trees
Sort
View
AIPS
2008
13 years 10 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...
ACL
2001
13 years 9 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 8 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 2 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
DM
1998
91views more  DM 1998»
13 years 7 months ago
On some relations between 2-trees and tree metrics
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
Bruno Leclerc, Vladimir Makarenkov