scholarly journals Gene Expression Array Exploration Using $\mathcal{K}$ -Formal Concept Analysis

Author(s):  
José María González Calabozo ◽  
Carmen Peláez-Moreno ◽  
Francisco José Valverde-Albacete
Author(s):  
Hidenobu Hashikami ◽  
◽  
Takanari Tanabata ◽  
Fumiaki Hirose ◽  
Nur Hasanah ◽  
...  

A data-analytic system is proposed for microarray gene expression data based on Formal Concept Analysis (FCA). The purpose of the system is to systematically organize data and to build a complete lattice that analyzes complex relations among genes and give biological interpretation of microarray data. In the system, formal concept analysis handles complex relations, so the microarray data is binarized by setting up a threshold. When change occurs in a conventional algorithm, formal concepts that are nodes of the lattice were calculated from the beginning, but the calculation is inefficient. This paper proposes a new algorithm that has two phase of matrix detection and updating concepts to efficiently update only altered concepts from previously generated concepts. Experiments on run time show that the algorithm takes an average of 0.94 seconds to process real microarray data containing of 43,734 genes and 6 gene expression values.


Author(s):  
Takanari Tanabata ◽  
◽  
Fumiaki Hirose ◽  
Hidenobu Hashikami ◽  
Hajime Nobuhara ◽  
...  

The DNA microarray analysis can explain gene functions by measuring tens of thousands of gene expressions at once and analyzing gene expression profiles that are obtained from the measurement. However, gene expression profiles have such a vast amount of information and therefore most analyses work are done on the data narrowed down by statistical methods, there remains a possibility ofmissing out on genes that consist the factors of phenomena from their evaluations. This study propose a method based on a formal concept analysis to visualize all gene expression profiles and characteristic information that can be obtained from annotation information of each gene so that the user can overview them. In the formal concept analysis, a lattice structure that allows genes to be hierarchically classified and made viewable is built based on the inclusion relations of attributes from a context table in which gene is the object and the attributes are expression profiles and binarized characteristic information. With the proposed method, the user can change the overview state by adjusting the expression ratio and the binary state of characteristic information, understand the relational structure of gene expressions, and carry out analyses of gene functions. We develop software to practice the proposed method, and then ask a biologist to evaluate effectiveness of proposed method applied to a function analysis of genes related to blue light signaling of rice seedlings.


2011 ◽  
Vol 181 (10) ◽  
pp. 1989-2001 ◽  
Author(s):  
Mehdi Kaytoue ◽  
Sergei O. Kuznetsov ◽  
Amedeo Napoli ◽  
Sébastien Duplessis

Author(s):  
Honour Chika Nwagwu

The integration of data from different data sources can result to the existence of inconsistent or incomplete data (IID). IID can undermine the validity of information retrieved from an integrated dataset. There is therefore a need to identify these anomalies. This work presents SPARQL queries that retrieve from an EMAGE dataset, information which are inconsistent or incomplete. Also, it will be shown how Formal Concept Analysis (FCA) tools notably FcaBedrock and Concept Explorer can be applied to identify and visualise IID existing in these retrieved information. Although, instances of IID can exist in most data formats, the investigation is focused on RDF dataset.


2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li

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.


2013 ◽  
Vol 760-762 ◽  
pp. 1708-1712
Author(s):  
Ying Fang Li ◽  
Ying Jiang Li ◽  
Yan Li ◽  
Yang Bo

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.


Sign in / Sign up

Export Citation Format

Share Document