title: A bottom-up algorithm of vertical assembling concept lattices.
abstract: One of the challenges in microarray data analysis is to interpret observed changes in terms of biological properties and relationships from massive amounts of gene expression data. As a powerful clustering tool, formal concept analysis has been used for making associations of gene expression clusters. The method of formal concept analysis constructs a concept lattice from the experimental data together with additional biological information. However, the time taken for constructing a concept lattice will rise sharply when the numbers of both gene clusters and properties are very large. In this article, we present an algorithm for assembling concept lattices for the parallel constructing concept lattice. The process of assembling two lattices is as follows. By traversing the diagram graph in a bottom-up fashion, all concepts in one lattice are added incremental into another sub-lattice one by one. In the process of adding a concept, the algorithm uses the diagram graph to find the generator concepts. It works only with the new and updated concepts of the concept which is added in the last time. The test results show that this algorithm outperforms other similar algorithms found in related literatures.
authors.affiliation: School of Computer Science and Technology, Harbin Institute of Technology, Harbin, Heilongjiang 150001, China. zhanglei@henu.edu.cn
authors.forename: Lei
authors.initials: L
authors.lastname: Zhang
authors.forename: Hongli
authors.initials: H
authors.lastname: Zhang
authors.forename: Xiajiong
authors.initials: X
authors.lastname: Shen
authors.forename: Lihua
authors.initials: L
authors.lastname: Yin
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D015870:Gene Expression; D005796:Genes; D016681:Genome, Fungal; D055399:Laccaria / Q000235:genetics