Sciweavers

1068 search results - page 141 / 214
» Extremely randomized trees
Sort
View
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
14 years 2 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
DBA
2004
111views Database» more  DBA 2004»
14 years 17 days ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
MASCOTS
2003
14 years 16 days ago
Small-World Characteristics of the Internet and Multicast Scaling
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
Shudong Jin, Azer Bestavros
SDM
2003
SIAM
134views Data Mining» more  SDM 2003»
14 years 16 days ago
Hierarchical Document Clustering using Frequent Itemsets
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
Benjamin C. M. Fung, Ke Wang, Martin Ester
NIPS
1993
14 years 14 days ago
Temporal Difference Learning of Position Evaluation in the Game of Go
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
Nicol N. Schraudolph, Peter Dayan, Terrence J. Sej...