Accelerated algorithm for computation of all prime patterns in logical analysis of data - Université d'Angers
Communication Dans Un Congrès Année : 2019

Accelerated algorithm for computation of all prime patterns in logical analysis of data

Résumé

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.
Fichier principal
Vignette du fichier
pattern_computation (1).pdf (169.03 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02557441 , version 1 (13-10-2021)

Licence

Identifiants

Citer

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⟩
143 Consultations
76 Téléchargements

Altmetric

Partager

More