Sciweavers

335 search results - page 58 / 67
» Mining Association Rules: Anti-Skew Algorithms
Sort
View
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 9 months ago
Mining Views: Database Views for Data Mining
We present a system towards the integration of data mining into relational databases. To this end, a relational database model is proposed, based on the so called virtual mining vi...
Élisa Fromont, Adriana Prado, Bart Goethals...
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months 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
SAC
2002
ACM
13 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 7 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
ICTAI
2003
IEEE
14 years 27 days ago
Parallel Mining of Maximal Frequent Itemsets from Databases
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
Soon Myoung Chung, Congnan Luo