Constitutes the refereed proceedings of the 5th International Conference on Formal Concept Analysis, ICFCA 2007, held in Clermont-Ferrand, France in February 2007. This title presents 19 revised full papers together with 1 invited lecture that were reviewed and selected for inclusion.

Relational Galois Connections.- Semantology as Basis for Conceptual Knowledge Processing.- A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets.- A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data.- Computing Intensions of Digital Library Collections.- Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis.- The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.- A Parameterized Algorithm for Exploring Concept Lattices.- About the Lossless Reduction of the Minimal Generator Family of a Context.- Some Notes on Pseudo-closed Sets.- Performances of Galois Sub-hierarchy-building Algorithms.- Galois Connections Between Semimodules and Applications in Data Mining.- On Multi-adjoint Concept Lattices: Definition and Representation Theorem.- Base Points, Non-unit Implications, and Convex Geometries.- Lattices of Relatively Axiomatizable Classes.- A Solution of the Word Problem for Free Double Boolean Algebras.- On the MacNeille Completion of Weakly Dicomplemented Lattices.- Polynomial Embeddings and Representations.- The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices.- Bipartite Ferrers-Graphs and Planar Concept Lattices.