Formal concept analysis: from knowledge discovery to knowledge processing
In this chapter, we introduce Formal Concept Analysis (FCA) and some of its extensions.
FCA is a formalism based on lattice theory aimed at data analysis and knowledge …
FCA is a formalism based on lattice theory aimed at data analysis and knowledge …
Survey and open problems in privacy-preserving knowledge graph: merging, query, representation, completion, and applications
Abstract Knowledge Graph (KG) has attracted more and more companies' attention for its
ability to connect different types of data in meaningful ways and support rich data services …
ability to connect different types of data in meaningful ways and support rich data services …
Pattern structures and concept lattices for data mining and knowledge processing
This article aims at presenting recent advances in Formal Concept Analysis (2010-2015),
especially when the question is dealing with complex data (numbers, graphs, sequences …
especially when the question is dealing with complex data (numbers, graphs, sequences …
Anytime subgroup discovery in numerical domains with guarantees
Subgroup discovery is the task of discovering patterns that accurately discriminate a class
label from the others. Existing approaches can uncover such patterns either through an …
label from the others. Existing approaches can uncover such patterns either through an …
On pattern setups and pattern multistructures
Order and lattice theory provides convenient mathematical tools for pattern mining, in
particular for condensed irredundant representations of pattern spaces and their efficient …
particular for condensed irredundant representations of pattern spaces and their efficient …
[PDF][PDF] Pattern Structures and Their Morphisms.
L Lumpe, SE Schmidt - CLA, 2015 - ceur-ws.org
Projections of pattern structures don't always lead to pattern structures, however residual
projections and o-projections do. As a unifying approach, we introduce the notion of pattern …
projections and o-projections do. As a unifying approach, we introduce the notion of pattern …
Sofia: how to make FCA polynomial?
In pattern mining, one of the most important problems is fighting exponential explosion of the
set of patterns. A typical solution is generating only a part of all patterns satisfying some …
set of patterns. A typical solution is generating only a part of all patterns satisfying some …
[PDF][PDF] A Link between Pattern Structures and Random Forests.
T Krause, L Lumpe, SE Schmidt - CLA, 2020 - ceur-ws.org
CLA 2020, Proceedings of the Fifteenth International Conference on Concept Lattices and
Their Applications Page 1 A Link between Pattern Structures and Random Forests Tilo …
Their Applications Page 1 A Link between Pattern Structures and Random Forests Tilo …
Document Classification via Stable Graph Patterns and Conceptual AMR Graphs
This paper proposes an approach and an associated system based on pattern structures,
aimed at the classification of documents represented as graphs. The representation of …
aimed at the classification of documents represented as graphs. The representation of …
Gradual discovery with closure structure of a concept lattice
An approximate discovery of closed itemsets is usually based on either setting a frequency
threshold or computing a sequence of projections. Both approaches, being incremental, do …
threshold or computing a sequence of projections. Both approaches, being incremental, do …