252 search results - page 1 / 51 » Mining Frequent Patterns without Candidate Generation |
SIGMOD
2000
ACM
13 years 9 months ago
2000
ACM
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...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
JCIT
2008
13 years 4 months ago
2008
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...
WLP
2004
Springer
13 years 10 months ago
2004
Springer
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...
AICCSA
2008
IEEE
13 years 4 months ago
2008
IEEE
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...