Sciweavers

147 search results - page 21 / 30
» Constraint-Based Rule Mining in Large, Dense Databases
Sort
View
DAWAK
1999
Springer
15 years 2 months ago
Modeling KDD Processes within the Inductive Database Framework
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
Jean-François Boulicaut, Mika Klemettinen, ...
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
15 years 3 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
KBS
2006
87views more  KBS 2006»
14 years 10 months ago
Predictive and comprehensible rule discovery using a multi-objective genetic algorithm
We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large databases. We emphasize predictive accuracy and comp...
Satchidananda Dehuri, Rajib Mall
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
14 years 12 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
15 years 10 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer