An Efficient Java Implementation of the Immediate Successors Calculation

The authors present in this paper an eective Java imple- mentation of the concept immediate successors calculation. It is based on the lattice Java library, developed by K. Bertet and the Limited Ob- jects Access algorithm, proposed by C. Demko and K. Bertet (6) with Java-specific enhancements. This work was motivated by the need of an ecient tool delivering this service in an accessible and popular program- ming language for a wider research project: eBDtheque. Performances are compared and analyzed.

[1]  Burr Settles,et al.  Active Learning Literature Survey , 2009 .

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

[3]  Clément Guérin,et al.  Ontologies and spatial relations applied to comic books reading. , 2012 .

[4]  Thomas S. Huang,et al.  Relevance feedback: a power tool for interactive content-based image retrieval , 1998, IEEE Trans. Circuits Syst. Video Technol..

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

[6]  Karell Bertet,et al.  An Approach to Semantic Content Based Image Retrieval Using Logical Concept Analysis , 2012, FCA4AI@ECAI.

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

[8]  Michael J. Fischer,et al.  Boolean Matrix Multiplication and Transitive Closure , 1971, SWAT.

[9]  Claudio Carpineto,et al.  ULYSSES: A Lattice-Based Multiple Interaction Strategy Retrieval Interface , 1995, EWHCI.

[10]  J. Bordat.  Calcul pratique du treillis de Galois d'une correspondance , 1986 .

[11]  J. Ian Munro,et al.  Efficient Determination of the Transitive Closure of a Directed Graph , 1971, Inf. Process. Lett..

[12]  Jean-Christophe Burie,et al.  Robust Frame and Text Extraction from Comic Books , 2011, GREC.

[13]  Uta Priss,et al.  Lattice-based information retrieval , 2000 .

[14]  Karell Bertet,et al.  Generation Algorithm of a Concept Lattice with Limited Object Access , 2011, CLA.

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

[16]  Bernard Monjardet,et al.  Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey[Discrete Applied Mathematics 127(2) (2003) 241–269] , 2005 .

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

[18]  Robert Godin,et al.  Design of a browsing interface for information retrieval , 1989, SIGIR '89.

[19]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..