default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCLA 2006: Tunis, Tunisia
- Sadok Ben Yahia, Engelbert Mephu Nguifo
, Radim Belohlávek:
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
Foundations
- 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
Methods
- 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 Rajaonasy 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 A. 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
Applications
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
