Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Polyakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j7]Alexander A. Frolov, Dusan Húsek
, Pavel Yu. Polyakov:
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain. IEEE Trans. Neural Networks Learn. Syst. 27(3): 538-550 (2016)- 2015
- [j6]Pavel Polyakov, Mariya Kalinina, Vladimir Pleshko:
Experiment in building an automatic object-oriented sentiment detection system based on the syntactic and semantic analyzer. Russ. Digit. Libr. J. 18(3-4): 185-202 (2015) - 2014
- [j5]Alexander A. Frolov, Dusan Húsek, Pavel Polyakov:
Two Expectation-Maximization algorithms for Boolean Factor Analysis. Neurocomputing 130: 83-97 (2014) - [j4]Alexander A. Frolov, Dusan Húsek, Pavel Yu. Polyakov, Václav Snásel:
New BFA method based on attractor neural network and likelihood maximization. Neurocomputing 132: 14-29 (2014) - 2010
- [j3]Alexander A. Frolov, Dusan Húsek, Igor P. Muraviev, Pavel Polyakov:
Origin and elimination of two global spurious attractors in Hopfield-like neural network performing Boolean factor analysis. Neurocomputing 73(7-9): 1394-1404 (2010) - 2009
- [j2]Alexander A. Frolov, Dusan Húsek, Pavel Yu. Polyakov:
Recurrent-Neural-Network-Based Boolean Factor Analysis and Its Application to Word Clustering. IEEE Trans. Neural Networks 20(7): 1073-1086 (2009) - 2007
- [j1]Alexander A. Frolov, Dusan Húsek, Igor P. Muraviev, Pavel Yu. Polyakov:
Boolean Factor Analysis by Attractor Neural Network. IEEE Trans. Neural Networks 18(3): 698-707 (2007)
Conference and Workshop Papers
- 2018
- [c20]Ilya Makarov, Pavel Polyakov, Roman Karpichev:
Voronoi-based Path Planning based on Visibility and Kill/Death RatioTactical Component. AIST (Supplement) 2018: 129-140 - 2017
- [c19]Ilya Makarov, Oleg Konoplia, Pavel Polyakov, Maxim Martynov, Peter Zyuzin, Olga Gerasimova, Valeria Bodishtianu:
Adapting First-Person Shooter Video Game for Playing with Virtual Reality Headsets. FLAIRS 2017: 412-416 - [c18]Ilya Makarov, Vladimir Aliev, Olga Gerasimova, Pavel Polyakov:
Depth Map Interpolation Using Perceptual Loss. ISMAR Adjunct 2017: 93-94 - [c17]Alexander Ermakov, Pavel Polyakov:
Статистическая модель для распознавания смыслов в текстах иностранного языка с обучением на примерах из параллельных текстов (Statistical Model for Recognition of Senses in Foreign Language Texts Trained by Examples from Parallel Texts). DAMDID/RCDL 2017: 397-404 - 2016
- [c16]Ilya Makarov, Pavel Polyakov:
Smoothing Voronoi-Based Path with Minimized Length and Visibility Using Composite Bezier Curves. AIST (Supplement) 2016: 191-202 - [c15]Ilya Makarov, Peter Zyuzin, Pavel Polyakov, Mikhail Tokmakov, Olga Gerasimova, Ivan Guschenko-Cheverda, Maxim Uriev:
Modelling Human-like Behavior through Reward-based Approach in a First-Person Shooter Game. EEML@CLA 2016: 24-33 - [c14]Ilya Makarov, Mikhail Tokmakov, Pavel Polyakov, Peter Zyuzin, Maxim Martynov, Oleg Konoplya, George Kuznetsov, Ivan Guschenko-Cheverda, Maxim Uriev, Ivan Mokeev, Olga Gerasimova, Lada Tokmakova, Alexey Kosmachev:
First-Person Shooter Game for Virtual Reality Headset with Advanced Multi-Agent Intelligent System. ACM Multimedia 2016: 735-736 - 2012
- [c13]Alexander A. Frolov, Ajith Abraham, Pavel Yu. Polyakov, Dusan Húsek, Hana Rezanková:
BFA and BMF: What is the difference. ISDA 2012: 890-896 - [c12]Alexander A. Frolov, Dusan Húsek, Pavel Yu. Polyakov:
Attractor Neural Network Combined with Likelihood Maximization Algorithm for Boolean Factor Analysis. ISNN (1) 2012: 1-10 - 2011
- [c11]Alexander A. Frolov, Dusan Húsek, Pavel Yu. Polyakov:
New Measure of Boolean Factor Analysis Quality. ICANNGA (1) 2011: 100-109 - [c10]Alexander A. Frolov, Dusan Húsek, Pavel Yu. Polyakov:
Boolean Factor Analysis by Expectation-Maximization Method. IHCI 2011: 243-254 - [c9]Alexander A. Frolov, Dusan Húsek, Pavel Yu. Polyakov:
Expectation-maximization approach to Boolean factor analysis. IJCNN 2011: 559-566 - 2008
- [c8]Dusan Húsek, Alexander A. Frolov, Hana Rezanková, Václav Snásel, Pavel Yu. Polyakov:
Some Remarks on Binary Data Grouping. DEXA Workshops 2008: 559-565 - [c7]Alexander A. Frolov, Dusan Húsek, Hana Rezanková, Václav Snásel, Pavel Polyakov:
Clustering variables by classical approaches and neural network Boolean factor analysis. IJCNN 2008: 3742-3746 - 2007
- [c6]Pavel Moravec, Václav Snásel, Alexander A. Frolov, Dusan Húsek, Hana Rezanková, Pavel Polyakov:
Image Analysis by Methods of Dimension Reduction. CISIM 2007: 272-277 - [c5]Václav Snásel, Pavel Moravec, Dusan Húsek, Alexander A. Frolov, Hana Rezanková, Pavel Polyakov:
Pattern Discovery for High-Dimensional Binary Datasets. ICONIP (1) 2007: 861-872 - [c4]Václav Snásel, Dusan Húsek, Alexander A. Frolov, Hana Rezanková, Pavel Moravec, Pavel Polyakov:
Bars Problem Solving - New Neural Network Method and Comparison. MICAI 2007: 671-682 - [c3]Dusan Húsek, Pavel Moravec, Václav Snásel, Alexander A. Frolov, Hana Rezanková, Pavel Polyakov:
Comparison of Neural Network Boolean Factor Analysis Method with Some Other Dimension Reduction Methods on Bars Problem. PReMI 2007: 235-243 - 2006
- [c2]Alexander A. Frolov, Dusan Húsek, Pavel Polyakov, Hana Rezanková:
New Neural Network Based Approach Helps to Discover Hidden Russian Parliament Voting Patterns. IJCNN 2006: 3486-3491 - 2005
- [c1]Dusan Húsek, Hana Rezanková, Václav Snásel, Alexander A. Frolov, Pavel Polyakov:
Neural network nonlinear factor analysis of high dimensional binary signals. SITIS 2005: 86-89
Parts in Books or Collections
- 2010
- [p1]Alexander A. Frolov, Dusan Húsek, Igor P. Muraviev, Pavel Yu. Polyakov:
Learning and Unlearning in Hopfield-Like Neural Network Performing Boolean Factor Analysis. Advances in Machine Learning I 2010: 501-518
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 05:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
