Galois lattices are introduced as a device to provide a general representation for two mode social network data. It is shown that Galois lattices yield a single visual image of such data in cases where most alternative models produce dual images. The inzage provided by the Galois lattice produces, moreover, an inzage that can suggest useful insights about the structuralproperties of the data. A...

Formal Concept Analysis – known as a technique for data analysis and visualisation – can also be applied as a means of creating interaction approaches that allow for knowledge discovery within collections of content. These interaction approaches rely on performant algorithms that can generate conceptual neighbourhoods based on a single formal concept, or incrementally compute and update a set o...

In the theory of generalised colourings of graphs, the Unique Factorization Theorem (UFT) for additive induced-hereditary properties of graphs provides an analogy of the well-known Fundamental Theorem of Arithmetics. The purpose of this paper is to present a new, less complicated, proof of this theorem that is based on Formal Concept Analysis. The method of the proof can be successfully applied...

Within formal concept analysis, attribute exploration is a powerful tool to semiautomatically check data for completeness with respect to a given domain. However, the classical formulation of attribute exploration does not take into account possible errors which are present in the initial data. We present in this work a generalization of attribute exploration based on the notion of confidence, ...

Knowledge Space Theory (KST) links in several ways to Formal Concept Analysis (FCA). Recently, the probabilistic and statistical aspects of KST have been further developed by several authors. We review part of the recent results, and describe some of the open problems. The question of whether the outcomes can be useful in FCA remains to be investigated.

We enrich concept-forming operators in L-rough Concept Analysis with linguistic hedges which model semantics of logical connectives ‘very’ and ‘slightly’. Using hedges as parameters for the concept-forming operators we are allowed to modify our uncertainty when forming concepts. As a consequence, by selection of these hedges we can control the size of concept lattice.

This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a concept, including its extension and its intension, and the right hand side is the class label that the concept implies. Particularly, we show that logical concepts of the given universe are naturally associated with ...

The definitive classification of scientific journals depends on their aim and scope details. In this paper, we present an approach to facilitate the journals classification of the DBLP datasets. For the analysis, the DBLP data sets were pre-processed by assigning each journal attributes defined by its topics. It is subsequently shown how theory of formal concept analysis can be applied to analy...

One of the most important elements in a lattice are the irreducible elements. For example, when the lattice is finite, which is usual in the computational case, it forms a base from which the complete lattice is obtained. These elements are also important in Formal Concept Analysis, since they are the basic information of a relational system. In the general fuzzy framework of multi-adjoint conc...