A new approach for the discovery of frequent itemsets

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

Volumn 1676, Issue , 1999, Pages 193-202

  Meo, Rosa ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; WAREHOUSES;

CARDINALITIES; CRITICAL TASKS; ITEM SETS; LARGE DATABASE; LARGE POPULATION; LINEAR SCALE; MAIN MEMORY; NEW APPROACHES;

DATABASE SYSTEMS;

EID: 84958042272     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48298-9_21     Document Type: Conference Paper

References (7)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo. Fast discovery of association rules. In Knowledge Discovery in Databases, AAAI/MIT Press, 1995.
2. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995.
3. J.S. Park, M. Shen, and P.S. Yu. An effective hash based algorithm for mining association rules. In Proc. of the ACM SIGMOD International Conference on Management of Data, San Jose, California, 1995.
4. S. Brin, R. Motwani, J.D. Ullman, and S. Tsur. Dynamic itemsets counting and implication rules for market basket data. In Proc. of the ACM SIGMOD International Conference on Management of Data, vol.26,2 of SIGMOD Record, p.255-264, New York, 1997.
5. H. Toivonen. Sampling large databases for association rules. In Proc. of the 22nd VLDB Conference, Bombay, India, 1996.
6. D.I. Lim and Z.M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. In Proc. of the EDBT’98 Conference, Valencia, Spain, 1998.
7. R.J. Bayardo. Efficiently mining long patterns from databases. In Proc. of the SIGMOD’98 Conference, Seattle, WA, USA, 1998