Skip to main content

Biclustering Gene Expression Data in the Presence of Noise

  • Conference paper
  • 1256 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3696))

Abstract

Production of gene expression chip involves a large number of error-prone steps that lead to a high level of noise in the corresponding data. Given the variety of available biclustering algorithms, one of the problems faced by biologists is the selection of the algorithm most appropriate for a given gene expression data set. This paper compares two techniques for biclustering of gene expression data i.e. a recent technique based on crossing minimization paradigm and the other being Order Preserving Sub Matrix (OPSM) technique. The main parameter for evaluation being the quality of the results in the presence of noise in gene expression data. The evaluation is based on using simulated data as well as real data. Several limitations of OPSM were exposed during the analysis, the key being its susceptibility to noise.

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. Abdullah, A., Hussain, A.: A New Biclustering Technique Based On Crossing Minimization. In: Proceedings Brain Inspired Cognitive Systems Conference (BICS2004), Univ. of Stirling, Scotland, UK, August/September (2004)

    Google Scholar 

  2. Ben-Dor, B., Chor, R., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: The order-preserving submatrix problem. In: Proceedings of the 6th International Conference on Computational Biology (RECOMB 2002), pp. 49–57 (2002)

    Google Scholar 

  3. Keller, A.D., Schummer, M., Hood, L., Ruzzo, W.L.: Bayesian Classification of DNA Array Expression Data. Technical Report UW-CSE-2000-08-01 (August 2000)

    Google Scholar 

  4. Jiang, D., Tang, C., Zhang, A.: A Cluster Analysis for Gene Expression Data: A Survey. Technical Report 2002-06, State University of New Your at Buffalo (2002)

    Google Scholar 

  5. Dror, R.: Noise models in gene array analysis. Report in fulfillment of the area exam requirement in the MIT Department of Electrical Engineering and Computer Science (2001)

    Google Scholar 

  6. Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1(1), 24–45 (2004)

    Article  Google Scholar 

  7. Wadhera, G.: Research Literature Commentary: Subspace clustering methods for gene expression data analysis (August 2004), http://www.stanford.edu

  8. Yang, Y., Webb, G.I.: A Comparative Study of Discretization Methods for Naive-Bayesian Classifiers. In: Proc. of the Pacific Rim Knowledge Acquisition Workshop, National Center of Sciences, Tokyo, Japan (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdullah, A., Hussain, A. (2005). Biclustering Gene Expression Data in the Presence of Noise. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Biological Inspirations – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550822_95

Download citation

  • DOI: https://doi.org/10.1007/11550822_95

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28752-0

  • Online ISBN: 978-3-540-28754-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics