CLA: Concept Lattices and Their Applications

CLA 2020 | CLA 2018 CLA 2016 | CLA 2015 | CLA 2014 | CLA 2013 | CLA 2012 | CLA 2011 | CLA 2010 | CLA 2008 | CLA 2007 | CLA 2006 | CLA 2005 | CLA 2004

CLA 2020 Papers

Invited Contributions

• The Lattice Computing (LC) Paradigm
  Vassilis G. Kaburlasos
  
• Formal Concept Analysis Techniques Can Help in Intelligent Control, Deep Learning, etc.
  Vladik Kreinovich
  

Full Papers

• Notes on Integer Partitions
  Bernhard Ganter
  
• Typicality in conceptual structures within the framework of formal concept analysis
  Radim Belohlavek, Tomas Mikula
  
• LCM is well implemented CbO: study of LOM from FCA point of view
  Radek Janostik, Jan Konecny, Petr Krajča
  
• Revisiting the GreCon Algorithm for Boolean Matrix Faetorization
  Martin Trnecka, Roman Vyjidacek
  
• A Hybrid Partitioning Strategy for Distributed FCA
  P Muneeswaran, Jyoti, Sriram Kailasam
  
• Remarks on Prime Ideal and Representation Theorems for Double Boolean Algebras
  Prosenjit Howlader, Mohua Banerjee
  
• Simple Structure in Boolean Matrix Factorization
  Martin Trnecka, Marketa Trneckova
  
• AOC-Poset on discourse and argumentation subgraphs: what can we learn on their dependencies?
  Laurine Huber, Justine Reynaud, Mathilde Dargnat, Yannick Toussaint
  
• Explaining Multicriteria Decision Making with Formal Concept Analysis
  Alexandre Bazin,Miguel Couceiro, Marie-Dominigue Devignes, Amedeo Napoli
  
• A Link between Pattern Structures and Random Forests
  Tilo Krause, Lars Lumpe, Stefan E. Schmidt
  
• Gradual Discovery with Closure Structure of a Concept Lattice
  Tatiana Makhalova, Sergei O. Kuznetsov, and Amedeo Napoli
  
• Representing Informational Harmoniums using Semifield-Valued Formal Concept Analysis
  Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
  
• Exploratory Data Analysis of Multi-label Classification Tasks with Formal Context Analysis
  Francisco J. Valverde-Albacete, Carmen Peláez-Moreno, Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego
  
• Optimization Problems on Posets
  Christian Jäkel and Stefan E. Schmidt
  
• Practical Comparison of FCA Extensions to Model Indeterminate Value of Ternary Data
  Priscilla Keip, Sébastien Ferré, Alain Gutierrez, Marianne Huchard, Pierre Silvie, Pierre Martin
  
• Sequence mining using FCA and the NextPriorityConcept algorithm
  Salah Eddine Boukhetta, Christophe Demko, Jérémy Richard, Karell Bertet
  
• A CbO-based Algorithm for Mining Class Relevant Patterns
  Hirohisa Seki, Taiki Yamada
  
• Discovery of Link Keys in RDF Data Based on Pattern Structures: Preliminary Steps
  Abbas Abbas, Jérôme David, Amedeo Napoli
  
• Steps in the Representation of Concept Lattices and Median Graphs
  Alain Gély, Miguel Couceiro, Laurent Miclet, Amedeo Napoli
  
• Shapley and Banzhaf Veetors of a Formal Concept
  Dmitry I. Ignatov, Léonard Kwuida
  
• Quantified formal-concept operators
  M. Eugenia Cornejo, Juan Carlos Díaz-Moreno, Juan López-Rodríguez, Jesús Medina
  

Short Papers

• Comparison of Matrix Reordering Algorithms Based on Monotone Systems
  Grete Lind, Rein Kuusik
  
• Towards Stable Significant Subgroup Discovery
  Jyoti, Aleksey Buzmakov, Sriram Kailasam
  

CLA 2018 Papers

Invited Contributions

• Relational Machine Learning
  Filip Železný
  
• Psychological Theories of Concepts
  Edouard Machery
  
• Towards Cross-Fertilization between Data Mining and Constraints
  Lakhdar Sais
  
• Boolean Tensor Factorizations – and Beyond
  Pauli Miettinen
  

Regular Papers

• K-Chains Problem and Why it Matters for Extremal Contexts
  Bogdan Chornomaz
  
• A First Study on What MDL Can Do for FCA
  Tatiana Makhalova, Sergei O. Kuznetsov, and Amedeo Napoli
  
• Average Size of Implicational Bases
  Giacomo Kahn and Alexandre Bazin
  
• Mining Correlated Association Rules from Multi-Relational Data using Interval Patterns
  Hirohisa Seki and Masahiro Nagao
  
• k-Partite Graphs as Contexts
  Alexandre Bazin and Aurélie Bertaux
  
• How Hierarchies of Concept Graphs Can Facilitate the Interpretation of RCA Lattices?
  Sébastien Ferré and Peggy Cellier
  
• Cover Problems, Dimensions And The Tensor Product Of Complete Lattices
  Christian Jäkel and Stefan E. Schmidt
  
• Finding Concepts with Unexpected Multi-Label Objects Based on Shared Subspace Method
  HongJie Zhai, Makoto Haraguchi, Yoshiaki Okubo, and HeYu Liu
  
• Steps Towards Achieving Distributivity in Formal Concept Analysis
  Alain Gély, Miguel Couceiro, and Amedeo Napoli
  
• A Data Analysis Application of Formal Independence Analysis
  Francisco J. Valverde-Albacete, Carmen Peláez-Moreno, Inma P. Cabrera, Pablo Cordero, and Manuel Ojeda-Aciego
  
• Towards Simplification Logic for Graded Attribute Implications with General Semantics
  Pablo Cordero, Manuel Enciso, Angel Mora, and Vilem Vychodil
  
• A Similarity Measure to Generalize Attributes
  Rostand S. Kuitché, Romuald E. A. Temgoua, and Léonard Kwuida
  
• Order-embedded Complete Lattices
  Bernhard Ganter
  
• The 8M Algorithm from Today's Perspective
  Radim Belohlavek and Martin Trnecka
  
• Can We Measure the Interpretability of Factors?
  Martin Trnecka and Marketa Trneckova
  
• Toward Factor Analysis of Educational Data
  Eduard Bartl, Radim Belohlavek, and Alex Scharaschkin
  
