Answering the most correlated N association rules efficiently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2431 LNAI, Issue , 2002, Pages 410-422

  Sese, Jun ^a   Morishita, Shinichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; TREES (MATHEMATICS); ALGORITHMS;

ANTI-MONOTONICITY; COMPUTATIONAL PERFORMANCE; CONVENTIONAL TECHNIQUES; ITEM SETS; MINING ASSOCIATIONS; ORDERS OF MAGNITUDE; STATISTICAL APPROACH;

ASSOCIATION RULES;

EID: 84864843490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45681-3_34     Document Type: Conference Paper

References (18)

1. C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In Proc. of PODS'98, pp. 18-24, June 1998. 410, 411
2. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD'93, pp. 207-216, May 1993. 410
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of VLDB'94, pp. 487-499, Sept. 1994. 412, 419
4. R. J. Bayardo Jr. Efficiently mining long patterns from databases. In Proc. of SIGMOD'98, pp. 85-93, June 1998. 412, 417
5. R. J. Bayardo and R. Agrawal Mining the most interesting rules. In Proc. of SIGKDD'99, pp. 145-153, Aug. 1999. 412
6. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. of SIGMOD'97, pp. 265-276, May 1997. 410, 411
7. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket analysis. In Proc. of SIGMOD'97, pp. 265-276, May 1997. 412
8. B. Dunkel and N. Soparkar. Data organization and access for efficient data mining. In Proc. of ICDE'99, pp. 522-529, March 1999. 414
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of SIGMOD'00, pp. 1-12, May 2000. 412
10. B. Liu, W. Hsu, and Y. Ma. Pruning and summarizing the discovered associations. In Proc. of SIGKDD'99, pp. 125-134, 1999. 410
11. S. Morishita and J. Sese. Traversing lattice itemset with statistical metric pruning. In Proc. of PODS'00, pp. 226-236, May 2000. 410, 411, 412, 413, 414
12. A. Nakaya, H. Hishigaki, and S. Morishita. Mining the quantitative trait loci associated with oral glucose tolerance in the OLETF rat. In Proc. of Pacific Symposium on Biocomputing, pp. 367-379, Jan. 2000. 421
13. J. S. Park, M. S. Chen, and P. S. Yu. An effective hash-based algorithm for mining association rules. In Proc. of SIGMOD'95, pp. 175-186, May 1995. 412
14. R. Rymon. Search through systematic set enumeration. In Proc. of KR'92, pp. 539-550, 1992. 417
15. P. Shenoy, J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbocharging vertical mining of large databases. In Proc. of SIGMOD'00, pp. 22-33, May 2000. 414
16. G. I. Webb. Efficient search for association rules. In Proc. of SIGKDD'00, pp. 99-107, Aug. 2000. 412
17. M. J. Zaki. Generating non-redundant association rules. In Proc. of SIGKDD'00, pp. 34-43, Aug. 2000. 414
18. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proc. of KDD'97, pp. 343-374, Aug. 1997. 412