Finding low-entropy sets and trees from binary data

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

Volumn , Issue , 2007, Pages 350-359

  Heikinheimo, Hannes ^a   Seppänen, Jouni K ^a   Hinkkanen, Eino ^b   Mannila, Heikki ^b   Mielikäinen, Taneli ^b  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Local models; Pattern discovery

Indexed keywords

DEPENDENCY STRUCTURE; LOCAL MODELS; PATTERN DISCOVERY;

BINARY SEQUENCES; PATTERN RECOGNITION; TREES (MATHEMATICS);

DATA PROCESSING;

EID: 36849033944     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281232     Document Type: Conference Paper

References (24)

1. AGRAWAL, R., GEHRKE, J., GUNOPULOS, D., AND RAGHAVAN, P. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD Conference (1998), pp. 94-105.
2. AGRAWAL, R., IMIELINSKI, T., AND SWAMI, A. N. Mining association rules between sets of items in large databases. In SIGMOD Conference (1993), pp. 207-216.
3. AGRAWAL, R., MANNILA, H., SRIKANT, R., TOIVONEN, H., AND VERKAMO, A. I. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, 1996, pp. 307-328.
4. ANTHONY, M., AND BIGGS, N. Computational Learning Theory: An Introduction. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1997.
5. BRINGMANN, B., ZIMMERMANN, A., DE RAEDT, L., AND NIJSSEN, S. Don't be afraid of simpler patterns. In PKDD (2006), pp. 55-66.
6. CHOW, C. K., AND LIU, C. N. Approximating discrete probability distributions with dependence trees. IEEE Trans. Info. Theory 14, 3 (1968), 462-467.
7. COOPER, G. F., AND HERSKOVITS, E. A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9 (1992), 309-347.
8. COVER, T. M., AND THOMAS, J. A. Elements of Information Theory. Wiley Series in Telecommunications. Wiley Interscience, 1991.
9. FRIEDMAN, J. H., AND TUKEY, J. W. A projection pursuit algorithm for exploratory data analysis. IEEE Trans. Comput. 23 (1974), 881-890.
10. GIONIS, A., KUJALA, T., AND MANNILA, H. Fragments of order. In KDD (2003), pp. 129-136.
11. GIONIS, A., MANNILA, H., MIELIKÄINEN, T., AND TSAPARAS, P. Assessing data mining results via swap randomization. In KDD (2006), pp. 167-176.
12. HASTIE, T., TIBSHIRANI, R., AND FRIEDMAN, J. The Elements of Statistical Learning. Springer, 2001.
13. HECKERMAN, D., GEIGER, D., AND CHICKERING, D. M. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning 20, 3 (1995), 197-243.
14. HEIKINHEIMO, H., MANNILA, H., AND SEPPÄNEN, J. K. Finding trees from unordered 0-1 data. In PKDD (2006), pp. 175-186.
15. HUBER, P. J. Projection pursuit. The Annals of Statistics 13, 2 (June 1985), 435-475.
16. KNOBBE, A. J., AND HO, E. K. Y. Maximally informative k-itemsets and their efficient discovery. In KDD (2006), pp. 237-244.
17. KOIVISTO, M. Advances in exact Bayesian structure discovery in Bayesian networks. In UAI (2006), pp. 241-248.
18. MEILǍ, M., AND JORDAN, M. I. Learning mixtures of trees. Journal of Machine Learning Research 1 (2000), 1-48.
19. MORISHITA, S., AND SESE, J. Traversing itemset lattice with statistical metric pruning. In PODS (2000), ACM, pp. 226-236.
20. PARSONS, L., HAQUE, E., AND LIU, H. Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl. 6, 1 (2004), 90-105.
21. PEARL, J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
22. SIEBES, A., VREEKEN, J., AND VAN LEEUWEN, M. Item sets that compress. In SDM (2006), J. Ghosh, D. Lambert, D. B. Skillicorn, and J. Srivastava, Eds., SIAM.
23. VAN LEEUWEN, M., VREEKEN, J., AND SIEBES, A. Compression picks item sets that matter. In PKDD (2006), pp. 585-592.
24. ZIMMERMANN, A., AND DE RAEDT, L. CorClass: Correlated association rule mining for classification. In Discovery Science (2004), E. Suzuki and S. Arikawa, Eds., vol. 3245 of Lecture Notes in Computer Science, Springer, pp. 60-72.