Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004. Proceedings

Rudolf Wille (auth.), Peter Eklund (eds.)3540210431, 9783540210436, 9783540246510

This volume contains the Proceedings of ICFCA 2004, the 2nd 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 emerged in the 1980s from e?orts to restructure lattice theory to promote better communication between lattice theorists and potentialusersoflatticetheory.Sincethen,the?eldhasdevelopedintoagrowing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including data visualization, information retrieval, machine learning, data analysis and knowledge management. In terms of theory, formal concept analysis has been extended into attribute exploration, Boolean judgment, contextual logic and so on to create a powerful general framework for knowledge representation and reasoning. This conference aims to unify theoretical and applied practitioners who use formal concept an- ysis, drawing on the ?elds of mathematics, computer and library sciences and software engineering. The theme of the 2004 conference was ‘Concept Lattices” to acknowledge the colloquial term used for the line diagrams that appear in almost every paper in this volume. ICFCA 2004 included tutorial sessions, demonstrating the practical bene?ts of formal concept analysis, and highlighted developments in the foundational theory and standards. The conference showcased the increasing variety of formal concept analysis software and included eight invited lectures from distinguished speakersinthe?eld.Sevenoftheeightinvitedspeakerssubmittedaccompanying papers and these were reviewed and appear in this volume.

---

Table of contents :
Front Matter….Pages –
Preconcept Algebras and Generalized Double Boolean Algebras….Pages 1-13
Protoconcept Graphs: The Lattice of Conceptual Contents….Pages 14-27
Signs and Formal Concepts….Pages 28-38
A Mathematical Model for TOSCANA-Systems: Conceptual Data Systems….Pages 39-46
BLID: An Application of Logical Information Systems to Bioinformatics….Pages 47-54
Formal Concept Analysis: Its Role in Teaching Lattice Theory….Pages 55-56
Concept Lattices for Information Visualization: Can Novices Read Line-Diagrams?….Pages 57-73
Browsing Search Results via Formal Concept Analysis: Automatic Selection of Attributes….Pages 74-87
Formal Concept Analysis and Semantic File Systems….Pages 88-95
Numerical Analysis in Conceptual Systems with ToscanaJ ….Pages 96-103
Tool Support for FCA….Pages 104-111
Automated Lattice Drawing….Pages 112-127
Congruences of Finite Distributive Concept Algebras….Pages 128-141
When Is a Concept Algebra Boolean?….Pages 142-155
Background Knowledge in Concept Graphs….Pages 156-171
Agreement Contexts in Formal Concept Analysis….Pages 172-179
Towards a Conceptual Theory of Indistinguishable Objects….Pages 180-188
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies….Pages 189-207
A First Step towards Protoconcept Exploration….Pages 208-221
Geometry of Data Tables….Pages 222-235
Concept Extensions and Weak Clusters Associated with Multiway Dissimilarity Measures….Pages 236-243
Unlocking the Semantics of Roget’s Thesaurus Using Formal Concept Analysis….Pages 244-251
FCA in Knowledge Technologies: Experiences and Opportunities….Pages 252-260
Applying Formal Concept Analysis to Description Logics….Pages 261-286
Machine Learning and Formal Concept Analysis….Pages 287-312
A Comparative Study of FCA-Based Supervised Classification Algorithms….Pages 313-320
Modelling Tacit Knowledge via Questionnaire Data….Pages 321-328
Predicate Invention and the Revision of First-Order Concept Lattices….Pages 329-336
The Power of Peircean Algebraic Logic (PAL)….Pages 337-351
Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges….Pages 352-371
AddIntent: A New Incremental Algorithm for Constructing Concept Lattices….Pages 372-385
QuDA: Applying Formal Concept Analysis in a Data Mining Environment….Pages 386-393
A Parallel Algorithm to Generate Formal Concepts for Large Data….Pages 394-401
Using Concept Lattices for Requirements Reconciliation….Pages 402-409
Back Matter….Pages –