Mining materials knowledge with concept lattice algorithm

2020 ◽  
Vol 22 ◽  
pp. 100726
Author(s):  
Qiuling Sheng ◽  
Quan Qian
Keyword(s):  
Concept Lattice ◽  
Lattice Algorithm ◽  
Materials Knowledge

scholarly journals Dist Frequent Next Neighbours: A Distributed Galois Lattice Algorithm for Frequent Closed Itemsets Extraction

2021 ◽  
Author(s):  
Naomie Sandra Noumi Sandji ◽  
Djamal Abdoul Nasser Seck
Keyword(s):  
Big Data ◽  
Concept Lattice ◽  
General Purpose ◽  
Frequent Itemsets ◽  
Galois Lattice ◽  
Galois Lattices ◽  
Closed Itemsets ◽  
Efficient Alternative ◽  
Lattice Algorithm ◽  
Lattice Construction

The general purpose of this paper is to propose a distributed version of frequent closed itemsets extraction in the context of big data. The goal is to have good performances of frequent closed itemsets extraction as frequent closed item-sets are bases for frequent itemsets. To achieve this goal, we have extended the Galois lattice technique (or concept lattice) in this context. Indeed, Galois lattices are an efficient alternative for extracting closed itemsets which are interesting approaches for generating frequent itemsets. Thus we proposed Dist Frequent Next Neighbour which is a distributed version of the Frequent Next Neighbour concept lattice construction algorithm, which considerably reduces the extraction time by parallelizing the computation of frequent concepts (closed itemsets).

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

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