Accelerated Algorithm for Computation of All Prime Patterns in Logical Analysis of Data

Abstract

The analysis of groups of binary data can be achieved by logical based approaches. These approaches identify subsets of relevant Boolean variables to characterize observations and may help the user to better understand their properties. In logical analysis of data, given two groups of data, patterns of Boolean values are used to discriminate observations in these groups. In this work, our purpose is to highlight that different techniques may be used to compute these patterns. We present a new approach to compute prime patterns that do not provide redundant information. Experiments are conducted on real biological data.