ImplicPBDD: A New Approach to Extract Proper Implications Set from High-Dimension Formal Contexts Using a Binary Decision Diagram ^†

• Main Authors: Phillip G. Santos, Pedro Henrique B. Ruas, Julio C. V. Neves, Paula R. Silva, Sérgio M. Dias, Luis E. Zárate, Mark A. J. Song
• Format: Article
• Language: English
• Published: MDPI AG 2018-10-01
• Series: Information
• Subjects: formal concept analysis; proper implication; binary decision diagram
• Online Access: https://www.mdpi.com/2078-2489/9/11/266

Formal concept analysis (FCA) is largely applied in different areas. However, in some FCA applications the volume of information that needs to be processed can become unfeasible. Thus, the demand for new approaches and algorithms that enable processing large amounts of information is increasing substantially. This article presents a new algorithm for extracting proper implications from high-dimensional contexts. The proposed algorithm, called ImplicPBDD, was based on the PropIm algorithm, and uses a data structure called binary decision diagram (BDD) to simplify the representation of the formal context and enhance the extraction of proper implications. In order to analyze the performance of the ImplicPBDD algorithm, we performed tests using synthetic contexts varying the number of objects, attributes and context density. The experiments show that ImplicPBDD has a better performance—up to 80% faster—than its original algorithm, regardless of the number of attributes, objects and densities.