Sciweavers

266 search results - page 15 / 54
» Learning to Identify Unexpected Instances in the Test Set
Sort
View
EC
2006
120views ECommerce» more  EC 2006»
13 years 7 months ago
A Comparison of Bloat Control Methods for Genetic Programming
Genetic programming has highlighted the problem of bloat, the uncontrolled growth of the average size of an individual in the population. The most common approach to dealing with ...
Sean Luke, Liviu Panait
ACE
2004
315views Education» more  ACE 2004»
13 years 8 months ago
Applying SPICE to e-Learning: An e-Learning Maturity Model?
The Capability Maturity Model and SPICE approach to software process improvement has resulted in a robust system for improving development process capability in the field of softw...
Stephen Marshall, Geoff Mitchell
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 11 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
ICASSP
2010
IEEE
13 years 7 months ago
Weakly supervised learning with decision trees applied to fisheries acoustics
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
Riwal Lefort, Ronan Fablet, Jean-Marc Boucher
GIS
2008
ACM
14 years 8 months ago
Density based co-location pattern discovery
Co-location pattern discovery is to find classes of spatial objects that are frequently located together. For example, if two categories of businesses often locate together, they ...
Xiangye Xiao, Xing Xie, Qiong Luo, Wei-Ying Ma