September 7–9, 2005, Olomouc, CZ

Conference proceedings in PDF

Program

Each accepted paper will be orally presented. The presentation will be 30 min. long (25 min. talk + 5 min. discussion). Overhead projector for transparencies (slides), data projector and PC (with Adobe Acrobat Reader, PostScript viewer, Microsoft Office PowerPoint, and OpenOffice.org Impress), and blackboard (with color markers and a rubber) will be available.

Wednesday, September 7, 2005

12:00 – 13:45 Registration (in front of the Conference room, registration desk open through the conference)
13:45 – 14:00 Opening
14:00 – 15:30 Session 1 (chair Stanislav Krajci)
14:00 – 14:30 Chiraz Latiri, Wissem Bellegha, Ghada Guesmi, Sadok Ben Yahia: VIE_MGB: A Visual Interactive Exploration of a New Minimal Generic Base of Association Rules
14:30 – 15:00 Mondher Maddouri: A Formal Concept Analysis Approach to Discover Association Rules from Data
15:00 – 15:30 Baklouti Fatma, Gerard Levy: Distributed and General Galois Lattices for Large Data Bases
15:30 – 16:00 Coffee break
16:00 – 17:30 Session 2 (chair Sadok Ben Yahia)
16:00 – 16:30 Radim Belohlavek, Vilem Vychodil: What Is a Fuzzy Concept Lattice
16:30 – 17:00 Stanislav Krajci: Every Concept Lattice with Hedges Is Isomorphic to Some Generalized Concept Lattice
17:00 – 17:30 Rainer Osswald: Translations between Concept Hierarchies over Different Attribute Sets
18:00 – 20:00 Welcome party (Attic of the Art Centre)

Thursday, September 8, 2005

8:00 – 9:45 Tutorial Sadok Ben Yahia: Association rule extraction : A decade after (part 1)
9:45 – 10:15 Coffee break
10:15 – 12:00 Tutorial Sadok Ben Yahia: Association rule extraction : A decade after (part 2)
12:00 – 14:00 Lunch break (lunch on your own)
14:00 – 15:30 Session 3 (chair Vilem Vychodil)
14:00 – 14:30 Richard Cole, Thomas Tilley, Jon Ducrou: Conceptual Exploration of Software Structure: A Collection of Examples
14:30 – 15:00 Alexandr Savinov: Hierarchical Multidimensional Modelling in the Concept-Oriented Data Model
15:00 – 15:30 Ibtissem Nafkha, Ali Jaoua: Using Formal Concept Analysis for Heterogeneous Information Retrieval
15:30 – 16:00 Coffee break
16:00 – 17:30 Session 4 (chair Richard Cole)
16:00 – 16:30 Tarek Hamrouni, Sadok Ben Yahia, Yahya Slimani: Avoiding the Itemset Closure Computation "Pitfall"
16:30 – 17:00 Gerard Levy, Fatma Baklouti: A Distributed Version of the Ganter Algorithm for General Galois Lattices
17:00 – 17:30 S. Ben Tekaya, S. Ben Yahia, Y. Slimani: GenAll Algorithm: Decorating Galois Lattice with Minimal Generators

Friday, September 9, 2005

8:00 – 9:30 Session 5 (chair Alexandr Savinov)
8:00 – 8:30 Jaume Baixeries, Jose Luis Balcazar: New Closure Operators and Lattice Representations for New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions
8:30 – 9:00 R. Medina, C. Noyer, O. Raynaud: Efficient Algorithm for Clone Items Detection
9:00 – 9:30 Xueyou Chen, Qingguo Li: Formal Topology, Chu Space and Approximable Concept
9:30 – 10:00 Coffee break
10:00 – 11:30 Session 6 (chair Samir Elloumi)
10:00 – 10:30 Vladimir Havel, Jan Martinovic, Vaclav Snasel, Karel Vlcek: Creating of Conceptual Lattices Using Multilayer Perceptron
10:30 – 11:00 Vladimir Sklenar, Jiri Zacpal, Erik Sigmund: Evaluation of IPAQ Questionnaire by FCA
11:00 – 11:30 Suhail Owais, Petr Gajdos, Vaclav Snasel: Usage of Genetic Algorithm for Lattice Drawing

CLA 2005 ends September 9, 2005, at 11:30.

List of accepted papers