Global search analysis of spatial gene expression data using genetic algorithm

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a genetic algorithm to perform global searching for generating interesting association rules from Spatial Gene Expression Data. The typical approach of association rule mining is to make strong simplifying assumptions about the form of the rules, and limit the measure of rule quality to simple properties such as minimum support or minimum confidence. Minimum-support or minimum confidence means that users must specify suitable thresholds for their mining tasks though they may have no knowledge concerning their databases. The presented approach does not require users to specify thresholds. Instead of generating an unknown number of association rules, only the most interesting rules are generated according to interestingness measure as defined by the fitness function. Computational results show that applying this genetic algorithm to search for high quality association rules with their confidence and interestingness acceptably maximized leads to better results. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Anandhavalli, M., Ghose, M. K., Gauthaman, K., & Boosha, M. (2010). Global search analysis of spatial gene expression data using genetic algorithm. In Communications in Computer and Information Science (Vol. 89 CCIS, pp. 593–602). https://doi.org/10.1007/978-3-642-14478-3_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free