Formal Concept Analysis Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005. Proceedings /

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

 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. 

 Towards Generic Pattern Mining -- Conceptual Exploration of Semantic Mirrors -- Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web -- Automatic Selection of Noun Phrases as Document Descriptors in an FCA-Based Information Retrieval System -- Combining Spatial and Lattice-Based Information Landscapes -- Explaining the Structure of FrameNet with Concept Lattices -- Lessons Learned in Applying Formal Concept Analysis to Reverse Engineering -- Navigation Spaces for the Conceptual Analysis of Software Structure -- Restructuring Help Systems Using Formal Concept Analysis -- An Application of FCA to the Analysis of Aeronautical Incidents -- Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis -- Formal Concept Analysis Constrained by Attribute-Dependency Formulas -- On Computing the Minimal Generator Family for Concept Lattices and Icebergs -- Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice -- A Generic Algorithm for Generating Closed Sets of a Binary Relation -- Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases -- A Parallel Algorithm for Lattice Construction -- Using Intermediate Representation Systems to Interact with Concept Lattices -- Crisply Generated Fuzzy Concepts -- Triadic Concept Graphs and Their Conceptual Contents -- Alpha Galois Lattices: An Overview -- A Finite State Model for On-Line Analytical Processing in Triadic Contexts -- Complete Subalgebras of Semiconcept Algebras and Protoconcept Algebras -- Coherence Networks of Concept Lattices: The Basic Theorem -- Turing Machine Representation in Temporal Concept Analysis -- Protoconceptual Contents and Implications -- Planarity of Lattices -- Bialgebraic Contexts for Distributive Lattices – Revisited -- Which Concept Lattices Are Pseudocomplemented?.