Sciweavers

156 search results - page 14 / 32
» Mining Frequent Itemsets from Secondary Memory
Sort
View
CIDM
2009
IEEE
14 years 2 months ago
An improved multiple minimum support based approach to mine rare association rules
Abstract—In this paper we have proposed an improved approach to extract rare association rules. Rare association rules are the association rules containing rare items. Rare items...
R. Uday Kiran, P. Krishna Reddy
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 8 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
ICCS
2003
Springer
14 years 18 days ago
A Compress-Based Association Mining Algorithm for Large Dataset
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
DKE
2008
124views more  DKE 2008»
13 years 7 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
DATAMINE
2010
166views more  DATAMINE 2010»
13 years 7 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont