Multiple uses of frequent sets and condensed representations Extended abstract

Proceedings - 2nd International Conference on Knowledge Discovery and Data Mining, KDD 1996

Volumn , Issue , 1996, Pages 189-194

  Heikki, Mannila ^a   Hannu, Toivonen ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA MINING; ERROR ANALYSIS; QUERY PROCESSING;

CONDENSED REPRESENTATIONS; DATA CUBE; DERIVE BOUNDS; ERROR BOUND; EXTENDED ABSTRACTS; FREQUENT SETS; INCLUSION EXCLUSION PRINCIPLE; INTERACTIVE DATA MINING; MULTIPLE USE; SET REPRESENTATION;

ASSOCIATION RULES;

EID: 85173802195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Agrawal, R.; Mannila, H.; Srikant, R.; Toivonen, H.; and Verkamo, A. I. 1996. Fast discovery of association rules. In Fayyad, U. M.; Piatetsky-Shapiro, G.; Smyth, P.; and Uthurusamy, R., eds., Advances m Knowledge Discovery and Data Mining. Menlo Park, CA: AAAI Press. 307 - 328.
2. Agrawal, R.; Imielinski, T.; and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'93), 207 -216.
3. Grable, D. A. 1993. Sharpened bonferroni inequalities. Journal on Combinatorial Theory, Series B 57(1) :131 - 137.
4. Grable, D. A. 1994. Hypergraphs and sharpened sieve inequalities. Discrete Mathematics 132:75 - 82.
5. Gray, J.; Bosworth, A.; Layman, A.; and Pirahesh, H. 1996. Data Cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In 12th International Conference on Data Engineering (ICDE'96), 152 - 159.
6. Han, J., and Fu, Y. 1995. Discovery of multiple-level association rules from large databases. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB'95), 420 - 431.
7. Haussler, D., and Welzl, E. 1987. Epsilon-nets and simplex range queries. Discrete Comput. Geom. 2:127-151.
8. Holsheimer, M.; Kersten, M.; Mannila, H.; and Toivonen, H. 1995. A perspective on databases and data mining. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD'95), 150 - 155.
9. Houtsma, M., and Swami, A. 1993. Set-oriented mining of association rules. Research Report RJ 9567, IBM Almaden Research Center, San Jose, California.
10. Kahn, J.; Linial, N.; and Samorodnitsky, A. 1995. Inclusion-exclusion: exact and approximate. Manuscript.
11. Klemettinen, M.; Mannila, H.; Ronkainen, P.; Toivonen, H.; and Verkamo, A.I. 1994. Finding interesting rules from large sets of discovered association rules. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), 401 - 407. Gaithersburg, MD: ACM.
12. Linial, N., and Nisan, N. 1990. Approximate inclusion-exclusion. Combmatorica 10(4):349 - 365.
13. Mannila, H., and Toivonen, H. 1996. On an algorithm for finding all interesting sentences. In Cybernetics and Systems, Volume II, The Thirteenth European Meeting on Cybernetics and Systems Research, 973 -978.
14. Mulmuley, K. 1993. Computational Geometry: An Introduction Through Randomized Algorithms. New York: Prentice Hall.
15. Park, J. S.; Chen, M.-S.; and Yu, P. S. 1995. An effective hash-based algorithm for mining association rules. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD'95), 175 - 186.
16. Savasere, A.; Omiecinski, E.; and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB'95), 432
17. Srikant, R., and Agrawal, R. 1995. Mining generalized association rules. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB'95), 407- 419.
18. Srikant, R., and Agrawal, R. 1996. Mining quantitative association rules in large relational tables. In Proceedings of CM SIGMOD Conference on Management of Data (SIGMOD'96).
19. Toivonen, H. 1996. Sampling large databases for finding association rules. In Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB'96). To appear.
20. Vapnik, V. 1982. Estimation of Dependencies Based on Em.pirical Data. New York: Springer-Verlag.