Sciweavers

116 search results - page 14 / 24
» Efficient Mining of Recurrent Rules from a Sequence Database
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
16 years 2 days ago
Interestingness of frequent itemsets using Bayesian networks as background knowledge
The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the abso...
Szymon Jaroszewicz, Dan A. Simovici
KBS
2006
87views more  KBS 2006»
14 years 11 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
RCIS
2010
14 years 10 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
CIB
2004
57views more  CIB 2004»
14 years 11 months ago
Identifying Global Exceptional Patterns in Multi-database Mining
In multi-database mining, there can be many local patterns (frequent itemsets or association rules) in each database. At the end of multi-database mining, it is necessary to analyz...
Chengqi Zhang, Meiling Liu, Wenlong Nie, Shichao Z...
ESANN
2004
15 years 1 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk