ICFCA 2007:
Clermont-Ferrand,
France
Sergei O. Kuznetsov, Stefan Schmidt (Eds.):
Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings.
Lecture Notes in Computer Science 4390 Springer 2007, ISBN 3-540-70828-6 BibTeX
- Bernhard Ganter:
Relational Galois Connections.
1-17
Electronic Edition (link) BibTeX
- Peter W. Eklund, Rudolf Wille:
Semantology as Basis for Conceptual Knowledge Processing.
18-38
Electronic Edition (link) BibTeX
- Marie Agier, Jean-Marc Petit:
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets.
39-50
Electronic Edition (link) BibTeX
- Mohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev:
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data.
51-65
Electronic Edition (link) BibTeX
- Carlo Meghini, Nicolas Spyratos:
Computing Intensions of Digital Library Collections.
66-81
Electronic Edition (link) BibTeX
- Ben Martin, Peter W. Eklund:
Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis.
82-97
Electronic Edition (link) BibTeX
- Sébastien Ferré:
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.
98-113
Electronic Edition (link) BibTeX
- Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé:
A Parameterized Algorithm for Exploring Concept Lattices.
114-129
Electronic Edition (link) BibTeX
- Tarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo:
About the Lossless Reduction of the Minimal Generator Family of a Context.
130-150
Electronic Edition (link) BibTeX
- Sebastian Rudolph:
Some Notes on Pseudo-closed Sets.
151-165
Electronic Edition (link) BibTeX
- Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret:
Performances of Galois Sub-hierarchy-building Algorithms.
166-180
Electronic Edition (link) BibTeX
- Francisco J. Valverde-Albacete, Carmen Peláez-Moreno:
Galois Connections Between Semimodules and Applications in Data Mining.
181-196
Electronic Edition (link) BibTeX
- Jesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño:
On Multi-adjoint Concept Lattices: Definition and Representation Theorem.
197-209
Electronic Edition (link) BibTeX
- Bernhard Ganter, Heiko Reppe:
Base Points, Non-unit Implications, and Convex Geometries.
210-220
Electronic Edition (link) BibTeX
- Dmitry E. Pal'chunov:
Lattices of Relatively Axiomatizable Classes.
221-239
Electronic Edition (link) BibTeX
- Björn Vormbrock:
A Solution of the Word Problem for Free Double Boolean Algebras.
240-270
Electronic Edition (link) BibTeX
- Léonard Kwuida, Branimir Seselja, Andreja Tepavcevic:
On the MacNeille Completion of Weakly Dicomplemented Lattices.
271-280
Electronic Edition (link) BibTeX
- Tim Becker:
Polynomial Embeddings and Representations.
281-302
Electronic Edition (link) BibTeX
- Rudolf Wille:
The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices.
303-312
Electronic Edition (link) BibTeX
- Christian Zschalig:
Bipartite Ferrers-Graphs and Planar Concept Lattices.
313-327
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:19:36 2009
by Michael Ley (ley@uni-trier.de)