Sciweavers

2407 search results - page 403 / 482
» The evolutionary forest algorithm
Sort
View
LREC
2010
216views Education» more  LREC 2010»
13 years 11 months ago
Automatic Grammar Rule Extraction and Ranking for Definitions
Learning texts contain much implicit knowledge which is ideally presented to the learner in a structured manner - a typical example being definitions of terms in the text, which w...
Claudia Borg, Mike Rosner, Gordon J. Pace
SDM
2008
SIAM
176views Data Mining» more  SDM 2008»
13 years 11 months ago
A General Model for Multiple View Unsupervised Learning
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
Bo Long, Philip S. Yu, Zhongfei (Mark) Zhang
CEC
2010
IEEE
13 years 11 months ago
Evolving natural language grammars without supervision
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
Lourdes Araujo, Jesus Santamaria
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 11 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
GECCO
2008
Springer
108views Optimization» more  GECCO 2008»
13 years 11 months ago
Search space reduction technique for constrained optimization with tiny feasible space
The hurdles in solving Constrained Optimization Problems (COP) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solut...
Abu S. S. M. Barkat Ullah, Ruhul A. Sarker, David ...