Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice

2009 ◽  
pp. 162-177 ◽  
Author(s):  
Jaume Baixeries ◽  
Laszlo Szathmary ◽  
Petko Valtchev ◽  
Robert Godin
Keyword(s):  
Concept Lattice ◽  
Hasse Diagram

EMBEDDING OF CONCEPT LATTICE INTO ITS MIXED CONCEPT LATTICE

2020 ◽  
Vol 9 (7) ◽  
pp. 4389-4396
Author(s):  
H. S. Ramananda ◽  
A. J. Harsha
Keyword(s):  
Concept Lattice

scholarly journals G. Czédli’s tolerance factor lattice construction and weak ordered relations

2021 ◽  
Vol 82 (2) ◽  
Author(s):  
Sándor Radeleczki
Keyword(s):  
Concept Lattice ◽  
Tolerance Factor ◽  
Macneille Completion ◽  
Lattice Construction

AbstractG. Czédli proved that the blocks of any compatible tolerance T of a lattice L can be ordered in such a way that they form a lattice L/T called the factor lattice of L modulo T. Here we show that the Dedekind–MacNeille completion of the lattice L/T is isomorphic to the concept lattice of the context (L, L, R), where R stands for the reflexive weak ordered relation $$ \mathord {\le } \circ T$$ ≤ ∘ T . Weak ordered relations constitute the generalization of the ordered relations introduced by S. Valentini. Reflexive weak ordered relations can be characterized as compatible reflexive relations $$R\subseteq L^{2}$$ R ⊆ L 2 satisfying $$R=\ \mathord {\le } \circ R\circ \mathord {\le } $$ R = ≤ ∘ R ∘ ≤ .

scholarly journals Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

2021 ◽  
Vol 178 (3) ◽  
pp. 173-185
Author(s):  
Arthur Adinayev ◽  
Itamar Stein
Keyword(s):  
Isomorphism Problem ◽  
Complete Characterization ◽  
Hasse Diagram ◽  
Subgraph Isomorphism ◽  
Rewriting Systems ◽  
Rewriting System ◽  
String Rewriting ◽  
Reduction Graph

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice Mk (the unique lattice with k + 2 elements and one anti-chain of length k) and find the maximal k for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.

The Research of Semantic Web Service Matching Algorithm Based on the Formal Concept Analysis

2013 ◽  
Vol 760-762 ◽  
pp. 1708-1712
Author(s):  
Ying Fang Li ◽  
Ying Jiang Li ◽  
Yan Li ◽  
Yang Bo
Keyword(s):  
Semantic Web ◽  
Web Service ◽  
Formal Concept Analysis ◽  
Service Discovery ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Formal Concept ◽  
Semantic Web Service ◽  
Matching Algorithm ◽  
Service Matching

At present, as the number of web services resources on the network drastically increased, how to quickly and efficiently find the needed services from publishing services has become a problem to resolve. Aiming at the problems of low efficiency in service discovery of traditional web service, the formal concept analysis ( FCA) is introduced into the semantic Web service matching, and a Matching Algorithm based semantic web service is proposed. With considering the concept of limited inheritance,this method introduces the concept of limited inheritance to the semantic similarity calculation based on the concept lattice. It is significant in enhancing the service function matching in practical applications through adjust the calculation.

scholarly journals A semantic approach to concept lattice-based information retrieval

2014 ◽  
Vol 72 (1-2) ◽  
pp. 169-195 ◽  
Author(s):  
Victor Codocedo ◽  
Ioanna Lykourentzou ◽  
Amedeo Napoli
Keyword(s):  
Information Retrieval ◽  
Concept Lattice ◽  
Semantic Approach
Sign in / Sign up

Export Citation Format

Share Document