Sciweavers

4085 search results - page 650 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ASAP
2008
IEEE
105views Hardware» more  ASAP 2008»
15 years 8 months ago
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. &Ou...
AAAI
2010
15 years 8 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
181
Voted
ICMLA
2008
15 years 7 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux
ICONIP
2008
15 years 7 months ago
The Diversity of Regression Ensembles Combining Bagging and Random Subspace Method
Abstract. The concept of Ensemble Learning has been shown to increase predictive power over single base learners. Given the bias-variancecovariance decomposition, diversity is char...
Alexandra Scherbart, Tim W. Nattkemper
ESANN
2004
15 years 7 months ago
Soft-computing techniques for time series forecasting
One way to contrast the behaviour of different algorithms in the field of timeseries forecasting is to compare the prediction error using a benchmark problem. Another interesting ...
Ignacio Rojas Ruiz, Héctor Pomares