Revisiting Pattern Structure Projections

@article{Buzmakov2015RevisitingPS,
  title={Revisiting Pattern Structure Projections},
  author={Aleksey Buzmakov and Sergei O. Kuznetsov and Amedeo Napoli},
  journal={ArXiv},
  year={2015},
  volume={abs/1506.05018}
}
Formal concept analysis (FCA) is a well-founded method for data analysis and has many applications in data mining. Pattern structures is an extension of FCA for dealing with complex data such as sequences or graphs. However the computational complexity of computing with pattern structures is high and projections of pattern structures were introduced for simplifying computation. In this paper we introduce o-projections of pattern structures, a generalization of projections which defines a wider… 

On pattern setups and pattern multistructures

TLDR
A new model is proposed, dubbed pattern multistructures, lying between pattern setups and pattern structures, which relies on multilattices and considers some techniques, namely completions, transforming pattern setups to pattern structures using sets/antichains of patterns.

Pattern Structures and Their Morphisms

TLDR
The notion of pattern morphisms between pattern structures and a general sufficient condition for a homomorphic image of a pattern structure being again a pattern structures are introduced.

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, etc. in domains such as

Gradual Discovery with Closure Structure of a Concept Lattice

TLDR
This work proposes to generate closed item-sets incrementally, w.r.t. the size of the smallest (cardinality-minimal or minimum) generators and shows that this approach exhibits anytime property, and generates itemsets of decreasing quality.

SOFIA: How to Make FCA Polynomial?

TLDR
This paper introduces the notion of "generalized monotonicity" and Sofia algorithm that allow to generate top patterns in polynomial time modulo basic operations, e.g., measure computation, for criteria that are not monotonic.

Formal Concept Analysis: From Knowledge Discovery to Knowledge Processing

TLDR
This chapter introduces Formal Concept Analysis (FCA), a formalism based on lattice theory aimed at data analysis and knowledge processing that allows the design of so-called concept lattices from binary and complex data.

Semilattices Category and Data Representations for Algebraic Machine Learning

Category of semilattices coincides with algebras on a corresponding monad. This statement implies Cartesian-closeness of this category. It means applicability of well-known constructions of (direct)

Sampling Representation Contexts with Attribute Exploration

TLDR
This work presents a naive algorithm that computes the representation context a pattern structure, and adds a sampling technique in order to reduce the size of the output.

Contributions to Pattern Discovery and Formal Concept Analysis

TLDR
The story of this manuscript is according to three main research axes: the formalism framing the methods (Formal Concept Analysis), the methodological and algorithmic aspects related in Data mining, and finally the Knowledge Discovery “in practice” through several concrete applications encountered during collaborations with other scientists or industrial partners.

Anytime Subgroup Discovery in Numerical Domains with Guarantees

TLDR
An algorithm for mining numerical data with three key properties w.r.t. the state of the art: It yields progressively interval patterns whose quality improves over time, and always bounds a distance to the exhaustive exploration.

References

SHOWING 1-10 OF 21 REFERENCES

Pattern Structures and Their Projections

TLDR
It is shown how concepts, implications, hypotheses, and classifications in projected pattern structures are related to those in original ones.

On Projections of Sequential Pattern Structures (with an Application on Care Trajectories)

TLDR
This research work provides a new and ecient extension of FCA to deal with complex data, which can be an alternative to the analysis of sequential datasets.

Concept-Based Data Mining with Scaled Labeled Graphs

TLDR
A model of learning from positive and negative examples, naturally described in terms of Formal Concept Analysis (FCA), is used here to generate hypotheses about biological activity of chemical compounds.

Learning Closed Sets of Labeled Graphs for Chemical Applications

TLDR
Results of several computer experiments in predicting biological activity of chemical compounds that employ the proposed technique testify in favour of graph approximations as compared to complete graph representations: gaining in efficiency one (almost) does not lose in accuracy.

Formal Concept Analysis

TLDR
FCA explicitly formalises extension and intension of a concept, their mutual relationships, and the fact that increasing intent implies decreasing extent and vice versa, and allows to derive a concept hierarchy from a given dataset.

Some Remarks on the Relation between Annotated Ordered Sets and Pattern Structures

We exhibit an intimate connection between the concept of an annotated ordered set and that of a pattern structure. This enables an exchange of ideas and techniques between both domains.

Formal Concept Analysis: Mathematical Foundations

From the Publisher: This is the first textbook on formal concept analysis. It gives a systematic presentation of the mathematical foundations and their relation to applications in computer science,

The first statement follows from the fact that any extent of ψ(P)

    Kuznetsov . A fast algorithm for computing all intersections of objects from an arbitrary semilattice

    • Nauchno - Tekhnicheskaya Informatsiya Seriya 2 ( Autom . Doc . Mathem . Ling . )
    • 1993