Invited talk
|
|
|
Pr. Bernard Monjardet
, CES, Paris 1 University, France.
|
|
- Closure operators and choice operators: a survey.
(abstract).
|
Algorithms
|
|
|
- Some variations on Alan Day's algorithm for calculating canonical basis of implications,
Vincent Duquenne
|
|
- ZART: A Multifunctional Itemset Mining Algorithm,
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznetsov
|
|
- Extensions of Bordat's algorithm for attributes,
Karell Bertet, Stéphanie Guillas, Jean-Marc Ogier
|
|
- A new concise representation of frequent patterns through disjunctive search space,
Tarek Hamrouni, Islem Denden, Sadok Ben Yahia, Engelbert Mephu Nguifo
|
Visualization
|
|
|
- An FDP-Algorithm for Drawing Lattices,
Christian Zschalig
|
|
- What can lattices do for math. teaching & education,
Vincent Duquenne
|
|
- Using Concept Lattices for Visual Navigation Assistance in Large Databases: Application to a Pantent Database,
Jean Villerd, Sylvie Ranwez, Michel CrampesDavid Carteret, Jean-Michel Penalva
|
|
- Evaluation of questionnaires supported by formal concept analysis,
Radim Belohlavek, Vladimir Sklenar, Jiri Zacpal, Erik Sigmund
|
Data and Applications
|
|
|
- Camelis: Organizing and Browsing a Personal Photo Collection with a Logical Information System,
Sébastien Ferré
|
|
- SearchSleuth : The Conceptual Neighbourhood of an Web Query,
Jon Ducrou, Peter Eklund
|
|
- Using Lattices for reconstructing stemma,
Marc Le Pouliquen
|
|
- Consecutive-ones: handling lattice planarity efficiently,
Elaine M. Eschen, Nicolas Pinet, Alain Sigayret
|
|
- CLANN: Concept Lattice-based Artificial
Neural Network for supervised classification ,
Norbert Tsopzé, Engelbert Mephu Nguifo, Gilbert Tindo
|
Invited talk
|
|
|
Pr. Boris Mirkin
, Birkbeck College, University of London, UK.
|
|
- Approximate clusters and biclusters.
(abstract).
|
Mathematical structures
|
|
|
- A proposal of Description Logic on Concept Lattices,
Nikolay Shilov, Sang Yong Han
|
|
- Horn-Representation of a Concept Lattice,
Kamel Ben-Khalifa, Susanne Motameny
|
|
- Formal concepts as optimal factors in Boolean factor analysis: implications and experiments,
Radim Belohlavek, Vilem Vychodil
|
|
- Further Galois Connections between Semimodules over Idempotent Semirings,
Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
|
Invited talk
|
|
|
Pr. Rudolf Wille
, Darmstadt University of Technology, Germany.
|
|
- Concept Graphs as Semantic Structures for Contextual Judgment Logic.
|
Applications
|
|
|
- Dynamical modification of context for an iterative and interactive information retrieval process on the web
,
Emmanuel Nauer, Yannick Toussaint
|
|
- Use of Model Driven Engineering in Building Generic FCA/RCA Tools,
Jean-Rémy Falleri, Gabriela Arévalo, Marianne Huchard, Clémentine Nebut,
|
|
- Precalculating component interface compatibility using FCA
,
Gabriela Arévalo, Nicolas Desnos, Marianne Huchard, Christelle Urtado, Sylvain Vauttier
|
|
- Concept Analysis on structured, multi-valued
and incomplete data,
David Grosser, Henri Ralambondrainy
|
Links to other domains
|
|
|
- Representing Numeric Values in Concept Lattices
,
John Pfaltz
|
|
- Inducing decision trees via concept lattices
,
Radim Belohlavek, Bernard De Baets, Jan Outrata, Vilem Vychodil
|
|
- Policies Generalization in Reinforcement Learning using Galois Partitions Lattices
,
Marc Ricordeau, Michel Liquière
|