Skip to main content

GPU-Based Biclustering for Neural Information Processing

  • Conference paper

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

Abstract

This paper presents an efficient mapping of geometric biclustering (GBC) algorithm for neural information processing on Graphical Processing Unit (GPU). The proposed designs consist of five different versions which extensively study the use of memory components on the GPU board for mapping the GBC algorithm. GBC algorithm is used to find any maximal biclusters, which are common patterns in each column in the neural processing and gene microarray data. A microarray commonly involves a huge number of data, such as thousands of rows by thousands of columns so that finding the maximal biclusters involves intensive computation. The advantage of GPU is its ability of parallel computing which means that for those independent procedures, they can be carried out at the same time. Experimental results show that the GPU-based GBC could reduce the processing time largely due to the parallel computing of GPU, and its scalability. As an example, GBC algorithm involves a large number of AND operations which utilize the parallel GPU computations, that can be further practically used for other neural processing algorithms.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Golub, T.R., Slonim, D.K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J.P., Coller, H., Loh, M.L., Downing, J.R., Caligiuri, M.A., Bloomfield, C.D., Lander, E.S.: Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring. Science 286(5439), 531–537 (1999)

    Article  Google Scholar 

  2. Dhillon, I.S., Mallela, S., Modha, D.S.: Information-Theoretic Co-clustering, pp. 89–98 (2003)

    Google Scholar 

  3. Gan, X., Liew, A.W.C., Yan, H.: Discovering Biclusters in Gene Expression Data based on High-Dimensional Linear Geometries. BMC Bioinformatics 9(1), 209 (2008)

    Article  Google Scholar 

  4. Zhao, H., Liew, A.W.C., Xie, X., Yan, H.: A New Geometric Biclustering Algorithm based on the Hough Transform for Analysis of Large-scale Microarray Data. Journal of Theoretical Biology 251(3), 264–274 (2008)

    Article  Google Scholar 

  5. Wang, D.Z., Yan, H.: Geometric Biclustering Analysis of DNA Microarray Data based on Hypergraph Partitioning. In: IDASB Workshop on BIBM 2010, pp. 246–251 (2010)

    Google Scholar 

  6. Karypis, G., Kumar, V.: Multilevel K-Way Hypergraph Partitioning

    Google Scholar 

  7. Thomas, D.B., Howes, L.W., Luk, W.: A Comparison of CPUs, GPUs, FPGAs, and Massively Parallel Processor Arrays for Random Number Generation. In: Proc. FPGA, pp. 63–72 (2009)

    Google Scholar 

  8. Labiod, L., Grozavu, N., Bennani, Y.: Clustering Categorical Data Using an Extended Modularity Measure, pp. 310–320 (2010)

    Google Scholar 

  9. Cheng, Y., Church, G.M.: Biclustering of Expression Data. In: The Eighth International Conference on Intelligent Systems for Molecular Biology, pp. 93–103 (2000)

    Google Scholar 

  10. Madeira, S.C., Oliveira, A.L.: Biclustering Algorithms for Biological Data Analysis: A Survey. IEEE/ACM Transactions on Computational Biology and Bioinformatic. 1, 24–45 (2004)

    Article  Google Scholar 

  11. Schatz, M., Trapnell, C., Delcher, A., Varshney, A.: High-Throughput Sequence Alignment Using Graphics Processing Units. BMC Bioinformatics 8(1), 474 (2007)

    Article  Google Scholar 

  12. Manavski, S., Valle, G.: CUDA Compatible GPU Cards as Efficient Hardware Accelerators for Smith-Waterman Sequence Alignment. BMC Bioinformatics 9(suppl. 2), S10 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lo, A.W.Y., Liu, B., Cheung, R.C.C. (2012). GPU-Based Biclustering for Neural Information Processing. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34500-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34500-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34499-2

  • Online ISBN: 978-3-642-34500-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics