Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal.univ-angers.fr/hal-02557441
Contributor : Okina Université d'Angers Connect in order to contact the contributor
Submitted on : Wednesday, October 13, 2021 - 11:00:41 AM
Last modification on : Wednesday, November 3, 2021 - 6:07:20 AM

File

pattern_computation (1).pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

Collections

Citation

Arthur Chambon, Frédéric Lardeux, Frédéric Saubion, Tristan Boureau. Accelerated algorithm for computation of all prime patterns in logical analysis of data. 8th International, Conference on Pattern Recognition Applications and Methods (ICPRAM), 2019, Prague, Czech Republic. pp.210-220, ⟨10.5220/0007389702100220⟩. ⟨hal-02557441⟩

Share

Metrics

Record views

128

Files downloads

11