Concept Lattices and Their Applications

The Eighth International Conference
October 17-20, 2011, Nancy, France

CLA 2011 Accepted Papers

Long papers (randomly ordered)

Anne Berry, Romain Pogorelcnik and Alain Sigayret.

Vertical decomposition of a lattice using clique separators

Mireille Ducasse, Sebastien Ferre and Peggy Cellier.

Building up Shared Knowledge with Logical Information Systems

Konstantin Bazhanov and Sergei Obiedkov.

Comparing performance of algorithms for generating the Duquenne-Guigues basis

Yılmaz Kılıçaslan and Edip Serdar Güner.

Filtering Machine Translation Results with Automatically Constructed Concept Lattices

Juan Carlos Díaz and Jesús Medina-Moreno.

Concept lattices in fuzzy relation equations

Emmanuelle Gaillard, Jean Lieber and Emmanuel Nauer.

Adaptation knowledge discovery for cooking using closed itemset extraction

Uwe Ryssel, Felix Distel and Daniel Borchmann.

Fast Computation of Proper Premises

Jan Konecny and Michal Krupka.

Block relations in fuzzy setting

Pierre Colomb, Alexis Irlande, Olivier Raynaud and Yoan Renaud.

A closure algorithm using a recursive decomposition of the set of Moore co-families

David Llansó, Marco Antonio Gómez-Martín, Pedro Pablo Gomez-Martin and Pedro Antonio González-Calero.

Iterative Software Design of Computer Games through FCA

Alain Gély.

Links between modular decomposition of concept lattice and bimodular decomposition of a context

Cynthia Vera Glodeanu.

Fuzzy-valued Triadic Implications

Mehdi Kaytoue, Sergei Kuznetsov, Juraj Macko, Wagner Meira and Amedeo Napoli.

Mining bicluster of similar values with triadic concept analysis

Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc and Vladimir Makarenkov.

Fast Mining of Iceberg Lattices: A Modular Approach Using Generators

Radim Belohlavek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo and Jan Outrata.

Boolean factors as a means of clustering of interestingness measures of association rules

Ingrid Falk and Claire Gardent.

Combining Formal Concept Analysis and Translation to Assign Frames and Thematic Grids to French Verbs.

Christophe Demko and Karell Bertet.

Generation algorithm of a concept lattice with limited access to objects

Paula Brito and Géraldine Polaillon.

Homogeneity and Stability in Conceptual Analysis

Agnès Braud, Cristina Nica, Corinne Grac and Florence Le Ber.

A lattice-based query system for assessing the quality of hydro-ecosystems

Philippe Balbiani.

The word problem in semiconcept algebras

Laurent Miclet, Henri Prade and David Guennec.

Looking for analogical proportions in a formal concept analysis setting

Bernhard Ganter.

Random extents and random closure systems

Zainab Assaghir, Mehdi Kaytoue, Wagner Meira and Jean Villerd.

Extracting Decision Trees From Interval Pattern Concept Lattices

Jaume Baixeries.

A New Formal Context for Symmetric Dependencies

Víctor Codocedo, Carla Taramasco and Hernán Astudillo.

Cheating to achieve Formal Concept Analysis over a large formal context

Elias Egho, Nicolas Jay, Chedy Raissi and Amedeo Napoli.

A FCA-based analysis of sequential care trajectories

Zeina Azmeh, Marianne Huchard, Amedeo Napoli, Mohamed Rouane-Hacene and Petko Valtchev.

Lessons learned in querying Relational Concept Lattices


Poster papers

Jamal Atif, Hudelot Céline and Isabelle Bloch.

Abduction in Description Logics using Formal Concept Analysis and Mathematical Morphology: application to image interpretation

Douar Brahim and Liquiere Michel.

Graph mining with a polynomial time projection algorithm between graphs.

Nathalie Girard, Karell Bertet and Muriel Visani.

A local discretization of continuous data for lattices: Technical aspects

W B Langdon.

Formal Concept Analysis on Graphics Hardware