Improving the Performance of Lindig-Style Algorithms with Empty Intersections

[1]  Simon Andrews,et al.  A 'Best-of-Breed' approach for designing a fast algorithm for computing fixpoints of Galois Connections , 2015, Inf. Sci..

[2]  Petr Krajca,et al.  Pruning in Map-Reduce Style CbO Algorithms , 2020, ICCS.

[3]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[4]  Martin Trnecka,et al.  Basic level of concepts in formal concept analysis 1: formalization and utilization , 2020, Int. J. Gen. Syst..

[5]  Lhouari Nourine,et al.  A Fast Algorithm for Building Lattices , 1999, Inf. Process. Lett..

[6]  Simon Andrews.  In-Close2, a High Performance Formal Concept Miner , 2011, ICCS.

[7]  Vilém Vychodil,et al.  Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data , 2012, Inf. Sci..

[8]  Bernard De Baets,et al.  Lindig's Algorithm for Concept Lattices over Graded Attributes , 2007, MDAI.

[9]  Claudio Carpineto,et al.  Concept data analysis - theory and applications , 2004 .

[10]  Bernhard Ganter,et al.  Formal Concept Analysis , 1999, Springer Berlin Heidelberg.

[11]  Simon Andrews,et al.  Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms , 2017, ICFCA.

[12]  Derrick G. Kourie,et al.  AddIntent: A New Incremental Algorithm for Constructing Concept Lattices , 2004, ICFCA.

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