Parallelization of the next Closure algorithm for generating the minimum set of implication rules

This paper addresses the problem of handling dense contexts of high dimensionality in the number of objects, which is still an open problem in formal concept analysis. The generation of minimal implication basis in contexts with such characteristics is investigated, where the \textit{NextClosure} algorithm is employed in obtaining the rules. Therefore, this work makes use of parallel computing as a means to reduce the prohibitive times observed in scenarios where the input context has high density and high dimensionality. The sequential and parallel versions of the \textit{NextClosure} algorithm applied to generating implications are employed. The experiments show a reduction of approximately 75\% in execution time in the contexts of greater size and density, which attests to the viability of the strategy presented in this work.

[1]  Dayou Liu,et al.  A parallel algorithm based on search space partition for generating concepts , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[2]  Yves Bastide,et al.  Computing Proper Implications , 2001 .

[3]  Amedeo Napoli,et al.  Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices , 2008, ICFCA.

[4]  Luis E. Zárate,et al.  Handling Large Formal Context Using BDD - Perspectives and Limitations , 2009, ICFCA.

[5]  Petko Valtchev,et al.  A Parallel Algorithm for Lattice Construction , 2005, ICFCA.

[6]  Camille Roth,et al.  Reducing the Representation Complexity of Lattice-Based Taxonomies , 2007, ICCS.

[7]  Sérgio M. Dias,et al.  Concept lattices reduction: Definition, analysis and classification , 2015, Expert Syst. Appl..

[8]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[9]  Petko Valtchev,et al.  Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice , 2009, ICFCA.

[10]  Sérgio M. Dias,et al.  Reducing the Size of Concept Lattices: The JBOS Approach , 2010, CLA.

[11]  Luis E. Zárate,et al.  Canonical Computational Models Based on Formal Concept Analysis for Social Network Analysis and Representation , 2015, 2015 IEEE International Conference on Web Services.

[12]  Vilém Vychodil,et al.  Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework , 2009, IDA.

[13]  Engelbert Mephu Nguifo,et al.  Partitioning large data to scale up lattice-based algorithm , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[14]  Engelbert Mephu Nguifo,et al.  A Parallel Algorithm to Generate Formal Concepts for Large Data , 2004, ICFCA.

[15]  Xiang Wei,et al.  A Parallel Algorithm to Construct Concept Lattice , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

[16]  Lhouari Nourine,et al.  Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases , 2005, ICFCA.

[17]  Qiang Wu,et al.  Theoretical research on the distributed construction of concept lattices , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[18]  Jonas Poelmans,et al.  Formal Concept Analysis in knowledge processing: A survey on models and techniques , 2013, Expert Syst. Appl..

[19]  Christian Lindig.  Fast Concept Analysis , 2000 .

[20]  Jan Outrata,et al.  Parallel Recursive Algorithm for FCA , 2008 .

[21]  Bernhard Ganter,et al.  Two Basic Algorithms in Concept Analysis , 2010, ICFCA.

[22]  Jonas Poelmans,et al.  Knowledge representation and processing with formal concept analysis , 2013, WIREs Data Mining Knowl. Discov..

[23]  Henrique C. Freitas,et al.  A Distributed Algorithm for Formal Concepts Processing based on Search Subspaces , 2010, ICEIS.

[24]  Bernhard Ganter ganter.  SOME OPEN PROBLEMS IN FORMAL CONCEPT ANALYSIS , 2006 .

[25]  Vilem Vychodil.  A New Algorithm for Computing Formal Concepts , 2007 .

[26]  Anne Berry,et al.  A local approach to concept generation , 2007, Annals of Mathematics and Artificial Intelligence.

[27]  Vilém Vychodil,et al.  Parallel algorithm for computing fixpoints of Galois connections , 2010, Annals of Mathematics and Artificial Intelligence.

[28]  Jonas Poelmans,et al.  Formal Concept Analysis in Knowledge Discovery: A Survey , 2010, ICCS.

[29]  Claudio Carpineto,et al.  Inferring dependencies from relations: a conceptual clustering approach , 1999 .

[30]  Edith Cohen,et al.  Finding interesting associations without support pruning , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[31]  Lhouari Nourine,et al.  About the Enumeration Algorithms of Closed Sets , 2010, ICFCA.

[32]  Luis E. Zárate,et al.  SCGaz - A Synthetic Formal Context Generator with Density Control for Test and Evaluation of FCA Algorithms , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[33]  Sergei O. Kuznetsov,et al.  Learning of Simple Conceptual Graphs from Positive and Negative Examples , 1999, PKDD.

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

[35]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[36]  Petko Valtchev,et al.  Parallel Computation of Closed Itemsets and Implication Rule Bases , 2007, ISPA.