rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Formal Concept Analysis
    sub title: 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006. Proceedings
  name:
    name part: Missaoui, Rokia.
    role:
      role term: editor.
  name:
    name part: Schmidt, Jürg.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2006
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: X, 314 p. online resource.
  table of contents: Invited Lectures -- Methods of Conceptual Knowledge Processing -- An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms -- Attribute Implications in a Fuzzy Setting -- The Assessment of Knowledge, in Theory and in Practice -- Regular Papers -- The Basic Theorem on Preconcept Lattices -- The Tensor Product as a Lattice of Regular Galois Connections -- Two Instances of Peirce’s Reduction Thesis -- Very Fast Instances for Concept Generation -- Negation, Opposition, and Possibility in Logical Concept Analysis -- A Note on Negation: A PCS-Completion of Semilattices -- Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes -- Interactive Association Rules Discovery -- About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base -- Spatial Indexing for Scalability in FCA -- Homograph Disambiguation Using Formal Concept Analysis -- Using Concept Lattices to Uncover Causal Dependencies in Software -- An FCA Interpretation of Relation Algebra -- Spring-Based Lattice Drawing Highlighting Conceptual Similarity -- Characterizing Planar Lattices Using Left-Relations -- Automated Layout of Small Lattices Using Layer Diagrams -- Counting Pseudo-intents and #P-completeness.
  note: edited by Rokia Missaoui, Jürg Schmidt.
  subject:
    topic: Computer science
  subject:
    topic: Software engineering
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Information storage and retrieval
  subject:
    topic: Artificial intelligence
  subject:
    topic: Algebra
  subject:
    topic: Ordered algebraic structures
  subject:
    topic: Computer Science
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Mathematical Logic and Formal Languages
  subject:
    topic: Software Engineering
  subject:
    topic: Information Storage and Retrieval
  subject:
    topic: Order, Lattices, Ordered Algebraic Structures
  classification: Q334-342
  classification: TJ210.2-211.495
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 3874
  identifier: 9783540322047
  identifier: http://dx.doi.org/10.1007/11671404
  record info:
    record creation date: 100419
    record change date: 20151123194721.0
    record identifier: 978-3-540-32204-7