• Interactive Query Refinement using Formal Concept Analysis
  Tim Pattison
  

Papers with Short Presentation

• Efficient Formal Concept Analysis through Recursive Context Partitioning
  Tim Pattison, Aaron Ceglar, and Derek Weber
  
• Sequential Pattern Mining using FCA and Pattern Structures for Analyzing Visitor Trajectories in a Museum
  Nyoman Juniarta, Miguel Couceiro, Amedeo Napoli, and Chedy Raïssi
  
• Pattern Setups and Their Completions
  Aimene Belfodil, Sergei O. Kuznetsov, and Mehdi Kaytoue
  
• A New Method for Inheriting Canonicity Test Failures in Close-by-One Type Algorithms
  Simon Andrews
  
• The Distributive, Graded Lattice of EL Concept Descriptions and its Neighborhood Relation
  Francesco Kriegel
  
• Characterizing Covers of Functional Dependencies using FCA
  Victor Codocedo, Jaume Baixeries, Mehdi Kaytoue, and Amedeo Napoli
  

CLA 2016 Papers

Invited Contributions

• Strictly Positive Fragments of Modal and Description Logic
  Lev D. Beklemishev
  
• Data Interlinking with Formal Concept Analysis and Link Keys
  Jérôme Euzenat
  
• Things to Do in Formal Concept Analysis
  Bernhard Ganter
  
• Approximate Clusters, Biclusters and n-Clusters in the Analysis of Binary and General Data Matrices
  Boris G. Mirkin
  

Regular Papers

• LatViz: A New Practical Tool for Performing Interactive Exploration over Concept Lattices
  Mehwish Alam, Thi Nhu Nguyen Le, Amedeo Napoli
  
• Comparing Algorithms for Computing Lower Covers of Implication-closed Sets
  Alexandre Bazin
  
• Partial Duplication of Convex Sets in Lattices
  Laurent Beaudou, Lhouari Nourine
  
• A Lattice-based Consensus Clustering Algorithm
  Artem Bocharov, Dmitry Gnatyshak, Dmitry I. Ignatov, Boris G. Mirkin, Andrey Shestakov
  
• Some Experimental Results on Randomly Generating Formal Contexts
  Daniel Borchmann, Tom Hanika
  
• Approximate Seriation Problem in Formal Context Analysis
  François Brucker, Pascal Préa
  
• On Scaling of Fuzzy FCA to Pattern Structures
  Aleksey Buzmakov, Amedeo Napoli
  
• On the Existence of Right Adjoints for Surjective Mappings between Fuzzy Structures
  Inma P. Cabrera, Pablo Cordero, Francisca García-Pardo, Manuel Ojeda-Aciego, Bernard De Baets
  
• FCA for Software Product Lines Representation: Mixing Product and Characteristic Relationships in a Unique Canonical Representation
  Jessie Carbonnel, Karell Bertet, Marianne Huchard, Clémentine Nebut
  
• Characterization of Order-like Dependencies with Formal Concept Analysis
  Víctor Codocedo, Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli
  
• Reducts in Multi-Adjoint Concept Lattices
  Maria Eugenia Cornejo Piñero, Jesús Medina Moreno, Eloisa Ramírez Poussa
  
• Conceptual Methods for Identifying Needs of Mobile Network Subscribers
  Dmitry Palchunov, Gulnara Yakhyaeva, Ekaterina Dolgusheva
  
• A Hybrid Data Mining Approach for the Identification of Biomarkers in Metabolomic Data
  Dhouha Grissa, Blandine Comte, Estelle Pujos-Guillot, Amedeo Napoli
  
• Generalized Metrics and Their Relevance for FCA and Closure Operators
  Tobias Gäbel-Hökenschnieder, Thorsten Pfeiffer, Mosadak Al Salamat, Stefan E. Schmidt
  
• Global Optimization in Learning with Important Data: an FCA-Based Approach
  Yury Kashnitsky, Sergei O. Kuznetsov
  
• Intensional Concept Graphs as Patterns over Power Context Families
  Jens Kötters
  
• Pattern Structures for Treatment Optimization in Subgroups of Patients
  Natalia V. Korepanova, Sergei O. Kuznetsov
  
• NextClosures with Constraints
  Francesco Kriegel
  
• On Stability of Triadic Concepts
  Sergei O. Kuznetsov, Tatyana P. Makhalova
  
• A Fresh View on Fuzzy Formal Concept Analysis and Mathematical Morphology
  Tim B. Kaiser, Lars Lumpe, Stefan E. Schmidt
  
• Continuous Target Variable Prediction with Augmented Interval Pattern Structures: A Lazy Algorithm
  Alexey Masyutin, Sergei O. Kuznetsov
  
• Unified External Data Access Implementation in Formal Concept Analysis Research Toolbox
  Alexey A. Neznanov, Andrey A. Parinov
  
• Exploring Temporal Data Using Relational Concept Analysis: An Application to Hydroecological Data
  Cristina Nica, Agnès Braud, Xavier Dolques, Marianne Huchard, Florence Le Ber
  
• Data Retrieval and Noise Reduction by Fuzzy Associative Memories
  Irina Perfilieva, Marek Vajgl
  
• Textual Information Extraction in Document Images Guided by a Concept Lattice
  Cynthia Pitou, Jean Diatta
  
• CAISL: Simplification Logic for Conditional Attribute Implications
  Estrella Rodríguez Lorenzo, Pablo Cordero, Manuel Enciso, Rokia Missaoui, Angel Mora Bonilla
  
• Building a Domain Knowledge Model Based on a Concept Lattice Integrating Expert Constraints
  My Thao Tang, Aleksey Buzmakov, Yannick Toussaint, Amedeo Napoli
  
• Scalable Performance of FCbO Algorithm on Museum Data
  Tim Wray, Jan Outrata, Peter Eklund
  

CLA 2015 Papers

Invited Contributions

• User Models as Personal Ontologies
  Gabriella Pasi
  
• Formal Concept Analysis from the Standpoint of Possibility Theory
  Didier Dubois
  
• Clarifying Lattice Structure by Data Polishing
  Takeaki Uno
  
• Tractable Interesting Pattern Mining in Large Networks
  Jan Ramon
  
• Extended Dualization: Application to Maximal Pattern Mining
  Lhouari Nourine
  

Full Papers

• Subset-Generated Complete Sublattices as Concept Lattices
  Martin Kauer, Michal Krupka
  
• RV-Xplorer: A Way to Navigate Lattice-Based Views over RDF Graphs
  Mehwish Alam, Matthieu Osmuk, Amedeo Napoli
  
• Finding p-indecomposable Functions: FCA Approach
  Artem Revenko
  
• Putting OAC-triclustering on MapReduce
  Sergey Zudin, Dmitry V. Gnatyshak, Dmitry I. Ignatov
  
• Concept Interestingness Measures: a Comparative Study
  Sergei O. Kuznetsov, Tatyana P. Makhalova
  
• Why Concept Lattices Are Large - Extremal Theory for the Number of Minimal Generators and Formal Concepts
  Alexandre Albano, Bogdan Chornomaz
  
• An Aho-Corasick Based Assessment of Algorithms Generating Failure Deterministic Finite Automata
  Madoda Nxumalo, Derrick G. Kourie, Loek Cleophas, Bruce W. Watson
  
• Context-Aware Recommender System Based on Boolean Matrix Factorisation
  Marat Akhmatnurov, Dmitry I. Ignatov
  
• Class Model Normalization - Outperforming Formal Concept Analysis Approaches with AOC-posets
  André Miralles, Guilhem Molla, Marianne Huchard, Clémentine Nebut, Laurent Deruelle, Mustapha Derras
  
• Partial Enumeration of Minimal Transversals of a Hypergraph
  Lhouari Nourine, Alain Quilliot, Hélène Toussaint
  
• An Introduction to Semiotic-Conceptual Analysis with Formal Concept Analysis
  Uta Priss
  
• Using the Chu Construction for Generalizing Formal Concept Analysis
  Ľubomír Antoni, Inmaculada P. Cabrera, Stanislav Krajči, Ondrej Krídlo, Manuel Ojeda-Aciego
  
• From Formal Concepts to Analogical Complexes
  Laurent Miclet, Jacques Nicolas
  
• Pattern Structures and Their Morphisms
  Lars Lumpe, Stefan E. Schmidt
  
• NextClosures: Parallel Computation of the Canonical Base
  Francesco Kriegel, Daniel Borchmann
  
• Probabilistic Implicational Bases in FCA and Probabilistic Bases of GCIs in EL⊥
  Francesco Kriegel
  
• Category of Isotone Bonds between L-fuzzy Contexts over Different Structures of Truth Degrees
  Jan Konecny, Ondrej Krídlo
  
• From an Implicational System to its Corresponding D-basis
  Estrella Rodríguez-Lorenzo, Kira Adaricheva, Pablo Cordero, Manuel Enciso, Angel Mora
  
• Using Linguistic Hedges in L-rough Concept Analysis
  Eduard Bartl, Jan Konecny
  
• Revisiting Pattern Structures for Structured Attribute Sets
  Mehwish Alam, Aleksey Buzmakov, Amedeo Napoli, Alibek Sailanbayev
  

CLA 2014 Papers

Invited Contributions

• Relationship between the Relational Database Model and FCA
  Jaume Baixeries
  
• What Formalism for the Semantic Web?
  Hassan Aït-Kaci
  
• Linguistic Data Mining with FCA
  Uta Priss
  
• Shortest CNF Representations of Pure Horn Functions and their Connection to Implicational Bases
  Ondrej Cepek
  

Full Papers

• Learning Model Transformation Patterns using Graph Generalization
  Hajer Saada, Marianne Huchard, Michel Liquière, Clémentine Nebut
  
• Interaction Challenges for the Dynamic Construction of Partially-Ordered Sets
  Tim Pattison, Aaron Ceglar
  
• The Educational Tasks and Objectives System within a Formal Context
  Ľubomír Antoni, Ján Guniš, Stanislav Krajči, Ondrej Krídlo, Ľubomír Šnajder
  
• Pattern Structures for Understanding Episode Patterns
  Keisuke Otaki, Madori Ikeda, Akihiro Yamamoto
  
• Formal Concept Analysis for Process Enhancement Based on a Pair of Perspectives
  Madori Ikeda, Keisuke Otaki, Akihiro Yamamoto
  
• Merging Closed Pattern Sets in Distributed Multi-Relational Data
  Hirohisa Seki, Yohei Kamiya
  
• Looking for Bonds between Nonhomogeneous Formal Contexts
  Ondrej Krídlo, Lubomír Antoni, Stanislav Krajči
  
• Reverse Engineering Feature Models from Software Configurations using Formal Concept Analysis
  Ra'Fat Al-Msie'Deen, Marianne Huchard, Abdelhak Seriai, Christelle Urtado, Sylvain Vauttier
  
• An Algorithm for the Multi-Relational Boolean Factor Analysis based on Essential Elements
  Martin Trnecka, Marketa Trneckova
  
• On Concept Lattices as Information Channels
  Francisco José Valverde Albacete, Carmen Peláez-Moreno, Anselmo Peñas
  
• Using Closed Itemsets for Implicit User Authentication in Web Browsing
  Olivier Coupelon, Diyé Dia, Fabien Labernia, Yannick Loiseau, Olivier Raynaud
  
• The Direct-optimal Basis via Reductions
  Estrella Rodríguez Lorenzo, Karell Bertet, Pablo Cordero, Manuel Enciso, Ángel Mora
  
• Ordering Objects via Attribute Preferences
  Inma P. Cabrera, Manuel Ojeda-Aciego, Jozef Pócs
  
• DFSP: A New Algorithm for a Swift Computation of Formal Concept Set Stability
  Ilyes Dimassi, Amira Mouakher, Sadok Ben Yahia
  
• Attributive and Object Subcontexts in Inferring Good Maximally Redundant Tests
  Xenia Naidenova, Vladimir Parkhomenko
  
• Removing an Incidence from a Formal Context
  Martin Kauer, Michal Krupka
  
• Formal L-concepts with Rough Intents
  Eduard Bartl, Jan Konecny
  
• Reduction Dimension of Bags of Visual Words with FCA
  Ngoc Bich Dao, Karell Bertet, Arnaud Revel
  
• A One-pass Triclustering Approach: Is There any Room for Big Data?
  Dmitry V. Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov, Lhouari Nourine
  
• Three Interrelated FCA Methods for Mining Biclusters of Similar Values on Columns
  Mehdi Kaytoue, Victor Codocedo, Jaume Baixeries, Amedeo Napoli
  
• Defining Views with Formal Concept Analysis for Understanding SPARQL Query Results
  Mehwish Alam, Amedeo Napoli
  
• A Generalized Framework to Consider Positive and Negative Attributes in Formal Concept Analysis
  José Manuel Rodríguez Jiménez, Pablo Cordero, Manuel Enciso, Ángel Mora
  

CLA 2013 Papers

Invited Contributions

• Projective Lattices
  Ralph Freese
  
• Cartification: from Similarities to Itemset Frequencies
  Bart Goethals
  
• Cooperative Games on Lattices
  Michel Grabisch
  
• Some applications of Lattice Analysis (1983-2013)
  Vincent Duquenne
  

Full Papers

• A practical application of Relational Concept Analysis to class model factorization: lessons learned from a thematic information system
  Abdoulkader Osman Guédi, André Miralles, Marianne Huchard, Clémentine Nebut
  
• Galois Sub-Hierarchies Used for Use Case Modeling
  Ants Torim
  
• Computing Similarity Dependencies with Pattern Structures
  Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli
  
• Enumerating Pseudo-Intents in a Partial Order
  Alexandre Bazin, Jean-Gabriel Ganascia
  
• Decomposition of Intervals in the Space of Anti-Monotonic Functions
  Patrick De Causmaecker, Stefan De Wannemacker
  
• Attribute exploration with fuzzy attributes and background knowledge
  Cynthia Vera Glodeanu
  
• An efficient Java implementation of the immediate successors calculation
  Clément Guérin, Karell Bertet, Arnaud Revel
  
• CryptoLat - a Pedagogical Software on Lattice Cryptomorphisms and Lattice Properties
  Florent Domenach
  
• CRL-Chu correspondences
  Ondrej Krídlo, Manuel Ojeda-Aciego
  
• Formal Concept Analysis of higher order
  Ondrej Krídlo, Patrik Mihalčin, Stanislav Krajči, Lubomír Antoni
  
• AOC-posets: a scalable alternative to Concept Lattices for Relational Concept Analysis
  Xavier Dolques, Florence Le Ber, Marianne Huchard
  
• Computing the Concept Lattice using Dendritical Neural Networks
  David Ernesto Caro-Contreras, Andres Mendez-Vazquez
  
• Isotone L-bonds
  Jan Konecny, Manuel Ojeda-Aciego
  
• A Conceptual-KDD approach and its application to cultural heritage
  Renzo Stanley, Hernán Astudillo, Víctor Codocedo, Amedeo Napoli
  
• Analogical proportions and the factorization of information in distributive lattices
  Nelly Barbot, Laurent Miclet, Henri Prade
  
• Boolean Factor Analysis of Multi-Relational Data
  Marketa Krmelova, Martin Trnecka
  
• On Projections of Sequential Pattern Structures (with an application on care trajectories)
  Aleksey Buzmakov, Elias Egho, Nicolas Jay, Sergei O. Kuznetsov, Amedeo Napoli, Chedy Raïssi
  
• Spectral Lattices of reducible matrices over completed idempotent semifields
  Francisco José Valverde-Albacete, Carmen Peláez-Moreno
  
• On information retrieval in morphological image and signal processing
  Cristina Alcalde, Ana Burusco, Juan Carlos Díaz, Ramon Fuentes-González, Jesús Medina
  
• A Study on the Correspondence between FCA and ELI Ontologies
  Melisachew Wudage Chekol, Mehwish Alam, Amedeo Napoli
  
• From Triadic FCA to Triclustering: Experimental Comparison of Some Triclustering Algorithms
  Dmitry V. Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov
  
• A lattice-free concept lattice update algorithm based on *CbO
  Jan Outrata
  

Short Papers

• Applying User-Guided, Dynamic FCA to Navigational Searches for Earth Science Data and Documentation
  Bruce R. Barkstrom
  
• A Collaborative Approach for FCA-Based Knowledge Extraction
  My Thao Tang, Yannick Toussaint
  
• Towards Description Logic on Concept Lattices
  Julia V. Grebeneva, Nikolay V. Shilov, Natalia O. Garanina
  
• Computing Left-Minimal Direct Basis of implications
  Pablo Cordero, Manuel Enciso, Angel Mora, Manuel Ojeda-Aciego
  
• Comparing Performance of Formal Concept Analysis and Closed Frequent Itemset Mining Algorithms on Real Data
  Lenka Pisková, Tomáš Horváth
  

CLA 2012 Papers

Invited Contributions

• Some results on the L-Fuzzy Concept Analysis
  Ana Burusco
  
• Multi-adjoint concept lattices
  Jesús Medina
  
• Data characteristics and their relation to closed patterns discovery algorithms
  Engelbert Mephu Nguifo
  
• On the names of implication
  Sergei O. Kuznetsov
  

Long Papers

• A Generalized Next-Closure Algorithm – Enumerating Semilattice Elements from a Generating Set
  Daniel Borchmann
  
• Hermes: an efficient algorithm for building Galois sub-hierarchies
  Anne Berry, Marianne Huchard, Amedeo Napoli, Alain Sigayret
  
• Mining Concepts from Incomplete Datasets Utilizing Matrix Factorization
  Lenka Pisková, Stefan Pero, Tomáš Horváth, Stanislav Krajči
  
• Learning Model Transformations from Examples using FCA: One for All or All for One?
  Hajer Saada, Xavier Dolques, Marianne Huchard, Clémentine Nebut, Houari Sahraoui
  
• Annotating Lattice Orbifolds with Minimal Acting Automorphisms
  Tobias Schlemmer
  
• Fuzzy formal concept analysis via multilattices: first prospects and results
  J. Medina, J. Ruiz-Calvino
  
• An interpretation of the L-Fuzzy Concept Analysis as a tool for the Morphological Image and Signal Processing
  Cristina Alcalde, Ana Burusco, Ramón Fuentes-González
  
• Relationship between Two FCA Approaches on Heterogeneous Formal Contexts
  Ľubomír Antoni, Stanislav Krajči, Ondrej Krídlo, Bohuslav Macek, Lenka Pisková
  
• Concepts and Types – An Application to Formal Language Theory
  Christian Wurm
  
• Distributed Closed Pattern Mining in Multi-Relational Data based on Iceberg Query Lattices: Some Preliminary Results
  Hirohisa Seki, Sho-ich Tanimoto
  
• Attribute Dependencies in a Fuzzy Setting
  Cynthia Vera Glodeanu
  
• How Relational Concept Analysis Can Help to Observe the Evolution of Business Class Models
  A. Osman Guédi, A. Miralles, B. Amar, C. Nebut, M. Huchard, T. Libourel
  
