Results 261 to 270 of about 9,774 (301)

Covering Concept Lattices with Concept Chains

2019
The total number of concepts in a concept lattice tends to grow exponentially with the size of a context. There are numerous methods for selecting a subset of concepts based on some interestingness measure. We propose a method for finding interesting concept chains instead of interesting concepts.
Ants Torim, Marko Mets, Kristo Raun
openaire   +1 more source

Textural dependency and concept lattices

International Journal of Approximate Reasoning, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Approximations in Concept Lattices

2010
Motivated by Rough Set Theory we describe an interval arithmetic on complete lattices. Lattice elements get approximated by approximations which are pairs consisting of a lower and an upper approximation. The approximations form a complete lattice again. We describe these lattices of approximations by formal contexts.
openaire   +1 more source

Outliers on Concept Lattices

2014
Outlier detection in mixed-type data, which contain both discrete and continuous features, is still a challenging problem. Here we newly introduce concept-based outlierness, which is defined on a hierarchy of clusters of data points and features, called the concept lattice, obtained by formal concept analysis (FCA). Intuitively, this outlierness is the
openaire   +1 more source

Subdirect decomposition of concept lattices

Algebra Universalis, 1983
This paper is a continuation of a previous paper of the author where the basic theorem for ''concept lattices'' has been given [Ordered sets, Proc. NATO Adv. Study Inst., Banff/Can. 1981, 445-470 (1982; Zbl 0491.06008)]. A concept lattice can be regarded as a complete meet-sublattice of the power set lattice of ''objects'' determined by the Galois ...
openaire   +1 more source

Logical Precision in Concept Lattices

Journal of Logic and Computation, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Parallel algorithms for concept lattice

2012 IEEE 10th Jubilee International Symposium on Intelligent Systems and Informatics, 2012
The increasing interest on application of concept lattices in the different information systems results in several implementations and algorithm proposals and representation tools [1], [2] and [6]. The concept lattice may be used for representation of the concept generalization structure generated from the underlying data set.
József Vásárhelyi, László Kovács
openaire   +1 more source

Congruence Lattices of Finite Lattices as Concept Lattices

1990
In formal concept analysis it is of increasing interest to compute and to represent congruence lattices of finite lattices (for instance, to assist adequate drawings of concept lattices). In this note we give a representation of such congruence lattices as concept lattices which allows the use of developed computer programs to determine and to draw ...
Sigrid Knecht, Rudolf Wille
openaire   +1 more source

Variable threshold concept lattices

Information Sciences, 2007
A fuzzy formal context may be defined as a triple \((U,A,\tilde I)\) with \(U\) and \(A\) finite sets (of objects and of attributes, respectively), and \(\tilde I\colon U \times A \to L\) a binary fuzzy relation, where \(L\) is the unit interval \([0,1]\).
Wen-Xiu Zhang, Jianmin Ma, Shi-Qing Fan
openaire   +1 more source

A lattice-free concept lattice update algorithm

International Journal of General Systems, 2015
Upon a change of input data, one usually wants an update of output computed from the data rather than recomputing the whole output over again. In Formal Concept Analysis, update of concept lattice of input data when introducing new objects to the data can be done by any of the so-called incremental algorithms for computing concept lattice.
openaire   +1 more source