Sciweavers

5699 search results - page 33 / 1140
» Alternating model trees
Sort
View
IFIP12
2008
15 years 5 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 8 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
121
Voted
ICLP
1992
Springer
15 years 8 months ago
Weighted Decision Trees
: Whiledecision tree compilationis a promisingway tocarry out guard tests e ciently, the methods given in the literature do not take into account either the execution characteristi...
Saumya K. Debray, Sampath Kannan, Mukul Paithane
SAC
2008
ACM
15 years 3 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
125
Voted
CSCLP
2007
Springer
15 years 10 months ago
Temporal Reasoning in Nested Temporal Networks with Alternatives
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...
Roman Barták, Ondrej Cepek, Martin Hejna