Sciweavers

111 search results - page 13 / 23
» COFI approach for mining frequent itemsets revisited
Sort
View
81
Voted
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
15 years 1 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
DAWAK
2009
Springer
15 years 1 months ago
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
C. I. Ezeife, Dan Zhang
LWA
2004
14 years 11 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
15 years 11 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa