Goulbourne, G., Coenen, F., and Leng, P. H. Computing association rule using partial totals. In Proceedings of the 5th European Conference on Principles and Practice of Knowledge Discovery in Databases, 54-66. 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generating an Informative Cover for Association Rules - Cristofor, Simovici (2002) (4 citations) (Correct)
.... dealing with it have proposed increasingly ecient algorithms: Apriori [AS94b] Partition [SON95] Dynamic Itemset Counting [BMUT97] A Close [PBTL99b] Close [PBTL99c] ChARM [ZH99] Closure [CCS00] Tree projection [AAP00] AAP01] FP growth [HPY00] CLOSET [PHM00] and Partial Total Trees [CGL01] The main issue in the generation of association rules is that in practice the number of association rules generated is too large and can easily overwhelm a human analyst. To address this problem several methods were proposed. Measures of interestingness can be used to assess the interestingness ....
Frans Coenen, Graham Goulbourne, and Paul H. Leng. Computing association rules using partial totals. In Proceedings of the 5th European Conference on Principles and Practice of Knowledge Discovery in Databases, pages 54-66, 2001.
Incremental Mining of Frequent Patterns Without Candidate.. - Cheung, Zaiane (Correct)
No context found.
Goulbourne, G., Coenen, F., and Leng, P. H. Computing association rule using partial totals. In Proceedings of the 5th European Conference on Principles and Practice of Knowledge Discovery in Databases, 54-66. 2001.
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