Search results

  1. 1.
    0428419 - ÚI 2015 RIV RU rus J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Polyakov, P.Y.
    Algoritm bulevskogo faktornogo analiza, osnovannyj na kombinirovanii nejrosetevogo podchoda i metoda maksimizacii funkcii pravdopodobija.
    [Combined Algorithm for Boolean Factor Analysis based on Neural Network and Likelihood Maximization Approaches.]
    Nejrokomp'jutery: razrabotka, primenenie. -, č. 3 (2014), s. 3-11. ISSN 1999-8554
    Institutional support: RVO:67985807
    Keywords : boolean factor analysis * attractor neural network * likelihood function maximization * KEGG database
    Subject RIV: IN - Informatics, Computer Science
    http://www.radiotec.ru/catalog.php?cat=jr7&art=14354
    Permanent Link: http://hdl.handle.net/11104/0233787
     
     
  2. 2.
    0398493 - ÚI 2015 RIV NL eng J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Polyakov, P.Y. - Snášel, V.
    New BFA Method Based on Attractor Neural Network and Likelihood Maximization.
    [Nová metoda BFA založená na atraktorové neuronové síti a maximalizaci věrohodnostní funkce.]
    Neurocomputing. Roč. 132, 20 May (2014), s. 14-29. ISSN 0925-2312. E-ISSN 1872-8286
    Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073
    Program: ED
    Institutional support: RVO:67985807
    Keywords : recurrent neural network * associative memory * Hebbian learning rule * neural network application * data mining * statistics * Boolean factor analysis * information gain * dimension reduction * likelihood-maximization * bars problem
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 2.083, year: 2014
    Permanent Link: http://hdl.handle.net/11104/0225993
     
     
  3. 3.
    0369641 - ÚI 2015 RIV NL eng J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Polyakov, P.Y.
    Two Expectation-Maximization Algorithms for Boolean Factor Analysis.
    [Dva EM algoritmy pro Booleovskou faktorovou analýzu.]
    Neurocomputing. Roč. 130, 23 April (2014), s. 83-97. ISSN 0925-2312. E-ISSN 1872-8286
    R&D Projects: GA ČR GAP202/10/0262
    Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073
    Program: ED
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : Boolean Factor analysis * Binary Matrix factorization * Neural networks * Binary data model * Dimension reduction * Bars problem
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 2.083, year: 2014
    Permanent Link: http://hdl.handle.net/11104/0203657
     
     
  4. 4.
    0360031 - ÚI 2012 RIV RU rus J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Polyakov, P.Y.
    Bulevskij faktornyj analiz na osnove attraktornoj nejronnoj seti i nekotoryje ego priloženija.
    [Bulev factorial analysis by means of attractor neural network and its some appendices.]
    Nejrokomp'jutery: razrabotka, primenenie. -, č. 1 (2011), s. 25-46. ISSN 1999-8554
    R&D Projects: GA ČR GAP202/10/0262; GA ČR GA205/09/1079
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : Boolean factor analysis * recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning
    Subject RIV: IN - Informatics, Computer Science
    http://www.radiotec.ru/catalog.php?cat=jr7&art=8576
    Permanent Link: http://hdl.handle.net/11104/0197681
     
     
  5. 5.
    0334976 - ÚI 2010 RIV NL eng J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Muraviev, I. P. - Polyakov, P.Y.
    Origin and Elimination of Two Global Spurious Attractors in Hopfield-Like Neural Network Performing Boolean Factor Analysis.
    [Původ a odstranění dvou globálních lživých atraktorů v booleovském faktorovém analyzátoru založeném na Hopfieldově neuronové síti.]
    Neurocomputing. Roč. 73, č. 7-9 (2010), s. 1394-1404. ISSN 0925-2312. E-ISSN 1872-8286
    R&D Projects: GA ČR GA205/09/1079; GA MŠMT(CZ) 1M0567
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : Boolean factor analysis * Hopfield neural Network * unsupervised learning * dimension reduction * data mining
    Subject RIV: IN - Informatics, Computer Science
    Impact factor: 1.429, year: 2010
    Permanent Link: http://hdl.handle.net/11104/0179576
     
     
  6. 6.
    0321649 - ÚI 2010 RIV US eng J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Polyakov, P.Y.
    Recurrent Neural Network Based Boolean Factor Analysis and its Application to Word Clustering.
    [Booleovská faktorová analýza založená na rekurentní neuronové síti a její aplikace na shlukování slov.]
    IEEE Transactions on Neural Networks. Roč. 20, č. 7 (2009), s. 1073-1086. ISSN 1045-9227
    R&D Projects: GA MŠMT(CZ) 1M0567
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * concepts search * information retrieval
    Subject RIV: BB - Applied Statistics, Operational Research
    Impact factor: 2.889, year: 2009
    Permanent Link: http://hdl.handle.net/11104/0170122
     
     
  7. 7.
    0083501 - ÚI 2008 RIV US eng J - Journal Article
    Frolov, A. A. - Húsek, Dušan - Muraviev, I. P. - Polyakov, P.Y.
    Boolean Factor Analysis by Attractor Neural Network.
    [Boolevská faktorová analýza pomocí atraktorové neuronové sítě.]
    IEEE Transactions on Neural Networks. Roč. 18, č. 3 (2007), s. 698-707. ISSN 1045-9227
    R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval
    Subject RIV: BB - Applied Statistics, Operational Research
    Impact factor: 2.769, year: 2007
    Permanent Link: http://hdl.handle.net/11104/0146721
     
     


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