E-Books durchsuchen

Functional Dependencies with Predicates: What Makes the <italic>g</italic>3-error Easy to Compute?

Squared Symmetric Formal Contexts and Their Connections with Correlation Matrices

Aggregation Functions and Extent Structure Preservation in Formal Concept Analysis

On Pseudointents in Fuzzy Formal Concept Analysis

Maximal Ordinal Two-Factorizations

A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions

Formal Concept Analysis for Trace Clustering in Process Mining

Summarization of Massive RDF Graphs Using Identifier Classification

Towards a Flexible and Scalable Data Stream Algorithm in FCA

Postmodern Human-Machine Dialogues: Pedagogical Inquiry Experiments

Conceptual Modelling with Euler<inline-formula><alternatives><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mrow></mrow><mo>+</mo></msup></math><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^+$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula> Diagrams

Automatic Textual Explanations of Concept Lattices

Ontology Population from French Classified Ads

Graph Extraction for Assisting Crash Simulation Data Analysis

Factorization of Formal Contexts from Modal Operators

Towards Confirmation Measures to Mixed Attribute Implications

Concept Lattices as a Reduction Tool for Fuzzy Relation Equations

Analysis of Slovak Court Decisions by Formal Concept Analysis and Machine Learning Methods

Correction to: A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions