Decomposable families of itemsets

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

Volumn 5212 LNAI, Issue PART 2, 2008, Pages 472-487

  Tatti, Nikolaj ^a   Heikinheimo, Hannes ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; HIDDEN MARKOV MODELS; ROBOT LEARNING; TREES (MATHEMATICS);

APPLICATION EXAMPLES; EFFICIENT ALGORITHMS; EMPIRICAL STUDIES; HIGH QUALITIES; ITEM SETS; MARKOV RANDOM FIELDS; MINING RESULTS; PROBABILISTIC MODELS; TREE STRUCTURES;

LEARNING SYSTEMS;

EID: 56149112936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87481-2_31     Document Type: Conference Paper

References (28)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD international conference on Management of data, pp. 207-216 (1993)
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast discovery of association rules. Advances in knowledge discovery and data mining, 307-328 (1996)
3. Han, J., Pei, J.: Mining frequent patterns by pattern-growth: methodology and implications. SIGKDD Explorations Newsletter 2(2), 14-20 (2000)
4. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery 15(1) (2007)
5. Cowell, R.G., Dawid, A.P., Lauritzen, S.L., Spiegelhalter, D.J.: Probabilistic Networks and Expert Systems. Statistics for Engineering and Information Science (1999)
6. Tatti, N., Heikinheimo, H.: Decomposable families of itemsets. Technical Report TKK-ICS-R1, Helsinki University of Technology (2008), http://www.otalib.fi/tkk/edoc/
7. Jiroušek, R., Přeušil, S.: On the effective implementation of the iterative proportional fitting procedure. Computational Statistics and Data Analysis 19, 177-189 (1995)
8. Csiszár, I.: I-divergence geometry of probability distributions and minimization problems. The Annals of Probability 3(1), 146-158 (1975)
9. Tatti, N.: Computational complexity of queries based on itemsets. Information Processing Letters, 183-187 (June 2006)
10. Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14(3), 462-467 (1968)
11. Schwarz, G.: Estimating the dimension of a model. Annals of Statistics 6(2), 461-464 (1978)
12. Akaike, H.: A new look at the statistical model identification. IEEE Transactions on Automatic Control 19(6), 716-723 (1974)
13. Grünwald, P.D.: The Minimum Description Length Principle (Adaptive Computation and Machine Learning). MIT Press, Cambridge (2007)
14. Kontkanen, P., Myllymäki, P.: A linear-time algorithm for computing the multinomial stochastic complexity. Information Processing Letters 103(6), 227-233 (2007)
15. Rissanen, J.: Fisher information and stochastic complexity. IEEE Transactions on Information Theory 42(1), 40-47 (1996)
16. Hailperin, T.: Best possible inequalities for the probability of a logical function of events. The American Mathematical Monthly 72(4), 343-359 (1965)
17. Bykowski, A., Seppänen, J.K., Hollmën, J.: Model-independent bounding of the supports of Boolean formulae in binary data. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds.) Database Support for Data Mining Applications. LNCS (LNAI), vol. 2682, pp. 234-249. Springer. Heidelberg (2004)
18. Tatti, N.: Safe projections of binary data sets. Acta Informatica 42(8-9), 617-638 (2006)
19. Fortelius, M.: Neogene of the old world database of fossil mammals (NOW). University of Helsinki (2005), http://www.helsinki.fi/science/now/
20. Mitchell-Jones, A.J., Amori, G., Bogdanowicz, W., Krystufek, B., Reijnders, P.J.H., Spitzenberger, F., Stubbe, M., Thissen, J.B.M., Vohralik, V., Zima, J.: The Atlas of European Mammals. Academic Press, London (1999)
21. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398-416. Springer. Heidelberg (1998)
22. Roberto. J., Bayardo, J.: Efficiently mining long patterns from databases. In: ACM SIGMOD international conference on Management of data, pp. 85-93. ACM, New York (1998)
23. Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: European Conference on Principles and Practice of Knowledge Discovery in Databases (2002)
24. Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: A profilebased approach. In: ACM SIGKDD international conference on Knowledge Discovery and Data Mining (2005)
25. Siebes, A., Vreeken, J., van Leeuwen, M.: Item sets that compress. In: SIAM Conference on Data Mining, pp. 393-404 (2006)
26. Bringmann, B., Zimmermann, A.: The chosen few: On identifying valuable patterns. In: IEEE International Conference on Data Mining (2007)
27. Deshpande, A., Garofalakis, M.N., Jordan, M.I.: Efficient stepwise selection in decomposable models. In: Conference in Uncertainty in Artificial Intelligence, pp. 128-135. Morgan Kaufmann Publishers Inc, San Francisco (2001)
28. Altmueller, S.M., Haralick, R.M.: Practical aspects of efficient forward selection in decomposable graphical models. In: IEEE International Conference on Tools with Artificial Intelligence, pp. 710-715. IEEE Computer Society, Washington (2004)