000 05951nam a22006255i 4500
001 978-3-540-32262-7
003 DE-He213
005 20240730185416.0
007 cr nn 008mamaa
008 101221s2005 gw | s |||| 0|eng d
020 _a9783540322627
_9978-3-540-32262-7
024 7 _a10.1007/b105806
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aFormal Concept Analysis
_h[electronic resource] :
_bThird International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings /
_cedited by Bernhard Ganter, Robert Godin.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXI, 419 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3403
505 0 _aTowards 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?.
520 _aThis 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.
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aMachine theory.
_9139187
650 0 _aSoftware engineering.
_94138
650 0 _aInformation storage and retrieval systems.
_922213
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aFormal Languages and Automata Theory.
_9139188
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aInformation Storage and Retrieval.
_923927
700 1 _aGanter, Bernhard.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9139189
700 1 _aGodin, Robert.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9139190
710 2 _aSpringerLink (Online service)
_9139191
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540245254
776 0 8 _iPrinted edition:
_z9783540807575
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3403
_9139192
856 4 0 _uhttps://doi.org/10.1007/b105806
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92807
_d92807