Impact of Boolean factorization as preprocessing methods for classification of Boolean data
From MaRDI portal
Publication:2254610
DOI10.1007/s10472-014-9414-xzbMath1305.15036OpenAlexW2079758575MaRDI QIDQ2254610
Jan Outrata, Martin Trnecka, Radim Bělohlávek
Publication date: 5 February 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-014-9414-x
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Conceptual views on tree ensemble classifiers ⋮ Toward quality assessment of Boolean matrix factorizations ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ A methodology for analysis of concept lattice reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- From-below approximations in Boolean matrix factorization: geometry and new algorithm
- Ordinal Factor Analysis
- Discovery Science
This page was built for publication: Impact of Boolean factorization as preprocessing methods for classification of Boolean data
