document: Handling very large numbers of association rules in the analysis of microarray data The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years , and different data mining techniques have been proposed for the analysis of such data . In this paper , we propose to use association rule discovery methods for determining associations among expression levels of different genes . One of the main problems related to the discovery of these associations is the scalability issue . Microarrays usually contain very large numbers of genes that are sometimes measured in 10,000 s. Therefore , analysis of such data can generate a very large number of associations that can often be measured in millions . The paper addresses this problem by presenting a method that enables biologists to evaluate these very large numbers of discovered association rules during the post-analysis stage of the data mining process . This is achieved by providing several rule evaluation operators , including rule grouping , filtering , browsing , and data inspection operators , that allow biologists to validate multiple individual gane regulation patterns at a time . By iteratively applying these operators , biologists can explore a significant part of all the initially generated rules in an acceptable period of time and thus answer biological questions that are of a particular interest to him or her . To validate our method , we tested our system on the microarray data pertaining to the studies of environmental hazards and their influence of gane expression processes . As a result , we managed to answer several questions that were of interest to the biologists that had collected this data .
doc_bio_tags: O O O O O B I O O B I I I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O