The Research of Ontology Merging Based on Rough Concept Lattice Isomorphic Merging

2012 ◽  
pp. 631-636
Author(s):  
HongSheng Xu ◽  
MingLi Song
Keyword(s):  
Concept Lattice ◽  
Ontology Merging

An Ontology Merging Method Based on Concept Lattice

2012 ◽  
Vol 6 (21) ◽  
pp. 564-570
Author(s):  
Xiening Wang ◽  
Guanyu Li ◽  
Shupeng liu
Keyword(s):  
Concept Lattice ◽  
Ontology Merging ◽  
Merging Method

Using Fuzzy Rough Concept Lattices Merging and Presenting Domain Ontology

2011 ◽  
Vol 301-303 ◽  
pp. 384-387
Author(s):  
Hong Sheng Xu ◽  
Lan Wang
Keyword(s):  
Semantic Web ◽  
Knowledge Sharing ◽  
Dimensional Space ◽  
Concept Lattice ◽  
Three Dimensional ◽  
Concept Lattices ◽  
Ontology Merging ◽  
Ontology Application ◽  
Application Methods ◽  
Three Dimensional Space

As the foundation of the semantic web, ontology is a formal, explicit specification of a shared conceptual model. It becomes an important problem on ontology application to merg and present ontology. However, there are some defects between several kinds of existing ontology application methods in many aspects. The paper offers a methodology of ontology merging for knowledge sharing and reusing based on fuzzy concept concept lattice union in order to makes up these defects.This paper proposes the means of ontology presenting based on the form of concept lattices visualizing in three-dimensional space. The experimental results indicate that this method has great validity.

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 ∘ ≤ .

Sign in / Sign up

Export Citation Format

Share Document