Decomposing Finite Closure Operators by Attribute Exploration
نویسنده
چکیده
There are examples of algorithms which allow the e cient computation of the concepts of a given formal context. However, when one wants to apply those algorithms to an arbitrary closure operator, which might not be given by a formal context, those algorithms cannot be applied directly. Therefore we want to discuss the problem of nding an appropriate formal context for a given closure operator, and present an application of attribute exploration to achieve this goal. The occurrence of high performance algorithms for the fast computation of concepts of a formal context (as [1,8,9]) makes it possible to deal with large amounts of data (if one is interested in its formal concepts). These algorithms are mostly variants of Kuznetsov's well-known Close-by-One algorithm (as for example described in [6]). In contrast to Ganter's NextClosure [3], which computes the xpoints of a given closure operator, Close-by-One computes the concepts of a given formal context. But still both algorithms get a closure operator as input and compute it's xpoints. The only di erence is in the representation of the closure operator c: Close-by-One requires it to be given as a formal context, whereas NextClosure does not place any restrictions on the representation of c. We want to take this asymmetry of representing a closure operator as motivation to consider the following question: Can we e ectively (and also maybe e ciently) compute for a given closure operator c on a setM a formal context whose intents are precisely the closed sets of c? We shall formalise this idea as decomposing closure operators and shall show a neat application of attribute exploration in solving this problem. We also shall discuss some complexity aspects and show some experimental evaluation. 1 Formal Concept Analysis and Closure Operators To better understand the following discussion, we brie y introduce the necessary de nitions from Formal Concept Analysis and the theory of closure operators. The basic structure used by Formal Concept Analysis is the one of a formal context. Let G and M be two sets and let I ⊆ G ×M . We will call the triple (G,M, I) a formal context. Intuitively, the set G is the set of objects, the set M
منابع مشابه
NextClosures with Constraints
In a former paper, the algorithm NextClosures for computing the set of all formal concepts as well as the canonical base for a given formal context has been introduced. Here, this algorithm shall be generalized to a setting where the data-set is described by means of a closure operator in a complete lattice, and furthermore it shall be extended with the possibility to handle constraints that ar...
متن کاملM-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS
In this paper, the notion of closure operators of matroids is generalized to fuzzy setting which is called $M$-fuzzifying closure operators, and some properties of $M$-fuzzifying closure operators are discussed. The $M$-fuzzifying matroid induced by an $M$-fuzzifying closure operator can induce an $M$-fuzzifying closure operator. Finally, the characterizations of $M$-fuzzifying acyclic matroi...
متن کاملCHARACTERIZATION OF L-FUZZIFYING MATROIDS BY L-FUZZIFYING CLOSURE OPERATORS
An L-fuzzifying matroid is a pair (E, I), where I is a map from2E to L satisfying three axioms. In this paper, the notion of closure operatorsin matroid theory is generalized to an L-fuzzy setting and called L-fuzzifyingclosure operators. It is proved that there exists a one-to-one correspondencebetween L-fuzzifying matroids and their L-fuzzifying closure operators.
متن کاملTriangular Intuitionistic Fuzzy Triple Bonferroni Harmonic Mean Operators and Application to Multi-attribute Group Decision Making
As an special intuitionistic fuzzy set defined on the real number set, triangular intuitionistic fuzzy number (TIFN) is a fundamental tool for quantifying an ill-known quantity. In order to model the decision maker's overall preference with mandatory requirements, it is necessary to develop some Bonferroni harmonic mean operators for TIFNs which can be used to effectively intergrate the informa...
متن کاملTrapezoidal intuitionistic fuzzy prioritized aggregation operators and application to multi-attribute decision making
In some multi-attribute decision making (MADM) problems, various relationships among the decision attributes should be considered. This paper investigates the prioritization relationship of attributes in MADM with trapezoidal intuitionistic fuzzy numbers (TrIFNs). TrIFNs are a special intuitionistic fuzzy set on a real number set and have the better capability to model ill-known quantities. Fir...
متن کامل