• Finding Errors in New Object Intents
  Artem Revenko, Sergei O. Kuznetsov
  
• Adapting Fuzzy Formal Concept Analysis for Fuzzy Description Logics
  Felix Distel
  
• Computing Functional Dependencies with Pattern Structures
  Jaume Baixeries, Mehdi Kaytoue, Amedeo Napoli
  
• Computing minimal generators from implications: a logic-guided approach
  P. Cordero, M. Enciso, A. Mora, M. Ojeda-Aciego
  
• Conceptual analysis of complex system simulation data for decision support: Application to aircraft cabin design
  Nizar Messai, Cassio Melo, Mohamed Hamdaoui, Dung Bui, Marie-Aude Aufaure
  
• A Hybrid Classification Approach based on FCA and Emerging Patterns – An application for the classification of biological inhibitors
  Yasmine Asses, Aleksey Buzmakov, Thomas Bourquard, Sergei O. Kuznetsov, Amedeo Napoli
  
• The dependence graph of a lattice
  Karell Bertet
  
• Linking L-Chu correspondences and completely lattice L-ordered sets
  Ondrej Krídlo, Manuel Ojeda-Aciego
  
• Using intensifying hedges to reduce size of multi-adjoint concept lattices with heterogeneous conjunctors
  Jan Konecny, Jesús Medina, Manuel Ojeda-Aciego
  
• A contribution to semantic indexing and retrieval based on FCA – An application to song datasets
  Víctor Codocedo, Ioanna Lykourentzou, Amedeo Napoli
  
• Efficient Vertical Mining of Minimal Rare Itemsets
  Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin
  
• Multiple Keyword Pattern Matching using Position Encoded Pattern Lattices
  Fritz J. Venter, Bruce W. Watson, Derrick G. Kourie
  
• Factor analysis of sports data via decomposition of matrices with grades
  Radim Belohlavek, Marketa Krmelova
  
• Impact of Boolean factorization as preprocessing methods for classification of Boolean data
  Radim Belohlavek, Jan Outrata, Martin Trnecka
  
• The lattice of all betweenness relations: Structure and properties
  Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine
  
• Using Taxonomies on Objects and Attributes to Discover Generalized Patterns
  Léonard Kwuida, Rokia Missaoui, Jean Vaillancourt
  

Short Papers

• Formal Concept Analysis Applied to Transcriptomic Data
  Mehwish Alam, Adrien Coulet, Amedeo Napoli, Malika Smaïl-Tabbone
  
• WebGeneKFCA: an On-line Conceptual Analysis Tool for Genomic Expression Data
  José María Fernández-Calabozo, Carmen Peláez-Moreno, Francisco J. Valverde-Albacete
  
• Concept Lattices and Median Networks
  Uta Priss
  

CLA 2011 Papers

Invited Contributions

• Mathematical Morphology, Lattices, and Formal Concept Analysis
  Isabelle Bloch
  
• Random concept lattices
  Richard Emilion
  
• Galois and his Connections—A retrospective on the 200th birthday of Evariste Galois
  Marcel Erné
  
• Canonical extensions, Duality theory, and Formal Concept Analysis
  Mai Gehrke
  
• Galois connections and residuation: origins and developments II
  Bruno Leclerc
  
• Galois connections and residuation: origins and developments I
  Bernard Monjardet
  
• Metrics, Betweeness Relations, and Entropies on Lattices and Applications
  Dan Simovici
  

Long Papers

• Vertical decomposition of a lattice using clique separators
  Anne Berry, Romain Pogorelcnik, Alain Sigayret
  
• Building up Shared Knowledge with Logical Information Systems
  Mireille Ducasse, Sebastien Ferre, Peggy Cellier
  
• Comparing performance of algorithms for generating the Duquenne-Guigues basis
  Konstantin Bazhanov, Sergei Obiedkov
  
• Filtering Machine Translation Results with Automatically Constructed Concept Lattices
  Yılmaz Kılıçaslan, Edip Serdar Güner
  
• Concept lattices in fuzzy relation equations
  Juan Carlos Díaz, Jesús Medina-Moreno
  
• Adaptation knowledge discovery for cooking using closed itemset extraction
  Emmanuelle Gaillard, Jean Lieber, Emmanuel Nauer
  
• Fast Computation of Proper Premises
  Uwe Ryssel, Felix Distel, Daniel Borchmann
  
• Block relations in fuzzy setting
  Jan Konecny, Michal Krupka
  
• A closure algorithm using a recursive decomposition of the set of Moore co-families
  Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud
  
• Iterative Software Design of Computer Games through FCA
  David Llansó, Marco Antonio Gómez-Martín, Pedro Pablo Gómez-Martín, Pedro Antonio González-Calero
  
• Fuzzy-valued Triadic Implications
  Cynthia Vera Glodeanu
  
• Mining bicluster of similar values with triadic concept analysis
  Mehdi Kaytoue, Sergei Kuznetsov, Juraj Macko, Wagner Meira, Amedeo Napoli
  
• Fast Mining of Iceberg Lattices: A Modular Approach Using Generators
  Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov
  
• Boolean factors as a means of clustering of interestingness measures of association rules
  Radim Belohlavek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata
  
• Combining Formal Concept Analysis and Translation to Assign Frames and Thematic Grids to French Verbs
  Ingrid Falk, Claire Gardent
  
• Generation algorithm of a concept lattice with limited access to objects
  Christophe Demko, Karell Bertet
  
• Homogeneity and Stability in Conceptual Analysis
  Paula Brito, Géraldine Polaillon
  
• A lattice-based query system for assessing the quality of hydro-ecosystems
  Agnés Braud, Cristina Nica, Corinne Grac, Florence Le Ber
  
• The word problem in semiconcept algebras
  Philippe Balbiani
  
• Looking for analogical proportions in a formal concept analysis setting
  Laurent Miclet, Henri Prade, David Guennec
  
• Random extents and random closure systems
  Bernhard Ganter
  
• Extracting Decision Trees From Interval Pattern Concept Lattices
  Zainab Assaghir, Mehdi Kaytoue, Wagner Meira, Jean Villerd
  
• A New Formal Context for Symmetric Dependencies
  Jaume Baixeries
  
• Cheating to achieve Formal Concept Analysis over a large formal context
  Víctor Codocedo, Carla Taramasco, Hernán Astudillo
  
• A FCA-based analysis of sequential care trajectories
  Elias Egho, Nicolas Jay, Chedy Raissi, Amedeo Napoli
  
