Sciweavers

15485 search results - page 489 / 3097
» Computing Optimal Subsets
Sort
View
AIRS
2006
Springer
15 years 10 months ago
A Novel Ant-Based Clustering Approach for Document Clustering
Recently, much research has been proposed using nature inspired algorithms to perform complex machine learning tasks. Ant Colony Optimization (ACO) is one such algorithm based on s...
Yulan He, Siu Cheung Hui, Yongxiang Sim
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 10 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 10 months ago
Characterizing large text corpora using a maximum variation sampling genetic algorithm
An enormous amount of information available via the Internet exists. Much of this data is in the form of text-based documents. These documents cover a variety of topics that are v...
Robert M. Patton, Thomas E. Potok
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 10 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
ACMICEC
2008
ACM
272views ECommerce» more  ACMICEC 2008»
15 years 8 months ago
Adapting the interaction state model in conversational recommender systems
Conventional conversational recommender systems support interaction strategies that are hard-coded into the system in advance. In this context, Reinforcement Learning techniques h...
Tariq Mahmood, Francesco Ricci