Sciweavers

9572 search results - page 342 / 1915
» Cover Algorithms and Their Combination
Sort
View
ILP
2003
Springer
15 years 12 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
ICNC
2009
Springer
16 years 1 months ago
An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Zhenchao Wang, Haibin Duan, Xiangyin Zhang
PKDD
2004
Springer
102views Data Mining» more  PKDD 2004»
16 years 2 days ago
Improving the Performance of the RISE Algorithm
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...
Aloísio Carlos de Pina, Gerson Zaverucha
ICDM
2003
IEEE
127views Data Mining» more  ICDM 2003»
16 years 8 hour ago
A High-Performance Distributed Algorithm for Mining Association Rules
Abstract. We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speed-up with the number of computing nodes. The algorithm is the fi...
Assaf Schuster, Ran Wolff, Dan Trock
IJCAI
2003
15 years 8 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings