Foundations of rough biclustering

Authors:
Marcin Michalak
Affiliations:
Silesian University of Technology, Gliwice, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 4
Cited 0

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Biclustering of Expression Data

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
A novel non-overlapping bi-clustering algorithm for network generation using living cell array data

Bioinformatics
Generating and postprocessing of biclusters from discrete value matrices

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.