Skip to main content
SpringerLink
Log in

Induction of Centre-Based Biclusters in Terms of Boolean Reasoning

  • Conference paper
  • First Online:
Man-Machine Interactions 6 (ICMMI 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1061 ))

Included in the following conference series:

Abstract

Biclustering is considered as the method of finding two-dimensional subgroups in a matrix of scalars. The paper introduces a new approach to biclustering continuous matrices on the basis of boolean function analysis, where it is assumed that found bicluster must fulfill two criteria: it should cover the specified value called a centre and the maximal difference between the mentioned centre and cells of bicluster should not exceed an assumed margin. The paper also presents mathematical proofs of the correctness of such approach. The application of new approach for biclustering was applied on artificial data.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Brown, F.M.: Boolean Reasoning. Springer, New York (1990)

    Book  Google Scholar 

  2. Busygin, S., Prokopyev, O., Pardalos, P.M.: Biclustering in data mining. Comput. Oper. Res. 35(9), 2964–2987 (2008)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  4. Hartigan, J.A.: Direct clustering of a data matrix. J. Am. Stat. Assoc. 67(337), 123–129 (1972)

    Article  Google Scholar 

  5. Johnson, D.: Approximation algorithms for combinational problems. J. Comput. Syst. Sci. 9, 256–278 (1974)

    Article  Google Scholar 

  6. Latkowski, R.: On decomposition for incomplete data. Fundam. Informaticae 54, 1–16 (2003)

    MathSciNet  MATH  Google Scholar 

  7. Michalak, M., Jaksik, R., Ślęzak, D.: Heuristic search of exact biclusters in binary data. Int. J. Appl. Math. Comput. Sci. (2019, to appear)

    Google Scholar 

  8. Michalak, M., Ślęzak, D.: Boolean representation for exact biclustering. Fundam. Informaticae 161(3), 275–297 (2018)

    Article  MathSciNet  Google Scholar 

  9. Michalak, M., Ślęzak, D.: On Boolean representation of continuous data biclustering. Fundam. Informaticae 167(3), 193–217 (2019)

    Article  MathSciNet  Google Scholar 

  10. Nguyen, H.S.: Approximate Boolean reasoning: foundations and applications in data mining. In: Transactions on Rough Sets V, pp. 334–506 (2006)

    Google Scholar 

  11. Orzechowski, P., Boryczko, K.: Text mining with hybrid biclustering algorithms. Lecture Notes in Computer Science, vol. 9693, pp. 102–113 (2016)

    Google Scholar 

  12. Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: a survey. Handb. Comput. Mol. Biol. 9(1–20), 122–124 (2005)

    Google Scholar 

Download references

Acknowledgements

The work was carried out within the statutory research project of the Institute of Informatics, BK-204/RAU2/2019.

Author information

Authors and Affiliations

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

    Marcin Michalak

Authors
  1. Marcin Michalak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Michalak .

Editor information

Editors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Aleksandra Gruca

  2. Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Gliwice, Poland

    Tadeusz CzachĂłrski

  3. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Sebastian Deorowicz

  4. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Katarzyna Harężlak

  5. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Agnieszka Piotrowska

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Michalak, M. (2020). Induction of Centre-Based Biclusters in Terms of Boolean Reasoning. In: Gruca, A., Czachórski, T., Deorowicz, S., Harężlak, K., Piotrowska, A. (eds) Man-Machine Interactions 6. ICMMI 2019. Advances in Intelligent Systems and Computing, vol 1061 . Springer, Cham. https://doi.org/10.1007/978-3-030-31964-9_23

Download citation

Publish with us

Policies and ethics

Search

Navigation