title: Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain.
abstract: An usual task in large data set analysis is searching for an appropriate data representation in a space of fewer dimensions. One of the most efficient methods to solve this task is factor analysis. In this paper, we compare seven methods for Boolean factor analysis (BFA) in solving the so-called bars problem (BP), which is a BFA benchmark. The performance of the methods is evaluated by means of information gain. Study of the results obtained in solving BP of different levels of complexity has allowed us to reveal strengths and weaknesses of these methods. It is shown that the Likelihood maximization Attractor Neural Network with Increasing Activity (LANNIA) is the most efficient BFA method in solving BP in many cases. Efficacy of the LANNIA method is also shown, when applied to the real data from the Kyoto Encyclopedia of Genes and Genomes database, which contains full genome sequencing for 1368 organisms, and to text data set R52 (from Reuters 21578) typically used for label categorization.
authors: Alexander A
authors: AA
authors: Frolov
authors: Dušan
authors: D
authors: Húsek
authors: Pavel Yu
authors: PY
authors: Polyakov
mesh_terms: D000465:Algorithms; D000818:Animals; D001499:Bayes Theorem; D001330:Electronic Data Processing; D005163:Factor Analysis, Statistical; D006801:Humans; D008959:Models, Neurological; D016571:Neural Networks, Computer; D009622:Noise; D012680:Sensitivity and Specificity