Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Boolean Representation for Exact Biclustering

Uproszczony widok
cris.lastimport.scopus2024-02-12T19:31:00Z
dc.abstract.enBiclustering is a branch of data analysis, whereby the goal is to find two–dimensional subgroups in a matrix of scalars. We introduce a new approach for biclustering discrete and binary matrices on the basis of boolean function analysis. We draw the correspondence between non–extendable (maximal with respect to inclusion) exact biclusters and prime implicants of a discernibility function describing the data. We present also the results of boolean-style clustering of the artificial discrete image data. Some possibilities of utilizing basic image processing techniques for this kind of input to the biclustering problem are discussed as well.
dc.affiliationUniwersytet Warszawski
dc.contributor.authorŚlęzak, Dominik
dc.contributor.authorMichalak, Marcin
dc.date.accessioned2024-01-24T18:40:50Z
dc.date.available2024-01-24T18:40:50Z
dc.date.issued2018
dc.description.financeNie dotyczy
dc.description.number3
dc.description.volume161
dc.identifier.doi10.3233/FI-2018-1703
dc.identifier.issn0169-2968
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/102456
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofFundamenta Informaticae
dc.relation.pages275-297
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleBoolean Representation for Exact Biclustering
dc.typeJournalArticle
dspace.entity.typePublication