Formal Concept Analysis

Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings

AvBernhard Ganter,Robert Godin

Häftad, Engelska, 2005

Del i serien Lecture Notes in Computer Science

551 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the Third International Conference on Formal Concept Analysis, ICFCA 2005, held in Lens, France in February 2005.The 28 revised full papers presented together with an invited paper were carefully reviewed and selected for inclusion in the book. The papers reflect both progress in the foundational theory of formal concept analysis and its practical applications; algorithmic aspects are discussed as well as efforts to broaden the field.

Produktinformation

Utgivningsdatum:2005-02-07
Mått:155 x 235 x 24 mm
Vikt:657 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:419
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540245254

Utforska kategorier

Informationsteknik: allmänt inom Data och IT

Innehållsförteckning

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?.