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: | Michalak Marcin, Jaksik Roman, Ślęzak Dominik |
---|---|
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 |
Similar Items
-
Biclustering of the Gene Expression Data by Coevolution Cuckoo Search
by: Lu Yin, et al.
Published: (2015-06-01) -
Summarization Of Real Valued Biclusters
by: Subramanian, Hema
Published: (2011) -
Solving Intelligence Analysis Problems using Biclusters
by: Fiaux, Patrick O.
Published: (2014) -
Discovery of overlapping 1-closed biclusters
by: Banerjee, Abhik
Published: (2012) -
Applying spectral biclustering to mortality data
by: Gabriella Piscopo, et al.
Published: (2017-04-01)