Heuristic Search of Exact Biclusters in Binary Data
The biclustering of two-dimensional homogeneous data consists in finding a subset of rows and a subset of columns whose intersection provides a set of cells whose values fulfil a specified condition. Usually it is defined as equality or comparability. One of the presented approaches is based on the...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-03-01
|
Series: | International Journal of Applied Mathematics and Computer Science |
Subjects: | |
Online Access: | https://doi.org/10.34768/amcs-2020-0013 |