• Querying Relational Concept Lattices
  Zeina Azmeh, Mohamed Hacéne-Rouane, Marianne Huchard, Amedeo Napoli, Petko Valtchev
  
• Links between modular decomposition of concept lattice and bimodular decomposition of a context
  Alain Gély
  

Short Papers

• Abduction in Description Logics using Formal Concept Analysis and Mathematical Morphology: application to image interpretation
  Jamal Atif, Céline Hudelot, Isabelle Bloch
  
• A local discretization of continuous data for lattices: Technical aspects
  Nathalie Girard, Karell Bertet, Muriel Visani
  
• Formal Concept Analysis on Graphics Hardware
  W. B. Langdon, Shin Yoo, Mark Harman
  

CLA 2010 Papers

Invited Talks

• Granular FCA—An Introduction
  Bernhard Ganter
  
• A Survey on how Description Logic Ontologies Benefit from FCA
  Barış Sertkaya
  
• Lifeworld and Mathematics
  Rudolf Wille
  

Regular Papers

• L-Fuzzy Concepts and Linguistic Variables in Knowledge Acquisition Processes
  Cristina Alcalde, Ana Burusco, Ramón Fuentes-González
  
• Relations between Proto-fuzzy concepts, Crisply Generated Fuzzy Concepts, and Interval Pattern Structures
  Vera V. Pankratieva, Sergei O. Kuznetsov
  
• Operators and Spaces Associated to Matrices with Grades and Their Decompositions II
  Radim Belohlavek, Jan Konecny
  
• L-Bonds vs Extents of Direct Products of Two L-fuzzy Contexts
  Ondrej Krídlo, Stanislav Krajči, Manuel Ojeda-Aciego
  
• Reducing the Size of Concept Lattices: The JBOS Approach
  Sérgio M. Dias, Newton Vieira
  
• Towards Attribute Reduction in Multi-adjoint Concept Lattices
  Jesús Medina Moreno, Manuel Ojeda-Aciego
  
• Analysis of Large Data Sets using Formal Concept Lattices
  Simon Andrews, Constantinos Orphanides
  
• General Approach to Triadic Concept Analysis
  Jan Konecny, Petr Osicka
  
• Triadic Factor Analysis
  Cynthia Glodeanu
  
• Social Tagging for Digital Libraries using Formal Concept Analysis
  Peter Eklund, Tim Wray
  
• Using Formal Concept Analysis to Acquire Knowledge about Verbs
  Ingrid Falk, Claire Gardent, Alejandra Lorenzo
  
• Evaluating Term Concept Association Mesaures for Short Text Expansion: Two Case Studies of Classification and Clustering
  Alessandro Marco Boutari, Claudio Carpineto, Raffaele Nicolussi
  
• Modifying Logic of Discovery for Dealing with Domain Knowledge in Data Mining
  Jan Rauch
  
• Preprocessing Input Data for Machine Learning by FCA
  Jan Outrata
  
• Discovering Functional Dependencies and Association Rules by Navigating in a Lattice of OLAP Views
  Pierre Allard, Sébastien Ferré, Olivier Ridoux
  
• Anthropocentric Visualisation of Optimal Cover of Association Rules
  Amira Mouakher, Sadok Ben Yahia
  
• Using Formal Concept Analysis for Discovering Knowledge Patterns
  Mohamed Rouane-Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev
  
• Restrictions on Concept Lattices for Pattern Management
  Léonard Kwuida, Rokia Missaoui, Beligh Ben Amor, Lahcen Boumedjout, Jean Vaillancourt
  
• Fixing Generalization Defects in UML Use Case Diagrams
  Xavier Dolques, Clémentine Nebut, Marianne Huchard, Philippe Reitz
  
• Component-Based Architecture Recovery from Object Oriented Systems via Relational Concept Analysis
  Alae-Eddine El Hamdouni, Abdelhak Seriai, Marianne Huchard
  
• An Inference System for Exhaustive Generation of Mixed and Purely Negative Implications from Purely Positive Ones
  Rokia Missaoui, Lhouari Nourine, Yoan Renaud
  
• The Scaffolding of a Formal Context
  Stephan Doerfel
  
• Recognizing Pseudo-intents is coNP-complete
  Mikhail A. Babin, Sergei O. Kuznetsov
  
• Combining FCA Software and Sage
  Uta Priss
  
• Attribute Exploration of Properties of Functions on Ordered Sets
  Artem Revenko, Sergei O. Kuznetsov
  
• Advances in Algorithms Based on CbO
  Petr Krajca, Jan Outrata, Vilem Vychodil
  

Short Papers

• Thoughts on Exploiting Instability in Lattices for Assessing the Discrimination Adequacy of a Taxonomy
  Antony Cooper, Derrick Kourie, Serena Coetzee
  
• Using Bonds for Describing Method Dispatch in Role-Oriented Software Models
  Henri Mühle
  
• Linguistic Processing in Lattice-Based Taxonomy Construction
  Anastasia Novokreshchenova, Maria Shabanova, Dmitry Zaytsev, Nina Belyaeva
  

CLA 2008 Papers

Invited Contributions

• Recent Interfaces for Formal Concept Analysis
  Bernhard Ganter
  
• The GUHA Method and its Meaning for Data Mining
  Petr Hájek
  
• Biclustering Methods Meets Formal Concept Analysis
  George Karypis
  
• Rough Sets and Formal Concept Analysis: Foundations and the Case Studies of Feature Subset Selection and Knowledge Structure Formation
  Dominik Ślȩzak
  

Regular Contributions

• A Formal Concept Analysis of Harmonic Forms and Interval Structures
  Tobias Schlemmer, Stefan E. Schmidt
  
• Connecting Many-valued Contexts to General Geometric Structures
  Tim B. Kaiser
  
• Concept Lattice Mining for Unsupervised Named Entity Annotation
  Thomas Girault
  
• An Efficient Hybrid Algorithm for Mining Frequent Closures and Generators
  Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin
  
• Optimal Decompositions of Matrices with Grades into Binary and Graded Matrices
  Eduard Bartl, Radim Belohlavek, Jan Konecny
  
• Parallel Recursive Algorithm for FCA
  Petr Krajca, Jan Outrata, Vilem Vychodil
  
• Proto-fuzzy Concepts, their Retrieval and Usage
  Ondrej Krídlo, Stanislav Krajči
  
