Sciweavers

435 search results - page 39 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
ECML
2006
Springer
15 years 1 months ago
Why Is Rule Learning Optimistic and How to Correct It
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...
HPCC
2005
Springer
15 years 3 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
GECCO
2003
Springer
167views Optimization» more  GECCO 2003»
15 years 2 months ago
Dimensionality Reduction via Genetic Value Clustering
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
Alexander P. Topchy, William F. Punch
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 2 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
64
Voted
DATE
2004
IEEE
147views Hardware» more  DATE 2004»
15 years 1 months ago
Automatic Tuning of Two-Level Caches to Embedded Applications
The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50% of the total microprocessor system power, and is thus a good candidate for optimiza...
Ann Gordon-Ross, Frank Vahid, Nikil Dutt