Next Article in Journal
Motivation Perspectives on Opening up Municipality Data: Does Municipality Size Matter?
Next Article in Special Issue
Conceptualising and Modelling E-Recruitment Process for Enterprises through a Problem Oriented Approach
Previous Article in Journal
On the Single-Parity Locally Repairable Codes with Multiple Repairable Groups
Article Menu

Export Article

Open AccessFeature PaperArticle
Information 2018, 9(11), 266; https://doi.org/10.3390/info9110266

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

1
Department of Computer Science, Pontifical Catholic University of Minas Gerais (PUC Minas), Belo Horizonte 31980-110, Brazil
2
Laboratory of Artificial Intelligence and Decision Support (LIAAD), INESC TEC, Porto 4200-465, Portugal
3
Federal Service of Data Processing (SERPRO), Belo Horizonte 31035-536, Brazil
This paper is an extended version of our paper published in Santos, P., Neves, J., Silva, P., Dias, S. M., Zárate, L., and Song, M. (2018). An Approach to Extract Proper Implications Set from High-dimension Formal Contexts using Binary Decision Diagram. In Proceedings of the 20th International Conference on Enterprise Information Systems (Vol. 1, pp. 50–57). Science and Technology Publications.
These authors contributed equally to this work.
*
Author to whom correspondence should be addressed.
Received: 20 September 2018 / Revised: 12 October 2018 / Accepted: 22 October 2018 / Published: 25 October 2018
Full-Text   |   PDF [1026 KB, uploaded 25 October 2018]   |  

Abstract

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. View Full-Text
Keywords: formal concept analysis; proper implication; binary decision diagram formal concept analysis; proper implication; binary decision diagram
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Santos, P.G.; Ruas, P.H.B.; Neves, J.C.V.; Silva, P.R.; Dias, S.M.; Zárate, L.E.; Song, M.A.J. ImplicPBDD: A New Approach to Extract Proper Implications Set from High-Dimension Formal Contexts Using a Binary Decision Diagram . Information 2018, 9, 266.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top