A Combined Approach of Formal Concept Analysis and Text Mining for Concept Based Document Clustering

2005 ◽  
Author(s):  
N.N. Myat ◽  
K. Haymar ◽  
Saw Hla
Keyword(s):  
Text Mining ◽  
Formal Concept Analysis ◽  
Document Clustering ◽  
Concept Analysis ◽  
Formal Concept ◽  
Combined Approach

Graph Theoretic Lattice Mining Based on Formal Concept Analysis (FCA) Theory for Text Mining

2017 ◽  
Vol 7 (4) ◽  
pp. 1413
Author(s):  
Hasni Hassan ◽  
Noraida Ali ◽  
Aznida Hayati Zakaria ◽  
Mohd Isa Awang ◽  
Abd Rasid Mamat
Keyword(s):  
Text Mining ◽  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Formal Concept ◽  
Graph Theoretic

An Approach Using Concept Lattice Structure for Data Mining and Information Retrieval

2015 ◽  
Vol 1 ◽  
pp. 1
Author(s):  
Tran Lam Quan ◽  
Vu Tat Thang
Keyword(s):  
Data Mining ◽  
Information Retrieval ◽  
Text Mining ◽  
Formal Concept Analysis ◽  
Mathematical Theory ◽  
Lattice Structure ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Frequent Itemset ◽  
Formal Concept

Since the 1980s, the concept lattice was studied and applied to the problems of text mining, frequent itemset, classification, etc. The formal concept analysis - FCA is one of the main techniques applied in the concept lattice. FCA is a mathematical theory which is applied to the data mining by setting a table with rows describing objects and columns describing attributes, with relationships between them, and then sets up the concept lattice structure. In the area of information retrieval, FCA considers the correlation of objects-attributes the same as those of documents-terms. In the process of setting up the lattice, FCA defines each node in the lattice as a concept. The algorithm for the construction of concept lattice will install a couple on each node, including a set of documents with common terms, and a set of terms which co-occurs in documents. In a larger scale, each concept in the lattice could be recognized as a couple of questions - answers. In the lattice, the action of browsing up or down of nodes will allow approaching more general concepts or more detail concepts, respectively.

scholarly journals Continuous Domains in Formal Concept Analysis*

2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li
Keyword(s):  
Formal Concept Analysis ◽  
Concept Analysis ◽  
Continuous Functions ◽  
Formal Context ◽  
Formal Concept ◽  
Contractive Mappings ◽  
Continuous Domains ◽  
Algebraic Domains ◽  
Scott Continuous ◽  
Continuous Domain

Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notion of contractive mappings over formal contexts is proposed, which can be viewed as a generalization of interior operators on sets into the framework of FCA. Then, by considering subset-selections consistent with contractive mappings, the notions of attribute continuous formal contexts and continuous concepts are introduced. It is shown that the set of continuous concepts of an attribute continuous formal context forms a continuous domain, and every continuous domain can be restructured in this way. Moreover, the notion of F-morphisms is identified to produce a category equivalent to that of continuous domains with Scott continuous functions. The paper also investigates the representations of various subclasses of continuous domains including algebraic domains and stably continuous semilattices.

Sign in / Sign up

Export Citation Format

Share Document