Number of the records: 1  

Comparison of Two Neural Networks Approaches to Boolean Matrix Factorization

  1. 1.
    SYSNO ASEP0328074
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleComparison of Two Neural Networks Approaches to Boolean Matrix Factorization
    TitleSrovnání dvou neuronových přístupů k boolevským rozkladům matic
    Author(s) Polyakov, P.Y. (RU)
    Frolov, A. A. (RU)
    Húsek, Dušan (UIVT-O) RID, SAI, ORCID
    Source TitleNetworked Digital Technologies. - Los Alamitos : IEEE Computer Society, 2009 / Snášel V. ; Pokorný J. ; Pichappan P. ; El-Qawasmeh E. - ISBN 978-1-4244-4614-8
    Pagess. 316-321
    Number of pages6 s.
    ActionNDT 2009. International Conference on Networked Digital Technologies /1./
    Event date29.07.2009-31.07.2009
    VEvent locationOstrava
    CountryCZ - Czech Republic
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordsdata mining ; artificial inteligence ; neural networks ; multivariate statistics ; Boolean factor analysis ; Hopfield-like neural networks ; feed forward neural network
    Subject RIVBB - Applied Statistics, Operational Research
    R&D ProjectsGA205/09/1079 GA ČR - Czech Science Foundation (CSF)
    1M0567 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000279656200052
    EID SCOPUS70450205917
    DOI https://doi.org/10.1109/NDT.2009.5272136
    AnnotationIn this paper we compare two new neural networks methods, aimed at solving the problem of optimal binary matrix Boolean factorization or Boolean factor analysis. Neural network based Boolean factor analysis is a suitable method for a very large binary data sets mining including web. Two types of neural networks based Boolean factor analyzers are analyzed. One based on feed forward neural network and second based on Hopfield-like recurrent neural network. We show that both methods give good results when processed data have a simple structure. But as the complexity of data structure grows, method based on feed forward neural network loses the ability to solve the Boolean factor analysis. In the method, based on the Hopfield like recurrent neural network, this effect is not observed.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2010
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.