论文信息 - Using Blind Search and Formal Concepts for Binary Factor Analysis

Using Blind Search and Formal Concepts for Binary Factor Analysis

Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binary data too, the BFA can be used to analyse such collections. Unfortunately, exact solving of BFA is not easy. This article shows two BFA methods based on exact computing, boolean algebra and the theory of formal concepts.

Ales Keprt

[1] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .

[2] Andreas Hotho,et al. Conceptual Clustering of Text Clusters , 2003 .

[3] Christoph Schwarzweller,et al. Introduction to Concept Lattices , 2004 .

[4] Jack Dongarra,et al. PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[5] Dušan Húsek,et al. Application of Hopfield-like Neural Networks to Nonlinear Factorization , 2002, COMPSTAT.

[6] Alexander A. Frolov,et al. BINARY FACTORIZATION IN HOPFIELD-LIKE NEURAL NETWORKS: SINGLE-STEP APPROXIMATION AND COMPUTER SIMULATIONS , 2004 .

[7] Alexander A. Frolov,et al. Nonlinear factorization in sparsely encoded Hopfield-like neural networks , 1999, ESANN.