CLA 2006: Tunis, Tunisia

Sadok Ben Yahia, Engelbert Mephu Nguifo, Radim Belohlávek (Eds.): Concept Lattices and Their Applications, Fourth International Conference, CLA 2006, Tunis, Tunisia, October 30 - November 1, 2006, Selected Papers. Lecture Notes in Computer Science 4923 Springer 2008, ISBN 978-3-540-78920-8

Invited Contributions

Jon Ducrou, Peter W. Eklund, Tim Wilson:
An Intelligent User Interface for Browsing and Searching MPEG-7 Images Using Concept Lattices. 1-21
Jean Lieber, Amedeo Napoli, Laszlo Szathmary, Yannick Toussaint:
First Elements on Knowledge Discovery Guided by Domain Knowledge (KDDK). 22-41
Rudolf Wille:
Formal Concept Analysis as Applied Lattice Theory. 42-67

Radim Belohlávek, Jan Outrata, Vilém Vychodil:
Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data. 68-79
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo:
Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions. 80-95
Tim B. Kaiser:
Closure Systems of Equivalence Relations and Their Labeled Class Geometries. 96-106
Xueyou Chen, Qingguo Li, Fei Long, Zike Deng:
Generalizations of Approximable Concept Lattice. 107-122

Mohamed Aounallah, Guy W. Mineau:
Rule Validation of a Meta-classifier Through a Galois (Concept) Lattice and Complementary Means. 123-138
Radim Belohlávek, Vilém Vychodil:
Graded LinClosure and Its Role in Relational Data Analysis. 139-154
Leila Ben Othman, Sadok Ben Yahia:
Yet Another Approach for Completing Missing Values. 155-169
Ines Bouzouita, Samir Elloumi:
Efficient Generic Association Rules Based Classifier Approach. 170-185
Jean Diatta, Daniel R. Feno, André Totohasina:
Galois Lattices and Bases for MGK-Valid Association Rules. 186-197
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo:
Generic Association Rule Bases: Are They so Succinct?. 198-213
Tim B. Kaiser, Stefan E. Schmidt, Cliff Joslyn:
Concept Lattice Representations of Annotated Taxonomies. 214-225
Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé:
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy. 226-231

Peter Mihók, Gabriel Semanisin:
Unique Factorization Theorem and Formal Concept Analysis. 232-239
Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie:
Towards Concise Representation for Taxonomies of Epistemic Communities. 240-255
Stéphanie Guillas, Karell Bertet, Jean-Marc Ogier:
Towards an Iterative Classification Based on Concept Lattice. 256-262
Nicolas Jay, François Kohler, Amedeo Napoli:
Using Formal Concept Analysis for Mining and Interpreting Patient Flows within a Healthcare Network. 263-268
Naouel Moha, Jihene Rezgui, Yann-Gaël Guéhéneuc, Petko Valtchev, Ghizlane El-Boussaidi:
Using FCA to Suggest Refactorings to Correct Design Defects. 269-275
Wiebke Petersen:
Type Signature Induction with FCAType. 276-281

Last update Thu May 24 04:14:54 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page