Optimizing subset queries: a step towards SQL-based inductive databases for itemsets
Proceedings of the 2004 ACM symposium on Applied computing
Algebraic equivalences of nested relational operators
Information Systems
Mining Tree-Based Frequent Patterns from XML
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Hi-index | 0.00 |
We develop a fixpoint operator for computing large item sets and demonstrate three query paradigm solutions for association rule mining that use the idea of least fixpoint computation and indicates some optimisation issues. The results of our research provide theoretical foundation for relational computation of association rules and its application on XML mining.