default search action
CLA 2011: Nancy, France
- Amedeo Napoli, Vilém Vychodil:
Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, Nancy, France, October 17-20, 2011. CEUR Workshop Proceedings 959, CEUR-WS.org 2013
Regular Papers
- Anne Berry, Romain Pogorelcnik, Alain Sigayret:
Vertical Decomposition of a Lattice Using Clique Separators. 15-29 - Mireille Ducassé, Sébastien Ferré, Peggy Cellier:
Building up Shared Knowledge with Logical Information Systems. 31-42 - Konstantin Bazhanov, Sergei A. Obiedkov:
Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis. 43-57 - Yilmaz Kiliçaslan, Edip Serdar Güner:
Filtering Machine Translation Results with Automatically Constructed Concept Lattices. 59-73 - Juan Carlos Díaz, Jesús Medina:
Concept Lattices in Fuzzy Relation Equations. 75-86 - Emmanuelle Gaillard, Jean Lieber, Emmanuel Nauer:
Adaptation Knowledge Discovery for Cooking Using Closed Itemset Extraction. 87-99 - Uwe Ryssel, Felix Distel, Daniel Borchmann:
Fast Computation of Proper Premises. 100-113 - Jan Konecny, Michal Krupka:
Block Relations in Fuzzy Setting. 115-130 - Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud:
A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-families. 131-141 - David Llansó, Pedro Pablo Gómez-Martín, Marco Antonio Gómez-Martín, Pedro A. González-Calero:
Iterative Software Design of Computer Games through FCA. 143-158 - Cynthia Vera Glodeanu:
Fuzzy-Valued Triadic Implications. 159-173 - Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, Wagner Meira Jr., Amedeo Napoli:
Mining Biclusters of Similar Values with Triadic Concept Analysis. 175-190 - Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov:
Fast Mining of Iceberg Lattices: A Modular Approach Using Generators. 191-206 - Radim Belohlávek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata:
Boolean Factors as a Means of Clustering of Interestingness Measures of Association Rules. 207-222 - Ingrid Falk, Claire Gardent:
Combining Formal Concept Analysis and Translation to Assign Frames and Thematic Role Sets to French Verbs. 223-238 - Christophe Demko, Karell Bertet:
Generation Algorithm of a Concept Lattice with Limited Object Access. 239-250 - Paula Brito, Géraldine Polaillon:
Homogeneity and Stability in Conceptual Analysis. 251-263 - Agnès Braud, Cristina Nica, Corinne Grac, Florence Le Ber:
A Lattice-based Query System for Assessing the Quality of Hydro-ecosystems. 265-277 - Philippe Balbiani:
The Word Problem in Semiconcept Algebras. 279-294 - Laurent Miclet, Henri Prade, David Guennec:
Looking for Analogical Proportions in a Formal Concept Analysis Setting. 295-307 - Bernhard Ganter:
Random Extents and Random Closure Systems. 309-318 - Zainab Assaghir, Mehdi Kaytoue, Wagner Meira Jr., Jean Villerd:
Extracting Decision Trees from Interval Pattern Concept Lattices. 319-332 - Jaume Baixeries:
A New Formal Context for Symmetric Dependencies. 333-348 - Víctor Codocedo, Carla Taramasco, Hernán Astudillo:
Cheating to achieve Formal Concept Analysis over a Large Formal Context. 349-362 - Elias Egho, Nicolas Jay, Chedy Raïssi, Amedeo Napoli:
A FCA-based Analysis of Sequential Care Trajectories. 363-376 - Zeina Azmeh, Marianne Huchard, Amedeo Napoli, Mohamed Rouane Hacene, Petko Valtchev:
Querying Relational Concept Lattices. 377-392 - Alain Gély:
Links between Modular Decomposition of Concept Lattice and Bimodular Decomposition of a Context. 393-403
Short Papers
- Jamal Atif, Céline Hudelot, Isabelle Bloch:
Abduction in Description Logics using Formal Concept Analysis and Mathematical Morphology: Application to Image Interpretation. 405-408 - Nathalie Girard, Karell Bertet, Muriel Visani:
A Local Discretization of Continuous Data for Lattices: Technical Aspects. 409-412 - William B. Langdon, Shin Yoo, Mark Harman:
Formal Concept Analysis on Graphics Hardware. 413-416
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.