The Boolean column and column-row matrix decompositions

Data Mining and Knowledge Discovery

Volumn 17, Issue 1, 2008, Pages 39-56

  Miettinen, Pauli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Approximation; Boolean decompositions; CUR decomposition; CX decomposition; Matrix decompositions

Indexed keywords

BOOLEAN ALGEBRA; BOOLEAN FUNCTIONS; CANNING; COLUMNS (STRUCTURAL); DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MATRIX ALGEBRA; SEARCH ENGINES;

BINARY MATRICES; BUSINESS MEDIA; DATA MATRICES; EXPERIMENTAL EVALUATIONS; INPUT DATA; INTERPRETABLE REPRESENTATION; MATRIX DECOMPOSITIONS; NON NEGATIVITY; REAL DATA; SIMPLE ALGORITHMS; SUB-PROBLEMS;

DECOMPOSITION;

EID: 48349110118     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-008-0107-0     Document Type: Conference Paper

References (16)

1. Berry MW, Pulatova SA, Stewart GW (2005) Algorithm 844: computing sparse reduced-rank approximations to sparse matrices. ACM Trans Math Softw 31(2): 252-269
2. Berry M et al (2007) Algorithms and applications for approximate nonnegative matrix factorization. Comput Stat Data Anal 52(1): 155-173
3. Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. J Mach Learn Res 3: 993-1022
4. Drineas P, Mahoney MW, Muthukrishnan S (2007) Relative-error CUR matrix decompositions. Technical report arXiv:0708.3696v1 [cs.DS]
5. Fortelius M (2003) Neogene of the old world database of fossil mammals (NOW). http://www.helsinki.fi/science/now/. Accessed 17 July 2003
6. Fortelius M et al (2006) Spectral ordering and biochronology of European fossil mammals. Paleobiology 32(2): 206-214
7. Golub GH, Van Loan CF (1996) Matrix computations. Johns Hopkins University Press
8. Hofmann T (1999) Probabilistic latent semantic indexing. In: Proceedings of the 22nd ACM SIGIR conference on research and development in information retrieval, pp 50-57
9. Hyvönen S, Miettinen P, Terzi E (2008) Interpretable nonnegative matrix decompositions. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery & data mining (KDD) (in press)
10. Kozlov M, Tarasov S, Hačijan L (1979) Polynomial solvability of convex quadratic programming. Soviet Math Dokl 20(5): 1108-1111
11. Lu H, Vaidya J, Atluri V (2008) Optimal Boolean matrix decomposition: application to role engineering. In: Proceedings of the 24th IEEE international conference on data engineering (ICDE), p 297-306
12. Miettinen P (2008a) On the positive-negative partial set cover problem. Inform Process Lett. doi: 10.1016/j.ipl.2008.05.007 (in press)
13. Miettinen P et al (2008b) The discrete basis problem. IEEE Trans Knowl Data Eng. doi: 10.1109/tkde.2008.53 (in press)
14. MAX and red-blue set cover problems. J Discrete Algorithms 5: 55-64
15. Sun J et al (2008) Less is more: sparse graph mining with compact matrix decomposition. Stat Anal Data Min 1(1): 6-22
16. Zhang Z et al (2007) Binary matrix factorization with applications. In: Proceedings of the 7th IEEE international conference on data mining (ICDM), pp 391-400