Abstract

A bicluster consists of a subset of rows and columns of a given matrix, whose intersection defines the region (bicluster) of values of precisely defined condition. Through the decades, a variety of biclustering techniques have been successfully developed. Recently, it was proved that many possible patterns defined in two-dimensional data could be found with the application of Boolean reasoning. The provided theorems showed that any existing pattern in the data could be unequivocally encoded as an implicant of a proper Boolean function. Moreover, a prime implicant of that function encoded the inclusion-maximal (non-extendable) pattern. On the other hand, the definition of some two-dimensional patterns may be easily extended to three-dimensional patterns (triclusters) as well as to any number of dimensions (n-clusters). This paper presents a new approach for searching for three- and higher-dimensional simple patterns in continuous data with Boolean reasoning. Providing the definition of the Boolean function for this tasks, it is shown that the similar correspondence—implicants encode patterns, and prime implicants encode inclusion-maximal patterns—has a strong mathematical background: the proofs of appropriate theorems are also presented in this paper.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.