Autor:

Michalak, Marcin ; Jaksik, Roman ; Ślęzak, Dominik

Współtwórca:

Korbicz, Józef (1951- ) - red. ; Uciński, Dariusz - red.

Tytuł:

Heuristic search of exact biclusters in binary data

Tytuł publikacji grupowej:

AMCS, volume 30 (2020)

Temat i słowa kluczowe:

biclustering ; Boolean reasoning ; prime implicant approximation ; biomedical data analysis ; Johnson heuristic

Abstract:

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.

Wydawca:

Zielona Góra: Uniwersytet Zielonogórski

Data wydania:

2020

Typ zasobu:

artykuł

DOI:

10.34768/amcs-2020-0013

Strony:

161-171

Źródło:

AMCS, volume 30, number 1 (2020) ; kliknij tutaj, żeby przejść

Jezyk:

eng

Licencja CC BY 4.0:

kliknij tutaj, żeby przejść

Prawa do dysponowania publikacją:

Biblioteka Uniwersytetu Zielonogórskiego