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.

• Type: Conference
• Year: 2004
• Where: DATESO
• Authors: Ales Keprt
• Keywords: Binary Data, Binary Factor Analysis, DATESO 2004, DATESO 2007, Factor Analysis