Sciweavers

2822 search results - page 124 / 565
» Mining Optimized Ranges
Sort
View
67
Voted
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
15 years 4 months ago
Analyzing heuristic performance with response surface models: prediction, optimization and robustness
This research uses a Design of Experiments (DOE) approach to build a predictive model of the performance of a combinatorial optimization heuristic over a range of heuristic tuning...
Enda Ridge, Daniel Kudenko
COMPGEOM
2010
ACM
15 years 3 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
15 years 3 months ago
Learning to predict train wheel failures
This paper describes a successful but challenging application of data mining in the railway industry. The objective is to optimize maintenance and operation of trains through prog...
Chunsheng Yang, Sylvain Létourneau
CIKM
2009
Springer
15 years 2 months ago
Efficient itemset generator discovery over a stream sliding window
Mining generator patterns has raised great research interest in recent years. The main purpose of mining itemset generators is that they can form equivalence classes together with...
Chuancong Gao, Jianyong Wang
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen