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

TitreAccelerated algorithm for computation of all prime patterns in logical analysis of data
Type de publicationCommunication
TypeCommunication avec actes dans un congrès
Année2019
LangueAnglais
Date du colloque19-21/02/2019
Titre du colloque8th International, Conference on Pattern Recognition Applications and Methods (ICPRAM)
Titre des actes ou de la revue Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods : ICPRAM
Volume1
Pagination210-220
AuteurChambon, Arthur , Boureau, Tristan , Lardeux, Frédéric , Saubion, Frédéric
PaysTchèque, République
EditeurSciTePress
VillePrague
ISBN978-989-758-351-3
Mots-clésLogical analysis of data, Logical Characterization of Data., Pattern Generation
Résumé en anglais

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.

URL de la noticehttp://okina.univ-angers.fr/publications/ua19209
DOI10.5220/0007389702100220
Lien vers le document en ligne

http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/000738970...