Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Mining fuzzy association rules
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Mining fuzzy association rules in databases
ACM SIGMOD Record
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Database Mining: A Performance Perspective
IEEE Transactions on Knowledge and Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Mining Incremental Association Rules with Generalized FP-Tree
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Mining Fuzzy Weighted Association Rules
HICSS '07 Proceedings of the 40th Annual Hawaii International Conference on System Sciences
The fuzzy frequent pattern Tree
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Hi-index | 0.00 |
In this paper, we design the compressed fuzzy FP-tree structure to mine fuzzy frequent itemsets from the transactions with quantitative values. It consists of two phases. In the first phase, a compressed fuzzy frequent pattern tree (CFFP tree) is constructed from the given quantitative transactions. In the second phase, a fuzzy mining approach is then proposed to mine the fuzzy frequent itemsets from the CFFP tree constructed. Experiments are also made to show the performance of the proposed approach.