Data Reduction for Boolean Matrix Factorization Algorithms Based on Formal Concept Analysis
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73588504" target="_blank" >RIV/61989592:15310/18:73588504 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0950705118302594" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0950705118302594</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.knosys.2018.05.035" target="_blank" >10.1016/j.knosys.2018.05.035</a>
Alternative languages
Result language
angličtina
Original language name
Data Reduction for Boolean Matrix Factorization Algorithms Based on Formal Concept Analysis
Original language description
Data size reduction is an important step in many data mining techniques. We present a novel approach based on formal concept analysis to data reduction tailored for Boolean matrix factorization methods. A general aim of these methods is to find factors that exactly or approximately explain data. The presented approach is able to significantly reduce the size of data by choosing a representative set of rows, and preserve (with a little loss) factors behind the data, i.e. it only slightly affects a quality of the factors produced by Boolean matrix factorization algorithms.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA15-17899S" target="_blank" >GA15-17899S: Decompositions of Matrices with Boolean and Ordinal Data: Theory and Algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
KNOWLEDGE-BASED SYSTEMS
ISSN
0950-7051
e-ISSN
—
Volume of the periodical
158
Issue of the periodical within the volume
OCT
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
6
Pages from-to
75-80
UT code for WoS article
000440529200007
EID of the result in the Scopus database
2-s2.0-85053035664