title: Boolean factor analysis by attractor neural network.
abstract: A common problem encountered in disciplines such as statistics, data analysis, signal processing, textual data representation, and neural network research, is finding a suitable representation of the data in the lower dimension space. One of the principles used for this reason is a factor analysis. In this paper, we show that Hebbian learning and a Hopfield-like neural network could be used for a natural procedure for Boolean factor analysis. To ensure efficient Boolean factor analysis, we propose our original modification not only of Hopfield network architecture but also its dynamics as well. In this paper, we describe neural network implementation of the Boolean factor analysis method. We show the advantages of our Hopfield-like network modification step by step on artificially generated data. At the end, we show the efficiency of the method on artificial data containing a known list of factors. Our approach has the advantage of being able to analyze very large data sets while preserving the nature of the data.
authors.affiliation: Institute of Higher Nervous Activity and Neurophysiology, Russian Academy of Science, Moscow 119991, Russia.
authors.forename: Alexander A
authors.initials: AA
authors.lastname: Frolov
authors.forename: Dusan
authors.initials: D
authors.lastname: Husek
authors.forename: Igor P
authors.initials: IP
authors.lastname: Muraviev
authors.forename: Pavel Yu
authors.initials: PY
authors.lastname: Polyakov
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003661:Decision Support Techniques; D016247:Information Storage and Retrieval / Q000379:methods*; D016015:Logistic Models; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*