• Application of the Formal Concept Analysis in Evaluation of Results of ANEWS Questionnaire and Physical Activity of the Czech Regional Centers
  Jiří Zacpal, Erik Sigmund, Josef Mitáš, Vladimír Sklenář
  
• A Model-driven Engineering Based RCA Process for Bi-level Models Elements / Meta-elements: Application to Description Logics
  Xavier Dolques, Jean-Rémy Falleri, Marianne Huchard, Clémentine Nebut
  
• Extending Attribute Exploration by Means of Boolean Derivatives
  José Antonio Alonso-Jiménez, Gonzalo A. Aranda-Corral, Joaquín Borrego-Díaz, M. Magdalena Fernández-Lebrón, M. José Hidalgo-Doblado
  
• FCA Software Interoperability
  Uta Priss
  
• GARM: Generalized Association Rule Mining
  Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo
  
• Concept-based Recommendations for Internet Advertisement
  Dmitry I. Ignatov, Sergei O. Kuznetsov
  
• The Mathematical in Music Thinking
  Rudolf Wille, Renate Wille-Henning
  
• An Application of Formal Concept Analysis to Neural Decoding
  Dominik Endres, Peter Földiák, Uta Priss
  
• Some Links Between Decision Tree and Dichotomic Lattice
  Stéphanie Guillas, Karell Bertet, Muriel Visani, Jean-Marc Ogier, Nathalie Girard
  
• On Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order
  Pavel Martinek
  
• On the Isomorphism Problem of Concept Algebras
  Léonard Kwuida, Hajime Machida
  
• Factorization of Concept Lattices with Hedges by Means of Factorization of Residuated Lattices
  Michal Krupka
  

Posters

• A Software Tool to Transform Relational Databases in Order to Mine Functional Dependencies in it Using Formal Concept Analysis
  Viorica Varga, Katalin Tunde Janosi Rancz
  
• Classification Methods Based on Formal Concept Analysis
  Nida Meddouri, Mondher Maddouri
  
• Finding Top-N Formal Concepts guided by Dynamic Ordering of Objects (abstract)
  Li Ai Xiang, Makoto Haraguchi, Yoshiaki Okubo
  

LBM 2008 Workshop Papers

• Lattice-based Modelling of Thesauri
  Uta Priss, L. John Old
  
• Piecewise-Linear Approximation of Nonlinear Models Based on Interval Numbers (INs)
  Vassilis G. Kaburlasos, S. E. Papadakis
  
• Computation of a Sufficient Condition for System Input Redundancy
  S. E. Papadakis, V. G. Kaburlasos
  
• An Approach from Lattice Computing to fMRI Analysis
  Manuel Graña, Maite García-Sebastián, Ivan Villaverde, Elsa Fernandez
  
• Redundant Encoding of Patterns in Lattice Associative Memories
  Gonzalo Urcid, Gerhard X. Ritter, José-Angel Nieves-Vazquez
  
• A Novel Fuzzy Implication Stemming from a Fuzzy Lattice Inclusion Measure
  Anestis G. Hatzimichailidis, Vassilis G. Kaburlasos
  

CLA 2007 Papers

Invited Talks

• Approximate clusters and biclusters
  Boris Mirkin
  
• Closure operators and choice operators: a survey
  Bernard Monjardet
  
• Concept Graphs as Semantic Structures for Contextual Judgment Logic
  Rudolf Wille
  

Papers

• 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
  
• 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 Crampes, David Carteret, Jean-Michel Penalva
  
• Evaluation of questionnaires supported by formal concept Analysis
  Radim Belohlavek, Vladimir Sklenar, Jiri Zacpal, Erik Sigmund
  
• Camelis: Organizing and Browsing a Personal Photo Collection with a Logical Information System
  Sébastien Ferré
  
• Concept Analysis on structured, multi-valued and incomplete Data
  David Grosser, Henri Ralambondrainy
  
• 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
  
• 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
  
• 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
  
• SearchSleuth: The Conceptual Neighbourhood of an Web Query
  Jon Ducrou, Peter Eklund
  
• 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
  

CLA 2006 Papers

Keynote Speeches

• The Anatomy of a FCA-based web clustering engine for desktop and mobile search
  Claudio Carpineto
  
• An Intelligent User Interface for Browsing and Search MPEG-7 Images
  Jon Ducrou, Peter Eklund, Tim Wilson
  
• Elements on KDDK: Knowledge Discovery guided by Domain Knowledge
  Amedeo Napoli
  
• Formal Concept Analysis as Applied Lattice Theory
  Rudolf Wille
  

Long Papers

• The Use of Galois Lattices to Fine-Tune a Meta-Classifier
  Mohamed Aoun-Allah, Guy Mineau
  
• On factorization by similarity of fuzzy concept lattices with hedges
  Radim Bělohlávek, Jan Outrata, Vilém Vychodil
  
• Graded LinClosure
  Radim Bělohlávek, Vilém Vychodil
  
• Yet another approach for completing missing values
  Leila Ben Othman, Sadok Ben Yahia
  
• Some Algorithmical Aspects Using the canonical Direct Implicationnal basis
  Karell Bertet
  
• GARC M: Generic Association Rules based Classifier Multi-parameterizable
  Ines Bouzouita, Samir Elloumi, Sadok Ben Yahia
  
• Galois Lattices and Bases for M GK-valid Association Rules
  Jean Diatta, Daniel Feno, André Totohasina
  
• Succinct System of Minimal Generators: A thorough study, limitations and new definitions
  Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo
  
• Generic association rule bases: Are they so succinct?
  Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu Nguifo
  
• Closure Systems of Equivalence Relations and Their Labeled Class Geometries
  Tim B. Kaiser
  
• Concept Lattice Representations of Annotated Taxonomies
  Tim B. Kaiser, Stefan E. Schmidt, Cliff A. Joslyn
  
• Unique Factorization Theorem and Formal Concept Analysis
  Peter Mihók, Gabriel Semanišin
  
• Towards Concise Representation for Taxonomies of Epistemic Communities
  Camille Roth, Sergei Obiedkov, Derrick Kourie
  
• Φ-Generalized Concept Lattice Models: From Power Concepts to Formal Concepts, and then to Robust Concepts
  Zhipeng Xie
  
• Generalizations of Approximation Concept
  Chen Xueyou, Li Qingguo, Long Fei, Deng Zike
  

Short Papers

• An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
  Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé
  
• Triadic Formal Concept Analysis within Multi Agent Systems
  Petr Gajdoš, Pavel Děrgel
  
