Formal Concept Analysis
Editat de Bernhard Ganter, Robert Godinen Limba Engleză Paperback – 7 feb 2005
Preț: 329.14 lei
Preț vechi: 411.42 lei
-20%
Puncte Express: 494
Carte tipărită la comandă
Livrare economică 11-25 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540245254
ISBN-10: 3540245251
Pagini: 436
Ilustrații: XI, 419 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540245251
Pagini: 436
Ilustrații: XI, 419 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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?.