Approximating a collection of frequent sets

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 12-19

  Afrati, Foto ^a   Gionis, Aristides ^b   Mannila, Heikki ^b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Foundations of data mining; Mining frequent itemsets

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATABASE SYSTEMS; POLYNOMIAL APPROXIMATION; PROBABILITY;

FOUNDATIONS OF DATA MINING; FREQUENT PATTERNS; MINING FREQUENT ITEMSETS; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS;

SET THEORY;

EID: 12244313034     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014057     Document Type: Conference Paper

References (14)

1. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining associations between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 207-216, 1993.
2. Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Proceedings of the IEEE International Conference on Data Engineering, pages 3-14, 1995.
3. Toon Calders and Bart Goethals. Mining all non-derivable frequent itemsets. In Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery, pages 74-85, 2002.
4. Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, and Jeffrey D. Ullman. Computing iceberg queries efficiently. In Proceedings of the 24th International Conference on Very Large Data Bases, pages 299-310, New York City, USA, 1998.
5. William Feller. An introduction to probability theory and its applications. John Wiley & Sons, 1968.
6. M.R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
7. Bart Goethals. Frequent itemset mining implementations. http://ww.cs.helsinki.fi/u/goethals/software/.
8. Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov. Mining top-k frequent closed patterns without minimum support. In Proceedings of the IEEE International Conference on Data Mining, pages 211-218, 2002.
9. Dorit Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishing Company, 1997.
10. Ron Kohavi, Carla Brodley, Brian Frasca, Llew Mason, and Zijian Zheng. KDD-Cup 2000 Organizers' Report: Peeling the Onion. SIGKDD Explorations, 2(2):86-98, 2000. http://www.ecn.purdue.edu/KDDCUP/.
11. Heikki Mannila, Hannu Toivonen, and Inkeri Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259-289, 1997.
12. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
13. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In 7th International Conference on Database Theory, pages 398-416, 1999.
14. Jian Pei, Guozhu Dong, Wei Zou, and Jiawei Han. On computing condensed frequent pattern bases. In Proceedings of the IEEE International Conference on Data Mining, 2002.