Sciweavers

5699 search results - page 143 / 1140
» Alternating model trees
Sort
View
IJAR
2007
87views more  IJAR 2007»
15 years 4 months ago
Pruning belief decision tree methods in averaging and conjunctive approaches
The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interp...
Salsabil Trabelsi, Zied Elouedi, Khaled Mellouli
118
Voted
CGF
2002
116views more  CGF 2002»
15 years 4 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
130
Voted
CPC
2002
80views more  CPC 2002»
15 years 4 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger
JSC
2006
95views more  JSC 2006»
15 years 4 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
146
Voted
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
15 years 6 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens