- Tytuł:
- Heuristic search of exact biclusters in binary data
- Autorzy:
-
Michalak, Marcin
Jaksik, Roman
Ślęzak, Dominik - Powiązania:
- https://bibliotekanauki.pl/articles/329789.pdf
- Data publikacji:
- 2020
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
biclustering
Boolean reasoning
prime implicant approximation
biomedical data analysis
Johnson heuristic - Opis:
- 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 model of Boolean reasoning, in which finding biclusters in binary or discrete data comes down to the problem of finding prime implicants of some Boolean function. Due to the high computational complexity of this task, the application of some heuristics should be considered. In the paper, a modification of the well-known Johnson strategy for prime implicant approximation induction is presented, which is necessary for the biclustering problem. The new method is applied to artificial and biomedical datasets.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 161-171
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł