Results 271 to 280 of about 449,079 (306)
Some of the next articles are maybe not open access.

Fuzzy Formal Concept Analysis

2018
Formal Context Analysis is a mathematical theory that enables us to find concepts from a given set of objects, a set of attributes and a relation on them. There is a hierarchy of such concepts, from which a complete lattice can be made. In this paper we present a generalization of these ideas using fuzzy subsets and fuzzy implications defined from ...
Abner Brito   +4 more
openaire   +1 more source

Concept reduction on interval formal concept analysis

9th IEEE International Conference on Cognitive Informatics (ICCI'10), 2010
A concept clustering method on interval concept lattice is introduced in this paper. Based on the distance between two formal concepts defined, the clustering method is presented. Clustering can reduce the size of interval concept lattice to get better interval lattice structure which can be easier to understand.
Zhou Wen   +3 more
openaire   +1 more source

Husserl's conception of formal ontology

History and Philosophy of Logic, 1993
The concept of formal ontology was first developed by Husserl. It concerns problems relating to the notions of object, substance, property, part, whole, predication, nominalization, etc. The idea of formal ontology is present in many of Husserl’s works, with minor changes. This paper provides a reconstruction of such an idea.
openaire   +2 more sources

Generalized Formal Concept Analysis

2000
Formal Concept Analysis is an algebraic model based on a Galois connection that is used for symbolic knowledge exploration from an elementary form of the representation of data (“formal context”). The aim of this paper is to design the theoretical models required for the extension of Formal Concept Analysis to any kind of lattice-structured set of ...
Laurent Chaudron, Nicolas Maille
openaire   +1 more source

The formal conception

2010
The formal conception articulates no presumption for a particular entity to be an international person. The international legal system is declared completely open: anyone being the addressee of an international norm (right, duty or capacity) is an international person. Consequently, international personality is an a posteriori concept.
openaire   +1 more source

Formal Rough Concept Analysis

1999
In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B).
Jamil Saquer, Jitender S. Deogun
openaire   +1 more source

AFS Formal Concept and AFS Fuzzy Formal Concept Analysis

2009
In this chapter, based on the original idea of Wille of formal concept analysis and the AFS (Axiomatic Fuzzy Set) theory, we presents a rigorous mathematical treatment of fuzzy formal concept analysis referred to as an AFS Formal Concept Analysis (AFSFCA).
Xiaodong Liu, Witold Pedrycz
openaire   +1 more source

Formal Concepts in Dedekind Categories

2008
Formal concept analysis is amathematical field applied to data mining. Usually, a formal concept is defined as a pair of sets, called extents and intents, for a given formal context in binary relation. In this paper we set a relational formulation for formal concepts, and prove some basic properties of concept lattices by using relation calculus in ...
Toshikazu Ishida   +2 more
openaire   +1 more source

Monadic Formal Concept Analysis

2014
Formal Concept Analysis (FCA) as inherently relational can be formalized and generalized by using categorical constructions. This provides a categorical view of the relation between “object” and “attributes”, which can be further extended to a more generalized view on relations as morphisms in Kleisli categories of suitable monads. Structure of sets of
Patrik Eklund   +3 more
openaire   +1 more source

Approximation in Formal Concept Analysis

2005
We introduce a pair of rough set approximations in formal concept analysis. The proposed approximation operators are defined based on both lattice-theoretic and set-theoretic operators. The properties of the approximation operators are examined. Algorithms for attribute reduction and object reduction in concept lattices are presented.
Ming-Wen Shao, Wen-Xiu Zhang
openaire   +1 more source

Home - About - Disclaimer - Privacy