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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Eklund, Peter (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 2961
• Θέματα: Mathematics.; Software engineering.; Mathematical logic.; Computer science > Mathematics.; Information storage and retrieval.; Artificial intelligence.; Mathematical Logic and Foundations.; Artificial Intelligence (incl. Robotics).; Software Engineering.; Mathematical Logic and Formal Languages.; Discrete Mathematics in Computer Science.; Information Storage and Retrieval.

 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. 

 Preconcept Algebras and Generalized Double Boolean Algebras -- Protoconcept Graphs: The Lattice of Conceptual Contents -- Signs and Formal Concepts -- A Mathematical Model for TOSCANA-Systems: Conceptual Data Systems -- BLID: An Application of Logical Information Systems to Bioinformatics -- Formal Concept Analysis: Its Role in Teaching Lattice Theory -- Concept Lattices for Information Visualization: Can Novices Read Line-Diagrams? -- Browsing Search Results via Formal Concept Analysis: Automatic Selection of Attributes -- Formal Concept Analysis and Semantic File Systems -- Numerical Analysis in Conceptual Systems with ToscanaJ -- Tool Support for FCA -- Automated Lattice Drawing -- Congruences of Finite Distributive Concept Algebras -- When Is a Concept Algebra Boolean? -- Background Knowledge in Concept Graphs -- Agreement Contexts in Formal Concept Analysis -- Towards a Conceptual Theory of Indistinguishable Objects -- Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies -- A First Step towards Protoconcept Exploration -- Geometry of Data Tables -- Concept Extensions and Weak Clusters Associated with Multiway Dissimilarity Measures -- Unlocking the Semantics of Roget’s Thesaurus Using Formal Concept Analysis -- FCA in Knowledge Technologies: Experiences and Opportunities -- Applying Formal Concept Analysis to Description Logics -- Machine Learning and Formal Concept Analysis -- A Comparative Study of FCA-Based Supervised Classification Algorithms -- Modelling Tacit Knowledge via Questionnaire Data -- Predicate Invention and the Revision of First-Order Concept Lattices -- The Power of Peircean Algebraic Logic (PAL) -- Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges -- AddIntent: A New Incremental Algorithm for Constructing Concept Lattices -- QuDA: Applying Formal Concept Analysis in a Data Mining Environment -- A Parallel Algorithm to Generate Formal Concepts for Large Data -- Using Concept Lattices for Requirements Reconciliation.