Sciweavers

2553 search results - page 149 / 511
» Modeling Trees with Hypertextures
Sort
View
136
Voted
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
15 years 8 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...
133
Voted
ECSQARU
2009
Springer
15 years 10 months ago
Probability Density Estimation by Perturbing and Combining Tree Structured Markov Networks
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
Sourour Ammar, Philippe Leray, Boris Defourny, Lou...
148
Voted
SIGGRAPH
1995
ACM
15 years 7 months ago
Creation and rendering of realistic trees
Recent advances in computer graphics have produced images approaching the elusive goal of photorealism. Since many natural objects are so complex and detailed, they are often not ...
Jason Weber, Joseph Penn
127
Voted
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 5 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
142
Voted
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 3 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel