8 search results - page 1 / 2 » CT-ITL : Efficient Frequent Item Set Mining Using a Compress... |
ADC
2003
Springer
13 years 9 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
WISE
2006
Springer
13 years 10 months ago
2006
Springer
Frequent embedded subtree pattern mining is an important data mining problem with broad applications. In this paper, we propose a novel embedded subtree mining algorithm, called Pr...
APPINF
2003
13 years 5 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
AUSDM
2008
Springer
13 years 6 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
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...