D. Bitton. Bridging the gap between database theory and practice, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fast Algorithms for Mining Association Rules - Agrawal, Srikant (1994) (881 citations) (Correct)
....in [PS91a] If used for finding all association rules, this algorithm will make as many passes over the data as the number of combinations of items in the antecedent, which is exponentially large. Related work in the database literature is the work on inferring functional dependencies from data [Bit92] MR87] Functional dependencies are rules requiring strict satisfaction. Consequently,having determined a dependency X A, the algorithms in [Bit92] MR87] 2 consider any other dependency of the form X Y A redundant and do not generate it. The association rules we consider are ....
....in the antecedent, which is exponentially large. Related work in the database literature is the work on inferring functional dependencies from data [Bit92] MR87] Functional dependencies are rules requiring strict satisfaction. Consequently,having determined a dependency X A, the algorithms in [Bit92] MR87] 2 consider any other dependency of the form X Y A redundant and do not generate it. The association rules we consider are probabilistic in nature. The presence of a rule X A does not necessarily mean that X Y A also holds because the latter may not have minimum support. ....
D. Bitton. Bridging the gap between database theory and practice, 1992.
Fast Algorithms for Mining Association Rules - Agrawal, Srikant (1994) (881 citations) (Correct)
....in [PS91a] If used for finding all association rules, this algorithm will make as many passes over the data as the number of combinations of items in the antecedent, which is exponentially large. Related work in the database literature is the work on inferring functional dependencies from data [Bit92] MR87] Functional dependencies are rules requiring strict satisfaction. Consequently, having determined a dependency X A, the algorithms in [Bit92] MR87] consider any other dependency of the form X Y A redundant and do not generate it. The association rules we consider are ....
....the antecedent, which is exponentially large. Related work in the database literature is the work on inferring functional dependencies from data [Bit92] MR87] Functional dependencies are rules requiring strict satisfaction. Consequently, having determined a dependency X A, the algorithms in [Bit92] MR87] consider any other dependency of the form X Y A redundant and do not generate it. The association rules we consider are probabilistic in nature. The presence of a rule X A does not necessarily mean that X Y A also holds because the latter may not have minimum support. ....
D. Bitton. Bridging the gap between database theory and practice, 1992.
Mining Association Rules between Sets of Items in Large.. - Agrawal, Imielinski, Swami (1993) (896 citations) (Correct)
....an efficient solution and actual performance results for a problem that clearly has the exponential worst case behavior in number of itemsets. There has been work in the database community on inferring functional dependencies from data, and efficient inference algorithms have been presented in [3] [8] Functional dependencies are very specific predicate rules while our rules are propositional in nature. Contrary to our framework, the algorithms in [3] 8] consider strict satisfaction of rules. Due to the strict satisfaction, these algorithms take advantage of the implications between rules ....
....been work in the database community on inferring functional dependencies from data, and efficient inference algorithms have been presented in [3] 8] Functional dependencies are very specific predicate rules while our rules are propositional in nature. Contrary to our framework, the algorithms in [3] [8] consider strict satisfaction of rules. Due to the strict satisfaction, these algorithms take advantage of the implications between rules and do not consider rules that are logically implied by the rules already discovered. That is, having inferred a dependency X A, any other dependency of ....
Dina Bitton, "Bridging the Gap Between Database Theory and Practice", Cadre Technologies, Menlo Park, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC