Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005. Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 3403 : Lecture Notes in Artificial Intelligence

ISBN: 3540245251, 9783540245254

Size: 9 MB (9838270 bytes)

Pages: 419/427

File format:

Language:

Publishing Year:

Category: Tags: , , , ,

Mohammed J. Zaki, Nagender Parimi, Nilanjana De, Feng Gao (auth.), Bernhard Ganter, Robert Godin (eds.)3540245251, 9783540245254

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

Table of contents :
Front Matter….Pages –
Towards Generic Pattern Mining….Pages 1-20
Conceptual Exploration of Semantic Mirrors….Pages 21-32
Towards a Formal Concept Analysis Approach to Exploring Communities on the World Wide Web….Pages 33-48
Automatic Selection of Noun Phrases as Document Descriptors in an FCA-Based Information Retrieval System….Pages 49-63
Combining Spatial and Lattice-Based Information Landscapes….Pages 64-78
Explaining the Structure of FrameNet with Concept Lattices….Pages 79-94
Lessons Learned in Applying Formal Concept Analysis to Reverse Engineering….Pages 95-112
Navigation Spaces for the Conceptual Analysis of Software Structure….Pages 113-128
Restructuring Help Systems Using Formal Concept Analysis….Pages 129-144
An Application of FCA to the Analysis of Aeronautical Incidents….Pages 145-161
Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis….Pages 162-175
Formal Concept Analysis Constrained by Attribute-Dependency Formulas….Pages 176-191
On Computing the Minimal Generator Family for Concept Lattices and Icebergs….Pages 192-207
Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice….Pages 208-222
A Generic Algorithm for Generating Closed Sets of a Binary Relation….Pages 223-234
Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases….Pages 235-248
A Parallel Algorithm for Lattice Construction….Pages 249-264
Using Intermediate Representation Systems to Interact with Concept Lattices….Pages 265-268
Crisply Generated Fuzzy Concepts….Pages 269-284
Triadic Concept Graphs and Their Conceptual Contents….Pages 285-298
Alpha Galois Lattices: An Overview….Pages 299-314
A Finite State Model for On-Line Analytical Processing in Triadic Contexts….Pages 315-328
Complete Subalgebras of Semiconcept Algebras and Protoconcept Algebras….Pages 329-343
Coherence Networks of Concept Lattices: The Basic Theorem….Pages 344-359
Turing Machine Representation in Temporal Concept Analysis….Pages 360-374
Protoconceptual Contents and Implications….Pages 375-390
Planarity of Lattices….Pages 391-402
Bialgebraic Contexts for Distributive Lattices – Revisited….Pages 403-407
Which Concept Lattices Are Pseudocomplemented?….Pages 408-416
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005. Proceedings”
Shopping Cart
Scroll to Top