Results 231 to 240 of about 7,317 (264)

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

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

Similarity relations in concept lattices

Journal of Logic and Computation, 2000
The paper deals with fuzzy concept lattices [cf. \textit{A. Burusco Juandeaburre} and \textit{R. Fuentes-González}, Mathware Soft Comput. 1, 209-218 (1994; Zbl 0827.06004), and \textit{S. Pollandt}, Fuzzy-Begriffe. Formale Begriffsanalyse unscharfer Daten, Springer, Berlin (1997; Zbl 0870.06008)] arising from Formal Concept Analysis [cf.
openaire   +1 more source

Orbital Concept Lattices

2022
Jens Kötters, Stefan E. Schmidt
openaire   +1 more source

Concept Lattice and AFS Algebra

2006
Formal concept analysis is a field of applied mathematics based on mathematical analysis of concept and conceptual hierarchy,AFS algebra was first proposed and studied by Xiaodong Liu 1998 ( Journal of Mathematical Analysis and Applications, vol. 217, Fuzzy Sets and Systems, vol. 95 )[1,2].
Lishi Zhang, Xiaodong Liu 0001
openaire   +1 more source

Generalizations of Approximable Concept Lattice

2008
B. Ganter, R. Wille initiated formal concept analysis. Concept lattice is one of the main notions and tools. Some researchers have investigated the fuzzification of the classical crisp concept lattice. One of them was shown by R. Belohlavek: concept lattice in fuzzy setting. The second one was given by S. Krajci: generalized concept lattice.
Xueyou Chen, Qingguo Li, Fei Long, Zike Deng   +3 more
openaire   +1 more source

Similarity Measures on Concept Lattices

2016
This paper falls within the framework of Formal Concept Analysis which provides classes (the extents) of objects sharing similar characters (the intents), a description by attributes being associated to each class. In a recent paper by the first author, a new similarity measure between two concepts in a concept lattice was introduced, allowing for a ...
Florent Domenach, George Portides
openaire   +1 more source

Which Concept Lattices Are Pseudocomplemented?

2005
We give a contextual characterization of pseudocomplementation by means of the arrow relations.
Bernhard Ganter, Léonard Kwuida
openaire   +1 more source

Rough Sets and Concept Lattices

1994
A Concept lattice is a special kind of lattice, the explicit representation of which can be viewed as a semantic network with special properties. Concept lattices have been applied to Machine Learning as well as to the uncovering of the underlying structure in discrete-valued data. They also embody the cladistic approach to classification.
openaire   +1 more source

EMBEDDING OF CONCEPT LATTICE INTO ITS MIXED CONCEPT LATTICE

Advances in Mathematics: Scientific Journal, 2020
H. S. Ramananda, A. J. Harsha
openaire   +1 more source