Skip to main navigation Skip to search Skip to main content

Computation of skypattern cubes

  • Willy Ugarte
  • , Patrice Boizumault
  • , Samir Loudni
  • , Bruno Crémilleux
  • University of Caen Basse-Normandie

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages274-275
Number of pages2
StatePublished - 2015
Externally publishedYes
Event11th French Speaking Symposium on Constraint Programming, JFPC 2015 - Bordeaux, France
Duration: 22 Jun 201524 Jun 2015

Conference

Conference11th French Speaking Symposium on Constraint Programming, JFPC 2015
Country/TerritoryFrance
CityBordeaux
Period22/06/1524/06/15

Fingerprint

Dive into the research topics of 'Computation of skypattern cubes'. Together they form a unique fingerprint.

Cite this