Sciweavers

1096 search results - page 149 / 220
» Evaluating Algorithms for Concept Description
Sort
View
AAAI
2006
13 years 10 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
FIMI
2004
161views Data Mining» more  FIMI 2004»
13 years 10 months ago
ABS: Adaptive Borders Search of frequent itemsets
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
Frédéric Flouvat, Fabien De Marchi, ...
GECCO
2008
Springer
232views Optimization» more  GECCO 2008»
13 years 9 months ago
An efficient SVM-GA feature selection model for large healthcare databases
This paper presents an efficient hybrid feature selection model based on Support Vector Machine (SVM) and Genetic Algorithm (GA) for large healthcare databases. Even though SVM an...
Rick Chow, Wei Zhong, Michael Blackmon, Richard St...
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
WLP
2007
Springer
14 years 2 months ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...