Sciweavers

105 search results - page 12 / 21
» On the formal points of the formal topology of the binary tr...
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
UAI
2004
13 years 8 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...
ENTCS
2007
123views more  ENTCS 2007»
13 years 7 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell
SAS
1999
Springer
13 years 11 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
CMSB
2008
Springer
13 years 9 months ago
Analyzing a Discrete Model of Aplysia Central Pattern Generator
We present a discrete formal model of the central pattern generator (CPG) located in the buccal ganglia of Aplysia that is responsible for mediating the rhythmic movements of its f...
Ashish Tiwari, Carolyn L. Talcott