Sciweavers

25 search results - page 1 / 5
» SQL based frequent pattern mining without candidate generati...
Sort
View
SAC
2004
ACM
13 years 10 months ago
SQL based frequent pattern mining without candidate generation
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
WLP
2004
Springer
13 years 10 months ago
SQL Based Frequent Pattern Mining with FP-Growth
Scalable data mining in large databases is one of today’s real challenges to database research area. The integration of data mining with database systems is an essential componen...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
13 years 9 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
LWA
2004
13 years 6 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
JCIT
2008
128views more  JCIT 2008»
13 years 5 months ago
OPAM-An Efficient One Pass Association Mining Technique without Candidate Generation
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
S. Roy, D. K. Bhattacharyya