Sciweavers

507 search results - page 43 / 102
» Sizes of Ordered Decision Trees
Sort
View
ECML
2003
Springer
14 years 1 months ago
Improving the AUC of Probabilistic Estimation Trees
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
César Ferri, Peter A. Flach, José He...
INFOCOM
1999
IEEE
14 years 5 days ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
IJBRA
2006
92views more  IJBRA 2006»
13 years 7 months ago
Jumpstarting phylogenetic analysis
: Phylogenetic analysis is a central tool in studies of comparative genomics. When a new region of DNA is isolated and sequenced, researchers are often forced to throw away months ...
Jesse Mecham, Mark J. Clement, Quinn Snell, Todd F...
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
14 years 2 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li
SSDBM
2011
IEEE
239views Database» more  SSDBM 2011»
12 years 11 months ago
Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
Julio López, Colin Degraf, Tiziana DiMatteo...