Skip to main content
SpringerLink
Log in

HiBi – The Algorithm of Biclustering the Discrete Data

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8468))

Included in the following conference series:

Abstract

The article presents the new algorithm for hierarchical biclustering: HiBi. It is dedicated to the analysis of the discrete data. The algorithm uses the set of exact biclusters as the input. In this approach results of exact biclustering algorithm eBi are used as the input. As a result of combining biclusters into the more general one, HiBi gives the set of inexact biclusters. The algorithm is hierarchical so the final result can be chosen after the algorithm performance. All experiments were performed on artificial datasets.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barkow, S., Bleuler, S., Prelić, A., Zimmermann, P., Zitzler, E.: BicAT: A Biclustering Analysis Toolbox. Bioinformatics 22(10), 1282–1283 (2006)

    Article  Google Scholar 

  2. Chagoyen, M., Carmona-Saez, P., Shatkay, H., Carazo, J., Pascual-Montano, A.: Discovering semantic features in the literature: A foundation for building functional associations. BMC Bioinformatics 7(1), 41 (2006)

    Article  Google Scholar 

  3. Gusenleitner, D., Howe, E., Bentink, S., Quackenbush, J., Culhane, A.: iBBiG: Iterative binary bi-clustering of gene sets. Bioinformatics 28(19), 2484–2492 (2012)

    Article  Google Scholar 

  4. Hartigan, J.: Direct Clustering of a Data Matrix. Journal of American Statistical Association 67(337), 123–129 (1972)

    Article  Google Scholar 

  5. Koyuturk, M., Szpankowski, W., Grama, A.: Biclustering gene-feature matrices for statistically significant dense patterns. In: Proc. of IEEE Computational Systems Bioinformatics Conference, pp. 480–484 (2004)

    Google Scholar 

  6. Madeira, S., Oliveira, A.: 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. Michalak, M.: Foundations of rough biclustering. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012, Part II. LNCS, vol. 7268, pp. 144–151. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Michalak, M., Stawarz, M.: HRoBi – The Algorithm for Hierarchical Rough Biclustering. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013, Part II. LNCS, vol. 7895, pp. 194–205. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Orzechowski, P.: Proximity Measures and Results Validation in Biclustering – A Survey. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013, Part II. LNCS (LNAI), vol. 7895, pp. 206–217. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. Pawlak, Z.: Rough Sets. Journal of Computer and Information Sciences 11(5), 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  11. Pio, G., Ceci, M., DElia, D., Loglisci, C., Malerba, D.: A Novel Biclustering Algorithm for the Discovery of Meaningful Biological Correlations between microRNAs and their Target Genes. BMC Bioinformatics 14(Suppl. 7) (2013)

    Google Scholar 

  12. Prelić, A., Bleuler, S., Zimmermann, P., Wille, A., Bühlmann, P., Gruissem, W., Hennig, L., Thiele, L., Zitzler, E.: A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9), 1122–1129 (2006)

    Article  Google Scholar 

  13. Rodriguez-Baena, D., Perez-Pulido, A., Aguilar, J.: A biclustering algorithm for extracting bit-patterns from binary datasets. Bionformatics 27(19), 2738–2745 (2011)

    Article  Google Scholar 

  14. Stawarz, M., Michalak, M.: eBi - The Algorithm for Exact Biclustering. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2012, Part II. LNCS, vol. 7268, pp. 327–334. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Uitert, M., Meuleman, W., Wessels, L.: Biclustering sparse binary genomic data. Journal of Computational Biology 15(10), 1329–1345 (2008)

    Article  MathSciNet  Google Scholar 

  16. Ward, J.: Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association 58(301), 236–244 (1963)

    Article  MathSciNet  Google Scholar 

  17. Wren, J., Garner, H.: Shared relationship analysis: ranking set cohesion and commonalities within a literature-derived relationship network. Bioinformatics 20(2), 191–198 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, ul. Akademicka 16, 44-100, Gliwice, Poland

    Marcin Michalak, Magdalena Lachor & Andrzej Polański

Authors
  1. Marcin Michalak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Magdalena Lachor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Polański
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Częstochowa University of Technology, Armii Krajowej 36, 42-200, Częstochowa, Poland

    Leszek Rutkowski  & Rafał Scherer  & 

  2. Częstochowa University of Technology, 42-200, Częstochowa, Poland

    Marcin Korytkowski

  3. AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  4. Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California Berkeley, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  5. Computational Intelligence Laboratory, Electrical and Computer Engineering, University of Louisville, 405 Lutz Hall, 40292, Louisville, KY, USA

    Jacek M. Zurada

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Michalak, M., Lachor, M., Polański, A. (2014). HiBi – The Algorithm of Biclustering the Discrete Data. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2014. Lecture Notes in Computer Science(), vol 8468. Springer, Cham. https://doi.org/10.1007/978-3-319-07176-3_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07176-3_66

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07175-6

  • Online ISBN: 978-3-319-07176-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation