Support approximations using Bonferroni-type inequalities

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

Volumn 2431 LNAI, Issue , 2002, Pages 212-224

  Jaroszewicz, Szymon ^a   Simovici, Dan A ^a  

^a UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

Bonferroni inequalities; Frequent itemsets; Query support

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BONFERRONI INEQUALITIES; BONFERRONI-TYPE INEQUALITY; BOOLEAN EXPRESSIONS; ITEM SETS; QUERY SUPPORTS;

DATA MINING;

EID: 23044534221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45681-3_18     Document Type: Conference Paper

References (13)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Inkeri Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, Menlo Park, 1996. 213, 220, 221
2. L. Buzzigoli and A. Giusti. An algorithm to calculate the lower and upper bounds of the elements of an array given its marginals. In Statistical Data Protection (SDP'98), Eurostat, pages 131-147, Luxembourg, 1999. 212
3. C. L. Blake and C. J. Merz. UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences, http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998. 220
4. A. Dobra. Computing sharp integer bounds for entries in contingency tables given a set of fixed marginals. Technical report, Department of Statistics, Carnegie Mellon University, http://www.stat.cmu.edu/~adobra/bonf- two.pdf, 2001. 212
5. J. Galambos and I. Simonelli. Bonferroni-type Inequalities with Applications. Springer, 1996. 212, 214, 215, 223
6. S. Jaroszewicz, D. Simovici, and I. Rosenberg. An inclusion-exclusion result for boolean polynomials and its applications in data mining. In Proceedings of the Discrete Mathematics in Data Mining Workshop, SIAM Datamining Conference, Washington, D.C., 2002. 215, 223
7. J. Kahn, N. Linial, and A. Samorodnitsky. Inclusion-exclusion: Exact and approximate. Combinatorica, 16:465-477, 1996. 212
8. H. Mannila. Combining discrete algorithms and probabilistic approaches in data mining. In L. DeRaedt and A. Siebes, editors, Principles of Data Mining and Knowledge Discovery, volume 2168 of Lecture Notes in Artificial Intelligence, page 493. Springer-Verlag, Berlin, 2001. 212
9. H. Mannila. Global and local methods in data mining: basic techniques and open problems. In ICALP 2002, 29th International Colloquium on Automata, Languages, and Programming, Malaga, Spain, June 2002. Springer-Verlag. 212, 223
10. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96), pages 189-194, Portland, Oregon, 1996. 212
11. D. Pavlov, H. Mannila, and P. Smyth. Probabilistic models for query approximation with large sparse binary data sets. In Proc. of Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI-00), Stanford, 2000. 212
12. D. Pavlov, H. Mannila, and P. Smyth. Beyond independence: Probabilistic models for query approximation on binary transaction data. ICS TR-01-09, University of California, Irvine, 2001. 212
13. A. Rényi. Quelques remarques ser les probabilites des evenements dependants. Journal de Mathematique, 37:393-398, 1958. 216