CLA 2014
Concept Lattices and Their Applications

Table of Contents

• Preface
  
  

Invited Talks

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

Regular Papers

• Learning Model Transformation Patterns using Graph Generalization11-22
  Hajer Saada, Marianne Huchard, Michel Liquière, Clémentine Nebut
• Interaction Challenges for the Dynamic Construction of Partially-Ordered Sets23-34
  Tim Pattison, Aaron Ceglar
• The Educational Tasks and Objectives System within a Formal Context35-46
  Ľubomír Antoni, Ján Guniš, Stanislav Krajči, Ondrej Krídlo, Ľubomír Šnajder
• Pattern Structures for Understanding Episode Patterns47-58
  Keisuke Otaki, Madori Ikeda, Akihiro Yamamoto
• Formal Concept Analysis for Process Enhancement Based on a Pair of Perspectives59-70
  Madori Ikeda, Keisuke Otaki, Akihiro Yamamoto
• Merging Closed Pattern Sets in Distributed Multi-Relational Data71-82
  Hirohisa Seki, Yohei Kamiya
• Looking for Bonds between Nonhomogeneous Formal Contexts83-94
  Ondrej Krídlo, Lubomír Antoni, Stanislav Krajči
• Reverse Engineering Feature Models from Software Configurations using Formal Concept Analysis95-106
  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 Elements107-118
  Martin Trnecka, Marketa Trneckova
• On Concept Lattices as Information Channels119-130
  Francisco José Valverde Albacete, Carmen Peláez-Moreno, Anselmo Peñas
• Using Closed Itemsets for Implicit User Authentication in Web Browsing131-144
  Olivier Coupelon, Diyé Dia, Fabien Labernia, Yannick Loiseau, Olivier Raynaud
• The Direct-optimal Basis via Reductions145-156
  Estrella Rodríguez Lorenzo, Karell Bertet, Pablo Cordero, Manuel Enciso, Ángel Mora
• Ordering Objects via Attribute Preferences157-168
  Inma P. Cabrera, Manuel Ojeda-Aciego, Jozef Pócs
• DFSP: A New Algorithm for a Swift Computation of Formal Concept Set Stability169-180
  Ilyes Dimassi, Amira Mouakher, Sadok Ben Yahia
• Attributive and Object Subcontexts in Inferring Good Maximally Redundant Tests181-193
  Xenia Naidenova, Vladimir Parkhomenko
• Removing an Incidence from a Formal Context195-206
  Martin Kauer, Michal Krupka
• Formal L-concepts with Rough Intents207-218
  Eduard Bartl, Jan Konecny
• Reduction Dimension of Bags of Visual Words with FCA219-230
  Ngoc Bich Dao, Karell Bertet, Arnaud Revel
• A One-pass Triclustering Approach: Is There any Room for Big Data?231-242
  Dmitry V. Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov, Lhouari Nourine
• Three Interrelated FCA Methods for Mining Biclusters of Similar Values on Columns243-254
  Mehdi Kaytoue, Victor Codocedo, Jaume Baixeries, Amedeo Napoli
• Defining Views with Formal Concept Analysis for Understanding SPARQL Query Results255-266
  Mehwish Alam, Amedeo Napoli
• A Generalized Framework to Consider Positive and Negative Attributes in Formal Concept Analysis267-278
  José Manuel Rodríguez Jiménez, Pablo Cordero, Manuel Enciso, Ángel Mora

Full Proceedings

• The complete CLA 2014 proceedings