Model order selection for boolean matrix factorization

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

Volumn , Issue , 2011, Pages 51-59

  Miettinen, Pauli ^a   Vreeken, Jilles ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Algorithms; Experimentation; Theory

Indexed keywords

BOOLEAN ALGEBRA; DATA MINING; MATRIX FACTORIZATION; PROBLEM SOLVING;

BOOLEAN MATRIX; DATA MATRIX; DATA-MINING TOOLS; EXPERIMENTATION; GLOBAL STRUCTURE; MATRIX; MATRIX FACTORIZATIONS; MODEL-ORDER SELECTION; SELECTION PROBLEMS; THEORY;

MATRIX ALGEBRA;

EID: 80052648024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020424     Document Type: Conference Paper

References (42)

1. R. Belohlavek and V. Vychodil. Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Comp. Sys. Sci., 76(1):3-20, 2010.
2. R. Cattell. The scree test for the number of factors. Multivar. Behav. Res., 1:245-276, 1966.
3. V. Chandola and V. Kumar. Summarization - compressing data into an informative representation. Knowl. Inf. Syst., 12(3):355-378, 2007.
4. R. Cilibrasi and P. Vitanyi. Clustering by compression. IEEE Trans. Inform. Theory, 51(4):1523-1545, 2005. (Pubitemid 40573236)
5. T. Cover and J. Thomas. Elements of Information Theory, 2nd ed. John Wiley and Sons, 2006.
6. C. T. dos S. Dias and W. J. Krzanowski. Model selection and cross validation in additive main effect and multiplicative interaction models. Crop Sci., 43:865-873, 2003. (Pubitemid 36530949)
7. S. M. Embleton and E. S. Wheeler. Finnish dialect atlas for quantitative studies. J. Quant. Ling., 4(1-3):99-102, 1997.
8. C. Faloutsos and V. Megalooikonomou. On data mining, compression and Kolmogorov complexity. Data Min. Knowl. Disc., 15:3-20, 2007. (Pubitemid 47142808)
9. U. Fayyad and K. Irani. Multi-interval discretization of continuous-valued attributes for classification learning. In Proc. UAI'93, pages 1022-1027, 1993.
10. M. Fortelius et al. Neogene of the old world database of fossil mammals (NOW), 2003. http://www.helsinki.fi/science/now/.
11. G. C. Garriga, E. Junttila, and H. Mannila. Banded structure in binary matrices. In Proc. KDD'08, pages 292-300, 2008.
12. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In Proc. DS'04, pages 278-289, 2004. (Pubitemid 39745469)
13. G. H. Golub and C. F. Van Loan. Matrix Computations. JHU Press, 1996.
14. P. D. Grünwald. The Minimum Description Length Principle. MIT Press, 2007.
15. H. Heikinheimo, J. Vreeken, A. Siebes, and H. Mannila. Low-entropy set selection. In Proc. SDM'09, 2009.
16. E. Keogh, S. Lonardi, and C. A. Ratanamahatana. Towards parameter-free data mining. In Proc. KDD'04, pages 206-215, 2004. (Pubitemid 40114930)
17. K.-N. Kontonasios and T. De Bie. An information-theoretic approach to finding noisy tiles in binary databases. In Proc. SDM'10, 2010.
18. M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1993.
19. H. Lu, J. Vaidya, and V. Atluri. Optimal Boolean matrix decomposition: Application to role engineering. In Proc. ICDE'08, pages 297-306, 2008.
20. P. Miettinen. Matrix Decomposition Methods for Data Mining: Computational Complexity and Algorithms. PhD thesis, University of Helsinki, 2009.
21. P. Miettinen. Sparse Boolean matrix factorizations. In Proc. ICDM'10, pages 935-940, 2010.
22. P. Miettinen, T. Mielikäinen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. IEEE Trans. Knowl. Data Eng., 20(10):1348-1362, 2008.
23. T. P. Minka. Automatic choice of dimensionality for PCA. In Proc. NIPS'00, pages 598-604, 2001.
24. A. J. Mitchell-Jones, G. Amori, W. Bogdanowicz, B. Krystufek, P. J. H. Reijnders, F. Spitzenberger, M. Stubbe, J. B. M. Thissen, V. Vohralik, and J. Zima. The Atlas of European Mammals. Academic Press, 1999.
25. S. D. Monson, N. J. Pullman, and R. Rees. A survey of clique and biclique coverings and factorizations of (0; 1)-matrices. Bulletin of the ICA, 14:17-86, 1995.
26. S. Myllykangas, J. Himberg, T. Böhling, B. Nagy, J. Hollmén, and S. Knuutila. DNA copy number amplification profiling of human neoplasms. Oncogene, 25(55), 2006.
27. D. S. Nau, G. Markowsky, M. A. Woodbury, and D. B. Amos. A mathematical analysis of human leukocyte antigen serology. Math. Biosci., 40:243-270, 1978. (Pubitemid 9045614)
28. A. B. Owen and P. O. Perry. Bi-cross-validation of the SVD and the nonnegative matrix factorization. Ann. Appl. Stat., 3(2):564-594, Jun 2009.
29. P. Paatero and U. Tapper. Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics, 5:111-126, 1994.
30. V. Pestov. An axiomatic approach to intrinsic dimension of a dataset. Neural Networks, 21(2-3):204-213, 2008.
31. J. Rissanen. Modeling by shortest data description. Automatica, 14(1):465-471, 1978.
32. M. Schmidt, O. Winther, and L. Hansen. Bayesian non-negative matrix factorization. In Proc. ICA'09, volume 5411 of LNCS, pages 540-547, 2009.
33. A. Streich, M. Frank, D. Basin, and J. Buhmann. Multi-assignment clustering for Boolean data. In Proc. ICML'09, pages 969-976, 2009.
34. N. Tatti, T. Mielikainen, A. Gionis, and H. Mannila. What is the dimension of your binary data? In Proc. ICDM'06, pages 603-612, 2006.
35. N. Tatti and J. Vreeken. Finding good itemsets by packing data. In Proc. ICDM'08, pages 588-597, 2008.
36. J. Vaidya, V. Atluri, and Q. Guo. The role mining problem: Finding a minimal descriptive set of roles. In Proc. SACMAT, pages 175-184, 2007. (Pubitemid 47281553)
37. J. Vreeken and A. Siebes. Filling in the blanks - KRIMP minimisation for missing data. In Proc. ICDM'08, pages 1067-1072, 2008.
38. J. Vreeken, M. van Leeuwen, and A. Siebes. Krimp: Mining itemsets that compress. Data Min. Knowl. Discov., 19(2):176-193, 2010. 10.1007/s10618-010- 0202-x.
39. C. Wallace. Statistical and inductive inference by minimum message length. Springer-Verlag, 2005.
40. J. Wang and G. Karypis. On efficiently summarizing categorical databases. Knowl. Inf. Syst., 9(1):19-37, 2006. (Pubitemid 43231145)
41. K. Yeomans and P. Golder. The Guttman-Kaiser criterion as a predictor of the number of common factors. The Statistician, 31(3):221-229, 1982.
42. M. Zhu and A. Ghodsi. Automatic dimensionality selection from the scree plot via the use of profile likelihood. Comp. Stat. & Data Anal., 51(2):918-930, 2006. (Pubitemid 44635870)