Sciweavers

225 search results - page 6 / 45
» A Least-Certainty Heuristic for Selective Search
Sort
View
KDD
1995
ACM
133views Data Mining» more  KDD 1995»
14 years 18 days ago
Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...
Ron Kohavi, Dan Sommerfield
EC
2008
175views ECommerce» more  EC 2008»
13 years 9 months ago
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Nondominated Neighbor Immune Algorithm (NNIA) is proposed for multiobjective optimization by using a novel nondominated neighbor-based selection technique, an immune inspired oper...
Maoguo Gong, Licheng Jiao, Haifeng Du, Liefeng Bo
EC
2007
167views ECommerce» more  EC 2007»
13 years 9 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
DKE
2002
107views more  DKE 2002»
13 years 8 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
FLAIRS
2007
13 years 11 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein