Efficient data reduction with EASE

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2003, Pages 59-68

  Brönnimann, Hervé ^a   Chen, Bin ^b   Dash, Manoranjan ^c   Haas, Peter ^d   Scheuermann, Peter ^c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b EXELIXIS INC   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Association rules; Count dataset; Data streams; Frequency estimation; OLAP; Sampling

Indexed keywords

ANALYSIS PROBLEMS; APPROXIMATION METHODS; ASSOCIATION RULE MINING; CLASSICAL ALGORITHMS; CONTINGENCY TABLE ANALYSIS; DATA APPLICATION; DATA PROBLEMS; DATA SETS; DATA STREAM; DATA STREAMS; DATA-REDUCTION ALGORITHMS; FAST ALGORITHMS; OLAP; RANDOM SAMPLE; RULE DISCOVERY; SCALABILITY PROBLEMS; SIMPLE RANDOM SAMPLING; SMALL SAMPLES;

ALGORITHMS; APPROXIMATION THEORY; ASSOCIATION RULES; ASSOCIATIVE PROCESSING; DATA COMMUNICATION SYSTEMS; DATA MINING; DATA REDUCTION; EXPOSURE CONTROLS; FIRE FIGHTING EQUIPMENT;

FREQUENCY ESTIMATION;

EID: 26944447201     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956761     Document Type: Conference Paper

References (14)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD International Conference on Manageent of Data, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of International Conference on Very large Databases (VLDB), 1994.
3. N. Alon and J. H. Spencer. The probabilistic method Wiley Interscience, New York, 1992.
4. H. Bronnimann, B. Chazelle, and J. Matousek. Product range spaces, sensitive sampling, and derandomization. SIAM Journal of Computing, 1999.
5. H. Bronnimann, B. Chen, M. Dash, and P. Haas, P. Scheuermann. Efficient data reduction method for on-line association rule discovery. In Proceedings of NSF Workshop on New Generation of Data Mining 2002.
6. B. Chazelle. The discrepancy method. Cambridge University Press, Cambridge, United Kingdom, 2000.
7. B. Chen, P. Haas, and P. Scheuermann. A new two-phase sampling based algorithm for discovering association rules. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.
8. J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In Proceedings of 12th International Conference on Data Engineering (ICDE), pages 152-159, 1996.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of ACM SIGMOD International Conference on Management of Data, 2000.
10. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In Proceedings of International Conference on Very large Databases (VIDB), 2002.
11. J. Matousek. Derandomization in computational geometry. Journal of Algorithms, 20 (3):545-580, 1996.
12. H. Toivonen. Sampling large databases for association rules. In Proceedings of International Conference on Very Large Databases (VIDB), 1996.
13. L. G. Valiant. A theory of the learnable Communications of the Association for Computing Machinery, 27 (11):1134-1142, 1984.
14. M. J. Zaki, S. Parthasarathy, W. Lin, and M. Ogihara. Evaluation of sampling for data mining of association rules. Technical Report Report RC 617, University of Rochester Rochester, NY, 1996.