|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Bernhard Ganter , Robert GodinPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2005 ed. Volume: 3403 Dimensions: Width: 15.50cm , Height: 2.20cm , Length: 23.50cm Weight: 1.340kg ISBN: 9783540245254ISBN 10: 3540245251 Pages: 419 Publication Date: 07 February 2005 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsTowards 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?.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |