Sciweavers

1918 search results - page 199 / 384
» Discovering Cortical Algorithms
Sort
View
ECAI
2010
Springer
13 years 10 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
GRC
2010
IEEE
13 years 10 months ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 10 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
GRC
2008
IEEE
13 years 10 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
HAIS
2008
Springer
13 years 10 months ago
Extracting Multi-knowledge from fMRI Data through Swarm-Based Rough Set Reduction
Abstract. Functional Magnetic Resonance Imaging (fMRI) data is collected ceaselessly during brain research, which implicates some important information. It need to be extracted and...
Hongbo Liu, Ajith Abraham, Hong Ye