Formal Concept Analysis

16th International Conference, Icfca 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings

By: Agnes Braud (Editor), Tom Hanika (Editor), Florence Le Ber (Editor), Aleksey Buzmakov (Editor)

Write A Review

Paperback | 2 June 2021

At a Glance

Paperback
308 Pages

Dimensions(cm)
23.5 x 15.5 x 1.65

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

Representing partition lattices through FCA.- Fixed-Point Semantics for Barebone Relational Concept Analysis.- Boolean Substructures in Formal Concept Analysis.- Enumerating Maximal Consistent Closed Sets in Closure Systems.- A new Kind of Implication to Reason with Unknown Information.- Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis.- Approximate Computation of Exact Association Rules.- An Incremental Recomputation of From-Below Boolean Matrix Factorization.- Clustering and Identification of Core Implications for Grouping Objects.- Extracting Relations in Texts with Concepts of Neighbours.- Triadic Exploration and Exploration with Multiple Experts.- Towards Interactive Transition from AOC Poset to Concept Lattice.- Visualization of Statistical Information in Concept Lattice Diagrams.- Force-Directed Layout of Order Diagrams Using Dimensional Reduction.- Sandwich: an Algorithm for Discovering Relevant Link Keys in an LKPS Concept Lattice.- Decision Concept Lattice vs Decision Trees and Random Forests.- Exploring Scale-Measures of Data Sets.- Filters, Ideals and Congruence on Double Boolean Algebras.- Diagrammatic Representations of Conceptual Structures.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.