Abstract
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.
| Original language | English |
|---|---|
| Pages | 274-275 |
| Number of pages | 2 |
| State | Published - 2015 |
| Externally published | Yes |
| Event | 11th French Speaking Symposium on Constraint Programming, JFPC 2015 - Bordeaux, France Duration: 22 Jun 2015 → 24 Jun 2015 |
Conference
| Conference | 11th French Speaking Symposium on Constraint Programming, JFPC 2015 |
|---|---|
| Country/Territory | France |
| City | Bordeaux |
| Period | 22/06/15 → 24/06/15 |
Fingerprint
Dive into the research topics of 'Computation of skypattern cubes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver