ICFCA 2007

Clermont-Ferrand, France, February 12-16, 2007

Jump to menus

Accepted Papers for ICFCA'07

List of Accepted Papers

1. A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
   Marie AGIER, Jean-Marc PETIT
2. A Parameterized Algorithm for Exploring Concept Lattices
   Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé
3. A proposal for combining formal concept analysis and
   Marianne Huchard, Amedeo Napoli, Mohamed Rouane Hacene, Petko Valtchev
4. A solution of the word problem for free double Boolean algebras
   Bjorn Vormbrock
5. About the lossless reduction of the minimal generator family of a context
   Tarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo
6. Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis
   Ben Martin, Peter Eklund
7. Base Points, Non-unit Implications, and Convex Geometries
   Bernhard Ganter, Heiko Reppe
8. Bipartite Ferrers-graphs and Planar Concept Lattices
   Christian Zschalig
9. Computing Intensions of Digital Library Collections
   Carlo Meghini, Nicolas Spyratos
10. Galois Connections between Semimodules and Applications in Data Mining
    Francisco J. Valverde-Albacete, Carmen Peláez-Moreno
11. Lattices of relatively axiomatizable classes
    Dmitry Pal'chunov
12. On the MacNeille completion of weakly dicomplemented lattices
    Léonard Kwuida, Branimir Seselja, Andreja Tepavcevic}
13. On multi-adjoint concept lattices: definition and representation theorem
    Jesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño
14. Performances of Galois Sub-hierarchy-building algorithms
    Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret
15. Polynomial Embeddings and Representations
    Tim Becker
16. The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices
    Rudolf Wille
17. The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
    Sébastien Ferré
18. Semantology as Basis for Conceptual Knowledge Processing
    Peter Eklund, Rudolf Wille
19. Some Notes on Pseudo-intents
    Sebastian Rudolph

Accepted Papers in Supplementary Volume

1. Conceptual Structured Browsing: Applications for Information Retrieval, Document Summarization and Meta-search Engine Design
   Ali Jaoua, Invited Lecture
2. A quality-aware theme fusion for spatial information
   Robert Jeansoulin, Trung Pham, Viet Phan
3. An FCA Tool for Integrating Topic Map and Concept Lattices: Extending Application Interoperability on the Semantic Web
   Wei-Ching Lim, Chien-Sing Lee
4. Attribute Exploration of Discrete Temporal Transitions
   Johannes Wollbold
5. Basic Notions in Temporal Conceptual Semantic Systems
   Karl Erich Wolff
6. Clustering-based Reduction Algorithm on the structure of Fuzzy Concept Lattices
   Wen Zhou, Zongtian Liu, Yan Zhao, Zhipeng Xie
7. Knowledge base topology preservation with self-organizing maps and concept lattice
   Algirdas Laukaitis
8. On the Joint Use of Two Implicational Basis
   Karell Bertet, Stépahnie Guillas, Jean-Marc Ogier
9. On the Parallel Computation of the Duquenne-Guigues Implication Basis
   Jean François Djoufak Kengue, Petko Valtchev, Clémentin Tayou Djamégni