Formal Concept Analysis: 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010, Procedings (Lecture Notes in Computer Science) (Lecture Notes in Computer Science (5986))

Springer, 2010-02-18. Paperback. Like New. 2010 Springer (Berlin, Germany), 6 x 9 1/4 inches tall trade paperback, illustrated with drawings, tables and graphs, xii, 341 pp. A near fine copy - clean, bright and unmarked, apparently unopened. ~SP16~ [2.0P] Papers presented at the 2010 ICFCA conference, which aims to be the prime forum for dissemination of advances in applied lattice and order theory, and in particular advances in theory and applications of Formal Concept Analysis. Contents: About the Enumeration Algorithms of Closed Sets.- Mathematics Presenting, Reflecting, Judging.- The Role of Concept, Context, and Component for Dependable Software Development.- Statistical Methods for Data Mining and Knowledge Discovery.- Regular Contributions.- Formal Concept Analysis of Two-Dimensional Convex Continuum Structures.- Counting of Moore Families for n=7.- Lattice Drawings and Morphisms.- Approximations in Concept Lattices.- Hardness of Enumerating Pseudo-intents in the Lectic Order.- On Links between Concept Lattices and Related Complexity Problems.- An Algorithm for Extracting Rare Concepts with Concise Intents.- Conditional Functional Dependencies: An FCA Point of View.- Constrained Closed Datacubes.- Conceptual Navigation in RDF Graphs with SPARQL-Like Queries.- An Approach to Exploring Description Logic Knowledge Bases.- On Categorial Grammars as Logical Information Systems.- Describing Role Models in Terms of Formal Concept Analysis.- Approaches to the Selection of Relevant Concepts in the Case of Noisy Data.- Concept Analysis as a Framework for Mining Functional Features from Legacy Code.- Concept Neighbourhoods in Lexical Databases.- A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing.- History.- Two Basic Algorithms in Concept Analysis.