• Concept lattice classifier: a first step towards an iterative process of recognition of noised graphic objects
  Stéphanie Guillas, Karell Bertet, Jean-Marc Ogier
  
• Structured Conceptual Meta-Search Engine
  Ali Jaoua, M. Lazhar Saidi, Ahmed Hasnah, Jihad M. AL-Jaam, Baina Salem, Noura Rashid, Shereen Shareef, Suad Zaghlan
  
• Using Formal Concept Analysis for mining and interpreting patient flows within a healthcare network
  Nicolas Jay, François Kohler, Amedeo Napoli
  
• A Categorial View at Generalized Concept Lattices: Generalized Chu Spaces
  Stanislav Krajči
  
• BR-Explorer: An FCA-based algorithm for Information Retrieval
  Nizar Messai, Marie-Dominique Devignes, Amedeo Napoli, Malika Smaïl-Tabbone
  
• Indexing and Searching Video Sequences Using Concept Lattices
  Nada Mimouni, Yahya Slimani
  
• Using FCA to Suggest Refactorings to Correct Design Defects
  Naouel Moha, Jihene Rezgui, Yann-Gaeel, Guéhéneuc, Petko Valtchev, Ghizlane El Boussaidi
  
• Interactive Program Modularization for Software Understanding via Formal Concept Analysis
  Kunihiko Saito, Takeshi Kurita, Shinichiro Yamamoto
  

Posters

• Implementing collection of sets with trie : a stepping stone for performances?
  Simon Bachelard, Olivier Raynaud, Yoan Renaud
  
• Approximate Pseudo-lattice generation
  Chaïma Ben Youssef, Samir Elloumi
  
• Fast Construction of Concept Lattice
  Naveen Kumar, Anamika Gupta, Vasudha Bhatnagar
  
• FCAType - a System for Type Signature Induction
  Wiebke Petersen
  
• On Concept Lattices of Efficiently Solvable Voting Protocols
  Stefano Vannucci
  

CLA 2005 Papers

• Every Concept Lattice With Hedges Is Isomorphic To Some Generalized Concept Lattice
  Stanislav Krajci
  
• A Formal Concept Analysis Approach to Discover Association Rules from Data
  Mondher Maddouri
  
• New Closure Operators and Lattice Representations for Multivalued Dependencies and Related Expressions
  Jaume Baixeries, Jose Luis Balcazar
  
• What is a fuzzy concept lattice?
  Radim Belohlavek, Vilem Vychodil
  
• Avoiding the itemset closure computation "pitfall"
  Tarek Hamrouni, Sadok Ben Yahia, Yahya Slimani
  
• Evaluation of IPAQ questionnaire by FCA
  Vladimir Sklenar, Jiri Zacpal, Erik Sigmund
  
• Efficient algorithms for clone items detection
  Raoul Medina, Caroline Noyer, Olivier Raynauld
  
• Usage of Genetic Algorithm for Lattice Drawing
  Suhail Owais, Petr Gajdos, Vaclav Snasel
  
• Translations between Concept Hierarchies over Different Attribute Sets
  Rainer Osswald
  
• Using Formal Concept Analysis for Heterogeneous Information Retrieval
  Ibtissem Nafkha, Ali Jaoua
  
• Hierarchical Multidimensional Modelling in the Concept-Oriented Data Model
  Alexander Savinov
  
• Conceptual Exploration of Software Structure: A Collection of Examples
  Richard Cole, Thomas Tilley, Jon Ducrou
  
• Creating of Conceptual Lattices using Multilayer Perceptron
  Vladimir Havel, Jan Martinovic, Vaclav Snasel, Karel Vlcek
  
• Formal Topology, Chu Space and Approximable Concept
  Xueyou Chen, Qingguo Li
  
• GenAll Algorithm: Decorating Galois lattice with minimal Generators
  Sondess Ben Tekaya, Sadok Ben Yahia, Yahya Slimani
  
• VIE_MGB: A Visual Interactive Exploration of Minimal Generic Basis of Association Rules
  Chiraz Latiri Cherif, Wissem Bellegha, Sadok Ben Yahia, Ghada Guesmi
  
• Distributed and General Galois Lattice for Large Data Bases
  Fatma Baklouti, Gerard Levy
  
• A distributed version of the Ganter algorithm for general Galois Lattices
  Fatma Baklouti, Gerard Levy
  

CLA 2004 Papers

• A Semi-automatic Method to Ontology Design by Using FCA
  Hele-Mai Haav
  
• A Fuzzy FCA-based Approach to Conceptual Clustering for Automatic Generation of Concept Hierarchy on Uncertainty Data
  Thanh Tho Quan, Siu Cheung Hui, Tru Hoang Cao
  
• The Basic Theorem on Generalized Concept Lattice
  Stanislav Krajci
  
• Emulating a Cooperative Behavior in a Generic Association Rule Visualization Tool
  I. Nsir, S. Ben Yahia, E. Mephu Nguifo
  
• Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
  Radim Belohlavek, Jiri Dvorak, Jan Outrata
  
• Concept Lattices Constrained by Equivalence Relations
  Radim Belohlavek, Vladimir Sklenar, Jiri Zacpal
  
• A new Informative Generic Base of Association Rules
  Gh. Gasmi, S. Ben Yahia, E. Mephu Nguifo, Y. Slimani
  
• The Fuzzy Classifier by Concept Localization in a Lattice of Concepts
  S. Elloumi, Ch. Ben Youssef, S. Ben Yahia
  
• Binary Factor Analysis with Help of Formal Concepts
  Ales Keprt, Vaclav Snasel
  
• Concept Lattice Generation by Singular Value Decomposition
  Petr Gajdos, Pavel Moravec, Vaclav Snasel
  
• Ontology Design with Formal Concept Analysis
  Marek Obitko, Vaclav Snasel, Jan Smid
  
• Using Concept Formal Analysis for Cooperative Information Retrieval
  Ibtissem Nafkha, Samir Elloumi, Ali Jaoua
  
• Planarity of Additively Drawn Concept Lattices
  Christian Zschalig
  

• Home
• About
• Publication Ethics
• Rules
• Steering Committee
• Participants
• Contacts

• Papers

16. 2022
15. 2020
14. 2018
13. 2016
12. 2015
11. 2014
10. 2013
9. 2012
8. 2011
7. 2010
6. 2008
5. 2007
4. 2006
3. 2005
2. 2004
1. 2002

ISSN 2311-701X