Springer, Dordrecht


340 Pages

ISBN 978-3-642-11927-9

Lecture Notes in Computer Science
vol. 5986

Formal concept analysis

8th international conference, ICFCA 2010, Agadir, Morocco, march 15-18, 2010

Edited by

Lonard Kwuida, Bar Sertkaya

This volume contains selected papers presented at ICFCA 2010, the 8th Int- national Conference on Formal Concept Analysis. The ICFCA conference series aims to be the prime forum for dissemination of advances in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. Formal Concept Analysis (FCA) is a ?eld of applied mathematics with its mathematical root in order theory, in particular the theory of complete lattices. Researchershadlongbeenawareofthefactthatthese?eldshavemanypotential applications.FCAemergedinthe1980sfrome?ortstorestructurelattice theory to promote bettercommunication between lattice theorists and potential users of lattice theory. The key theme was the mathematical formalization of c- cept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical community and an - creasingnumberofapplicationsindataandknowledgeprocessingincludingdata visualization, information retrieval, machine learning, sofware engineering, data analysis, data mining in Web 2.0, analysis of social networks, concept graphs, contextual logic and description logics. ICFCA 2010 took place during March 15–18, 2010 in Agadir, Morocco. We received 37 high-quality submissions out of which 17 were chosen as regular papers in these proceedings after a competitive selection process. Less mature works that were still considered valuable for discussion at the conference were collected in the supplementary proceedings. The papers in the present volume coveradvancesinvariousaspectsofFCArangingfromitstheoreticalfoundations to its applications in numerous other ?elds. In addition to the regular papers, thisvolumealsocontainsfourkeynotepapersarisingfromtheseveninvitedtalks given at the conference. We are also delighted to include a reprint of Bernhard Ganter’sseminalpaper on hiswell-knownalgorithmfor enumerating closedsets.

Publication details

Full citation:

Kwuida, L. , Sertkaya, B. (eds) (2010). Formal concept analysis: 8th international conference, ICFCA 2010, Agadir, Morocco, march 15-18, 2010, Springer, Dordrecht.

Table of Contents

About the enumeration algorithms of closed sets

Gély Alain; Medina Raoul; Nourine Lhouari


Open Access Link
Counting of moore families for n=7

Colomb Pierre; Irlande Alexis; Raynaud Olivier


Open Access Link
Lattice drawings and morphisms

Duquenne Vincent


Open Access Link
Approximations in concept lattices

Meschke Christian


Open Access Link
On links between concept lattices and related complexity problems

Babin Mikhail A.; Kuznetsov Sergei O.


Open Access Link
An algorithm for extracting rare concepts with concise intents

Okubo Yoshiaki; Haraguchi Makoto


Open Access Link
Conditional functional dependencies

Medina Raoul; Nourine Lhouari


Open Access Link
Constrained closed datacubes

Nedjar Sébastien; Casali Alain; Cicchetti Rosine; Lakhal Lotfi


Open Access Link
On categorial grammars as logical information systems

Foret Annie; Ferré Sébastien


Open Access Link
Describing role models in terms of formal concept analysis

Mühle Henri; Wende Christian


Open Access Link
Concept analysis as a framework for mining functional features from legacy code

El Kharraz Amal; Valtchev Petko; Mili Hafedh


Open Access Link

This document is unfortunately not available for download at the moment.