Sciweavers

17760 search results - page 297 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
PADL
2000
Springer
15 years 10 months ago
Calculating a New Data Mining Algorithm for Market Basket Analysis
The general goal of data mining is to extract interesting correlated information from large collection of data. A key computationally-intensive subproblem of data mining involves ...
Zhenjiang Hu, Wei-Ngan Chin, Masato Takeichi
KDD
1995
ACM
112views Data Mining» more  KDD 1995»
15 years 10 months ago
Learning First Order Logic Rules with a Genetic Algorithm
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
Sébastien Augier, Gilles Venturini, Yves Ko...
PATAT
1995
Springer
122views Education» more  PATAT 1995»
15 years 10 months ago
A Memetic Algorithm for University Exam Timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
Edmund K. Burke, James P. Newall, Rupert F. Weare
CIBB
2008
15 years 8 months ago
Stability and Performances in Biclustering Algorithms
Abstract. Stability is an important property of machine learning algorithms. Stability in clustering may be related to clustering quality or ensemble diversity, and therefore used ...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
PODC
2010
ACM
15 years 8 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer