1 option
Formal Concept Analysis : 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 - July 2, 2021, Proceedings / edited by Agnès Braud, Aleksey Buzmakov, Tom Hanika, Florence Le Ber.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 12733
- Lecture Notes in Artificial Intelligence ; 12733
- Language:
- English
- Subjects (All):
- Artificial intelligence.
- Data mining.
- Database management.
- Computer science.
- Application software.
- Computer science-Mathematics.
- Artificial Intelligence.
- Data Mining and Knowledge Discovery.
- Database Management System.
- Theory of Computation.
- Computer and Information Systems Applications.
- Mathematics of Computing.
- Local Subjects:
- Artificial Intelligence.
- Data Mining and Knowledge Discovery.
- Database Management System.
- Theory of Computation.
- Computer and Information Systems Applications.
- Mathematics of Computing.
- Physical Description:
- 1 online resource (XVI, 291 pages) : 70 illustrations, 35 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021. The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length. The research part of this volume is divided in five different sections. First, "Theory" contains compiled works that discuss advances on theoretical aspects of FCA. Second, the section "Rules" consists of contributions devoted to implications and association rules. The third section "Methods and Applications" is composed of results that are concerned with new algorithms and their applications. "Exploration and Visualization" introduces different approaches to data exploration.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-77867-5
- 9783030778675
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.