Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings
Springer Science & Business Media, Feb 7, 2005 - Computers - 416 pages
This volume contains the Proceedings of ICFCA 2005, the 3rd International Conference on Formal Concept Analysis. The ICFCA conference series aims to be the premier forum for the publication of advances in applied lattice and order theory, and in particular scienti?c advances related to formal concept analysis. Formal concept analysis is a ?eld of applied mathematics with its mat- matical root in order theory, in particular in the theory of complete lattices. Researchers had long been aware of the fact that these ?elds have many - tential applications. Formal concept analysis emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice theory. The key theme was the mathe- tization of concept and conceptual hierarchy. Since then, the ?eld has developed into a growing research area in its own right with a thriving theoretical com- nity and an increasing number of applications in data and knowledge processing, including data visualization, information retrieval, machine learning, data an- ysis and knowledge management. ICFCA2005re?ectedbothpracticalbene?tsandprogressinthefoundational theory of formal concept analysis. Algorithmic aspects were discussed as well as e?orts to broaden the ?eld. All regular papers appearing in this volume were refereed by at least two, in most cases three independent reviewers. The ?nal decision to accept the papers was arbitrated by the Program Chairs based on the referee reports. It was the involvement of the Program Committee and the Editorial Board that ensured the scienti?c quality of these proceedings.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
AD-formulas algorithm Alpha Galois lattice applied approach assembly block atomic basic classes Basic Theorem binary relation Boolean algebra called closed sets closure operator closure system coherence network complete lattices complete subalgebra Computer concept graphs concept lattice conceptual contents Conceptual Structures consider contains corresponding crisply CTSOT DAC-ParaLaX Data Mining database defined Deﬁnition denote DMTL document engine equivalence class example explanation files extent Formal Concept Analysis frame elements FrameNet function Galois connection Ganter help system hierarchy hypernym iceberg ICFCA implications input isomorphic itemsets left-relation Lemma LNAI mapping maxmod mingen multicontext multivalued dependencies navigation space nodes notion object obtain paper partition pattern power context family Proof properties Proposition protoconcept protoconceptual content pseudocomplemented query retrieval Springer step subalgebra generating pair subset t-images temporal Turing machine triadic context tuples Turing machine