Distribution-based synthetic database generation techniques for itemset mining

Proceedings of the International Database Engineering and Applications Symposium, IDEAS

Volumn 2005-January, Issue January, 2005, Pages 307-316

  Ramesh, Ganesh ^a   Zaki, Mohammed J ^b   Maniatty, William A ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING;

COMPRESSION METHODS; DATABASE GENERATION; FREQUENT PATTERN MINING; GENERATION TECHNIQUES; LENGTH DISTRIBUTIONS; PERFORMANCE OF ALGORITHM; RESOURCE REQUIREMENTS; SYNTHETIC DATABASE;

DATABASE SYSTEMS;

EID: 74849096429     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2005.22     Document Type: Conference Paper

References (19)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB Conference, 1994.
2. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD Conference, 1998.
3. Toon Calders and Bart Goethals. Mining all non-derivable item-sets. In Principles of Data Mining and Knowledge Discovery, 2002.
4. Artur Bykowski et al. A condensed representation to find frequent patterns. In ACM PODS Conference, 2001.
5. Dimitrios Gunopulos et al. Discovering all most specific sentences. ACM TODS, 2003.
6. R. Agrawal et al. Fast discovery of association rules. In U. Fayyad and et al, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
7. Richard M. Karp et al. A simple algorithm for finding frequent elements in streams and bags. ACM TODS, 2003.
8. A. Evfimievski, R. Srikant, R. Agrawal, and J. E. Gehrke. Privacy preserving mining of association rules. In ACM SIGKDD Conference, 2002.
9. Bart Goethals, Floris Geerts, and Jan Van den Bussche. A tight upper bound on the number of candidate patterns. In IEEE ICDM Conference, 2001.
10. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In IEEE ICDM Conference, 2001.
11. J. Han and M. Kamber. Data mining: concepts and techniques. Morgan Kaufman. 2000.
12. Murat Kantarcioglu and Chris Clifton. Privacy preserving data mining of association rules on vertically partitioned data. In ACMKDD Conference, 2003.
13. Heikki Mannila and Hannu Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1997.
14. Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizations of constrained association rules. In ACM SIGMOD Conference, 1998.
15. Ganesh Ramesh, William A. Maniatty, and Mohammed J. Zaki. Indexing and Data Access Methods for Database Mining. In ACM SIGMOD Workshop - DMKD, 2002.
16. Ganesh Ramesh, William A. Maniatty, and Mohammed J. Zaki. Feasible itemset distributions in data mining: Theory and application. In ACM PODS Conference, 2003.
17. Yang G. The Complexity of Mining Maximal Frequent Item-sets and Maximal Frequent Patterns. In ACMKDD Conference, 2004.
18. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD Conference, 1997.
19. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In ACM KDD Conference, 2001.