Foundations of Rough Biclustering

  • Marcin Michalak
Conference paper

DOI: 10.1007/978-3-642-29350-4_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7268)
Cite this paper as:
Michalak M. (2012) Foundations of Rough Biclustering. In: Rutkowski L., Korytkowski M., Scherer R., Tadeusiewicz R., Zadeh L.A., Zurada J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2012. Lecture Notes in Computer Science, vol 7268. Springer, Berlin, Heidelberg

Abstract

Amongst the algorithms for biclustering using some rough sets based steps none of them uses the formal concept of rough bicluster with its lower and upper approximation. In this short article the new foundations of rough biclustering are described. The new relation β generates β −description classes that build the rough bicluster defined with its lower and upper approximation.

Keywords

rough sets biclustering upper and lower approximation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Marcin Michalak
    • 1
  1. 1.Silesian University of TechnologyGliwicePoland

Personalised recommendations