Formal Concept Analysis 14th International Conference, ICFCA 2017, Rennes, France, June 13-16, 2017, Proceedings
This book constitutes the proceedings of the 14th International Conference on Formal Concept Analysis, ICFCA 2017, held in Rennes, France, in June 2017. The 13 full papers presented in this volume were carefully reviewed and selected from 37 submissions. The book also contains an invited contributio...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book Conference Proceeding |
| Language | English |
| Published |
Cham
Springer Nature
2017
Springer Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3319592718 9783319592718 331959270X 9783319592701 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-319-59271-8 |
Cover
Table of Contents:
- 4.2 Habitual Attractors -- 4.3 Critical Attractors -- 5 Discussion: Students Life Tracks -- 6 Example: Formalizing the Life Track of a Student -- 7 Conclusions and Further Research -- References -- Hierarchies of Weighted Closed Partially-Ordered Patterns for Enhancing Sequential Data Analysis -- 1 Introduction -- 2 Preliminaries -- 2.1 Sequences, Sequential Patterns and PO-Patterns -- 2.2 FCA and RCA -- 3 Relational Analysis of Sequential Data -- 3.1 Running Example -- 3.2 Preprocessing Qualitative Sequential Data -- 3.3 Exploring Qualitative Sequential Data Using RCA -- 4 Extracting WCPO-Patterns from the RCA Result -- 4.1 From Uniform Vertices to Weighted Vertices -- 4.2 Application to the Running Example -- 5 Enhancing Sequential Data Analysis Using WCPO-Patterns -- 5.1 Practical Case: Ranking CPO-Pattern Vertices and Paths -- 5.2 Practical Case: Selecting Interesting Navigation Paths in CPO-Pattern Hierarchies -- 5.3 Practical Case: Distinguishing the Best Represented Sub-Dataset by a CPO-Pattern -- 6 Related Work -- 7 Conclusion -- References -- First Notes on Maximum Entropy Entailment for Quantified Implications -- 1 Introduction -- 2 Formal Concept Analysis -- 3 Quantified Implication Sets -- 4 Maximum Entropy Entailment -- 5 Maximum Entropy Bases -- 6 Conclusion -- References -- Implications over Probabilistic Attributes -- 1 Introduction -- 2 Formal Concept Analysis -- 3 Probabilistic Formal Concept Analysis -- 4 Implications over Probabilistic Attributes -- 5 Probabilistic Implicational Knowledge Bases -- 5.1 Trivial Background Knowledge -- 5.2 Approximations of Probabilities -- 5.3 The Probabilistic Scaling -- 5.4 Construction of the Probabilistic Implicational Knowledge Base -- 6 Conclusion -- References -- On Overfitting of Classifiers Making a Lattice -- 1 Introduction -- 2 Formal Concept Analysis -- 3 The Probability of Overfitting
- 4 The Overfitting Probability of the Lattice of Classifiers -- 5 Experiments -- 6 Conclusion -- References -- Learning Thresholds in Formal Concept Analysis -- 1 Introduction -- 2 The Notion of `Formal Concept' is a Learning Threshold -- 3 A Semiotic Analysis of Further FCA Learning Thresholds -- 3.1 Reading Line Diagrams of Partially Ordered Sets -- 3.2 Understanding Concept Lattices -- 4 Conclusion -- References -- The Linear Algebra in Extended Formal Concept Analysis Over Idempotent Semifields -- 1 Introduction -- 2 Galois Connections Over Idempotent Semifields -- 2.1 Idempotent Semirings, Semifields and Semimodules -- 2.2 K-Formal Concept Analysis Basics -- 3 Extended FCA in Complete Idempotent Semifields -- 3.1 The Neighbourhood of Objects -- 3.2 The Neighbourhood of Attributes -- 3.3 The Lattice of Alterity -- 3.4 The Four-Fold Connection -- 4 Discussion -- References -- Distributed and Parallel Computation of the Canonical Direct Basis -- 1 Introduction -- 2 Structural Framework -- 2.1 Lattices and Formal Concept Analysis -- 2.2 Association Rules and Bases -- 3 Main Contribution -- 3.1 Dual Transversal -- 3.2 Computing the CDB with Minimal Dual Transversals -- 3.3 Example -- 4 Conclusion -- References -- Author Index
- Intro -- Preface -- Organization -- Invited Talks -- Analogy Between Concepts -- Facilitating Exploration of Knowledge Graphs Through Flexible Queries and Knowledge Anchors -- Patterns, Sets of Patterns, and Pattern Compositions -- Semantic Web: Big Data, Some Knowledge and a Bit of Reasoning -- Contents -- Invited Contribution -- An Invitation to Knowledge Space Theory -- 1 Introduction -- 2 Knowledge States and Formal Concepts -- 3 Prerequisites and Implications -- 4 A Quasi-Ordinal Example -- 5 Probabilistic Knowledge Structures -- 6 Competence-Based Knowledge Space Theory -- 7 The Disjunctive Skill Model -- 8 Skills First -- 9 Conclusions and Outlook -- References -- Historical Paper -- Implications and Dependencies Between Attributes -- 1 Introduction -- 2 Implications Between Single-Valued Attributes -- 3 Concept Lattices as Structures of Attribute Implications -- 4 Dependencies Between Many-Values Attributes -- References -- Regular Contributions -- The Implication Logic of (n,k)-Extremal Lattices -- 1 Motivation and Objectives -- 2 A Logical Perspective -- 2.1 Basic Definitions -- 2.2 Fundamental Results -- 2.3 An Explicit Description of an Extremal Lattice with Many Meet-Irreducibles -- 3 A Characteristic Construction of Extremal Sets of Implications -- 3.1 Construction of a Larger Extremal Set Through Smaller Ones -- 3.2 Being the Union of a Multi-lift is Characteristic -- 4 Canonical Bases of Extremal Lattices -- 4.1 Basic Definitions and Results -- 4.2 The Structure of Canonical Bases of Extremal Lattices -- References -- Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms -- 1 Introduction -- 2 Recap of the In-Close2 Algorithm -- 3 Recap of the FCbO Algorithm -- 4 New Algorithm, In-Close4a: Skipping Attributes with Inherited Empty Intersections
- 5 New Algorithm, In-Close4b: Forgoing the Canonicity Test After Empty Intersections -- 6 Optimisation -- 7 Evaluation of Performance -- 8 Conclusions -- References -- On the Usability of Probably Approximately Correct Implication Bases -- 1 Introduction -- 2 Related Work -- 3 Probably Approximately Correct Bases via Query Learning -- 3.1 Bases of Implications -- 3.2 Probably Approximately Correct Implication Bases -- 3.3 How to Compute Probably Approximately Correct Bases -- 4 Usability -- 4.1 Practical Quality of Approximation -- 4.2 A Small Case-Study -- 5 Summary and Outlook -- References -- FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression -- 1 Introduction: Graph Compression for Graph Visualization -- 1.1 Graph Compression -- 1.2 Power Graph -- 2 Power Graph as a Formal Concept Search -- 2.1 Motifs as Formal Concepts -- 2.2 Heuristics Modeling -- 2.3 Exploitation of the Graph Context to Reduce the Search Space -- 3 PowerGrASP, Graph Compression Based on FCA -- 3.1 Looking for a Formal Concept and for Graph Motifs -- 3.2 Implementing Concept Scoring -- 3.3 Implementing the Stable Search and Heuristics -- 4 Biological Benchmarks -- 5 Discussion and Conclusion -- References -- A Proposition for Sequence Mining Using Pattern Structures -- 1 Introduction -- 2 Formalization -- 3 The Pattern Structure of Sequences -- 4 Implementing the Similarity Operator -- 4.1 Rationale -- 4.2 Calculating (1) (2) -- 4.3 Discussion -- 5 Related Work -- 6 Experiments and Discussion -- 6.1 Datasets and Experimental Setup -- 6.2 Performance Study - Comparison -- 6.3 Discussion -- 7 Conclusions -- References -- An Investigation of User Behavior in Educational Platforms Using Temporal Concept Analysis -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 Investigating User Behaviors -- 4.1 Navigational Attractors