Computational complexity of queries based on itemsets

Information Processing Letters

Volumn 98, Issue 5, 2006, Pages 183-187

  Tatti, Nikolaj ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Computational complexity; Data mining; Itemset

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; ENTROPY; ESTIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

BOUNDS OF THE FREQUENCIES; CONJUNCTIONS; CONSISTENCY; FREQUENT SETS; INTRACTABLE; ITEMSETS; MAXIMUM ENTROPY ESTIMATE; NP-COMPLETE; PP-HARD;

QUERY LANGUAGES;

EID: 33645086407     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.02.003     Document Type: Article

References (15)

1. R. Agrawal, T. Imielinski, A.N. Swami, Mining association rules between sets of items in large databases, in: P. Buneman, S. Jajodia (Eds.), Proc. 1993 ACM SIGMOD Internat. Conf. on Management of Data, Washington, DC, 26-28 May, 1993, pp. 207-216
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo Fast discovery of association rules U.M. Fayyad G. Piatetsky-Shapiro P. Smyth R. Uthurusamy Advances in Knowledge Discovery and Data Mining 1996 AAAI Press/The MIT Press Cambridge, MA 307 328
3. D.D. Bailey, V. Dalmau, P.G. Kolaitis, Phase transitions of PP-complete satisfiability problems, in: IJCAI, 2001, pp. 183-192
4. A. Bykowski, J.K. Seppänen, and J. Hollmén Model-independent bounding of the supports of Boolean formulae in binary data P.L. Lanzi R. Meo Database Technologies for Data Mining 2003 Springer-Verlag Berlin
5. T. Calders, Axiomatization and deduction rules for the frequency of itemsets, PhD thesis, University of Antwerp, Belgium, 2003
6. T. Calders, Computational complexity of itemset frequency satisfiability, in: Proc. 23nd ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database System, 2004
7. G. Cooper The computational complexity of probabilistic inference using Bayesian belief networks Artificial Intelligence 42 2-3 1990 393 405
8. I. Csiszár I-divergence geometry of probability distributions and minimization problems Ann. Probab. 3 1 1975 146 158
9. G. Georgakopoulos, D. Kavvadias, and C.H. Papadimitriou Probabilistic satisfiability J. Complexity 4 1 1988 1 11
10. T. Hailperin Best possible inequalities for the probability of a logical function of events Amer. Math. Monthly 72 4 1965 343 359
11. S. Kullback Information Theory and Statistics 1968 Dover Publications, Inc. New York
12. T. Lukasiewicz Probabilistic logic programming with conditional constraints ACM Trans. Comput. Logic (TOCL) 2 3 2001 289 339
13. C. Papadimitriou Computational Complexity 1995 Addison-Wesley Reading, MA
14. C. Papadimitriou, and K. Steiglitz Combinatorial Optimization Algorithms and Complexity second ed. 1998 Dover New York
15. D. Pavlov, H. Mannila, and P. Smyth Beyond independence: Probabilistic models for query approximation on binary transaction data IEEE Trans. Knowledge Data Engrg. 15 6 2003 1409 1421