Resumen
In [[]5], we introduce skypattern cubes and propose an efficient bottom-up approach to compute them. Our approach relies on derivation rules collecting skypatterns of a parent node from its child nodes without any dominance test. Non-derivable skypatterns are computed on the fly thanks to Dynamic CSP. The bottom-up principle enables to provide a concise representation of the cube based on skypattern equivalence classes without any supplementary effort. Experiments on mutagenicity datasets show the effectiveness of our proposal.
| Idioma original | Inglés |
|---|---|
| Páginas | 274-275 |
| Número de páginas | 2 |
| Estado | Publicada - 2015 |
| Publicado de forma externa | Sí |
| Evento | 11th French Speaking Symposium on Constraint Programming, JFPC 2015 - Bordeaux, Francia Duración: 22 jun. 2015 → 24 jun. 2015 |
Conferencia
| Conferencia | 11th French Speaking Symposium on Constraint Programming, JFPC 2015 |
|---|---|
| País/Territorio | Francia |
| Ciudad | Bordeaux |
| Período | 22/06/15 → 24/06/15 |