Results 1 to 10 of about 5,395,372 (300)
Formal Contexts, Formal Concept Analysis, and Galois Connections [PDF]
Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We present new results in formal concept analysis and in Galois connections by presenting new Galois connection results and then applying these to formal ...
Jeffrey T. Denniston +2 more
doaj +7 more sources
On the Calculation of Formal Concept Stability [PDF]
The idea of stability has been used in many applications. However, computing stability is still a challenge and the best algorithms known so far have algorithmic complexity quadratic to the size of the lattice.
Hui-lai Zhi
doaj +3 more sources
Same Effect Relation and Concept Reduction in Formal Concept Analysis [PDF]
Since 2018,scholars have proposed and studied a new topic of “concept reduction” in formal concept analysis.Including unnecessary concepts,core concepts,relatively necessary concepts,and the identification of three types of concepts,and research on ...
MA Wensheng, HOU Xilin
doaj +1 more source
Research on Community Division Method Under Network Formal Context
Network community division is the basis of concept cognition and pattern learning from social networks, and is also a hot topic in the study of machine learning under the network background.
LIU Wenxing, FAN Min, LI Jinhai
doaj +1 more source
SFCA: A Scalable Formal Concepts Driven Architecture for Multi-Field Knowledge Graph Completion
With the proliferation of Knowledge Graphs (KGs), knowledge graph completion (KGC) has attracted much attention. Previous KGC methods focus on extracting shallow structural information from KGs or in combination with external knowledge, especially in ...
Xiaochun Sun, Chenmou Wu, Shuqun Yang
doaj +1 more source
On formal concepts of random formal contexts [PDF]
In formal concept analysis, it is well-known that the number of formal concepts can be exponential in the worst case. To analyze the average case, we introduce a probabilistic model for random formal contexts and prove that the average number of formal concepts has a superpolynomial asymptotic lower bound.
openaire +5 more sources
Concepts and Categories: A Data Science Approach to Semiotics
Compared to existing classical approaches to semiotics which are dyadic (signifier/signified, F. de Saussure) and triadic (symbol/concept/object, Ch. S.
Włodarczyk André
doaj +1 more source
Characterizing One-Sided Formal Concept Analysis by Multi-Adjoint Concept Lattices
Managing and extracting information from databases is one of the main goals in several fields, as in Formal Concept Analysis (FCA). One-sided concept lattices and multi-adjoint concept lattices are two frameworks in FCA that have been developed in ...
María José Benítez-Caballero +2 more
doaj +1 more source
Method of Updating Formal Concept Under Covering Multi-granularity [PDF]
Multi-granularity formal concept analysis is an important tool for data mining and knowledge discovery.This paper studies the methods of coarsening and refining formal concepts under multi-granularity.Firstly,it is proved that the existing concept ...
WANG Taibin, LI Deyu, ZHAI Yanhui
doaj +1 more source
Formal Concepts and Residuation on Multilattices
Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if it is not a lattice. Multilattices could be endowed with a residuation, and therefore used as set of truth-values
Blaise Blériot Koguep Njionou +2 more
openaire +4 more sources

