Skip to main content

Global Search Analysis of Spatial Gene Expression Data Using Genetic Algorithm

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 89))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association rules between sets of items in large databases. In: ACM SIGMOD Intl Conf. on Management of Data (ACM SIGMOD 1993), Washington, USA, pp. 207–216 (1993)

    Google Scholar 

  2. Zaki, M.J.: Generating non-redundant association rules. In: Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, pp. 34–43 (2001)

    Google Scholar 

  3. Anandhavalli, M., Ghose, M.K., Gauthaman, K.: Mining Spatial Gene Expression Data Using Association Rules. IJCSS 3(5), 351–357 (2009)

    Google Scholar 

  4. EMAGE Gene Expression Data, http://genex.hgu.mrc.ac.uk/Emage/database

  5. van Hemert, J., Baldock, R.: Mining Spatial Gene Expression Data for Association Rules. In: Hochreiter, S., Wagner, R. (eds.) BIRD 2007. LNCS (LNBI), vol. 4414, pp. 66–76. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Freitas, A.: A genetic algorithm for generalized rule induction. In: Advances in Soft Computing Engineering Design and Manufacturing, pp. 340–353. Springer, Berlin (1999)

    Google Scholar 

  7. Fidelis, M., Lopes, H., Freitas, A.: Discovering comprehensible classification rules with a genetic algorithm. In: 2000 Congress on Evolutionary Computation, La Jolla, CA, USA, pp. 805–810 (2000)

    Google Scholar 

  8. Theiler, K.: The House Mouse Atlas of Embryonic Development. Springer, New York (1989)

    Google Scholar 

  9. Pei, M., Goodman, E., Punch, W.: Pattern discovery from data using genetic algorithm. In: 1st Pacific – Asia Conf. Knowledge Discovery and Data Mining, Singapore, pp. 64–276 (1997)

    Google Scholar 

  10. Weiss, G., Hirsh, H.: Learning to predict rare events in event sequences. In: 4th International Conference Knowledge Discovery and Data Mining, pp. 359–363. AAAI Press, Cambridge (1998)

    Google Scholar 

  11. Au, W., Chan, C.: An evolutionary approach for discovering changing patterns in historical data. In: Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV, SPIE, vol. 4730, pp. 398–409 (2002)

    Google Scholar 

  12. Augier, S., Venturini, G., Kodratoff, Y.: Learning first order logic rules with a genetic algorithm. In: 1st International Conf. Knowledge Discovery and Data Mining, Montreal, Canada, pp. 21–26 (1995)

    Google Scholar 

  13. Venugopal, K.R., Srinivasa, K.G., Patnaik, L.M.: Dynamic association rule mining using genetic algorithms. Soft Computing for Data Mining Applications 190, 63–80 (2009)

    Article  Google Scholar 

  14. Salleb-Aouissi, A., Vrain, C., Nortet, C.: QuantMiner.: A Genetic Algorithm for Mining Quantitative Association Rules. In: 20th International Conference on Artificial Intelligence (IJCAI), Hyderabad, India, pp. 1035–1040 (2007)

    Google Scholar 

  15. Yan, X., Zhang, C., Zhang, S.: Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support. J. Expert Systems with Applications 36(2), 3066–3076 (2009)

    Article  Google Scholar 

  16. Han, F., Rao, N.: Mining Co-regulated Genes using Association Rules combined with Hast-tree and Genetic algorithms. IEEE Xplore, 858–862 (2009)

    Google Scholar 

  17. Gray, P., et al.: Mouse brain organization revealed through direct genome-scale tf expression analysis. Science 306(5705), 2255–2257 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anandhavalli, M., Ghose, M.K., Gauthaman, K., Boosha, M. (2010). Global Search Analysis of Spatial Gene Expression Data Using Genetic Algorithm. In: Meghanathan, N., Boumerdassi, S., Chaki, N., Nagamalai, D. (eds) Recent Trends in Network Security and Applications. CNSA 2010. Communications in Computer and Information Science, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14478-3_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14478-3_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14477-6

  • Online ISBN: 978-3-642-14478-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics