Sciweavers

683 search results - page 70 / 137
» Performing hypothesis tests on the shape of functional data
Sort
View
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
15 years 4 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...
IMR
2003
Springer
15 years 5 months ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 3 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
HEURISTICS
2008
120views more  HEURISTICS 2008»
14 years 12 months ago
A local linear embedding module for evolutionary computation optimization
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...
Fabio Boschetti
SAC
2005
ACM
15 years 5 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...