Abstract — Over the years, data mining has attracted most of the attention from the research community. The researchers attempt to develop faster, more scalable algorithms to navigate over the ever increasing volumes of spatial gene expression data in search of meaningful patterns. Association rules are a data mining technique that tries to identify intrinsic patterns in spatial gene expression data. It has been widely used in different applications, a lot of algorithms introduced to discover these rules. However Priori-like algorithms has been used to find positive association rules. In contrast to positive rules, negative rules encapsulate relationship between the occurrences of one set of items with absence of the other set of items. In this paper, an algorithm for mining negative association rules from spatial gene expression data is introduced. The algorithm intends to discover the negative association rules which are complementary to the association rules often generated by Priori like algorithm. Our study shows that negative association rules can be discovered efficiently from spatial gene expression data.
[1]
Ramakrishnan Srikant,et al.
Fast Algorithms for Mining Association Rules in Large Databases
,
1994,
VLDB.
[2]
Jano I. van Hemert,et al.
Matching Spatial Regions with Combinations of Interacting Gene Expression Patterns
,
2008,
BIRD.
[3]
Jano I. van Hemert,et al.
Mining Spatial Gene Expression Data for Association Rules
,
2007,
BIRD.
[4]
C. Becquet,et al.
Strong-association-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data
,
2002,
Genome Biology.
[5]
Tomasz Imielinski,et al.
Mining association rules between sets of items in large databases
,
1993,
SIGMOD Conference.
[6]
Nicholas Burton,et al.
EMAP and EMAGE - A framework for understanding spatially organized data
,
2003,
Neuroinformatics.
[7]
Paul Smith,et al.
EMAGE—Edinburgh Mouse Atlas of Gene Expression: 2008 update
,
2007,
Nucleic Acids Res..