( en | de | ru )

 

Disambiguation of "Rigotti, Christophe"

Author of the publication

copydeleteadd this publication to your clipboard
Free-sets: a condensed representation of boolean data for the approximation of frequency queries

, , and . Data Mining and Knowledge Discovery, 7 (1): 5--22 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Rigotti

Erina Teresa Rigotti

Christophe Bobda

Christophe Kunze

Christophe Huber

 

Other publications of authors with the same name

Query-Driven Knowledge Discovery via OLAP manipulations., , and . BDA, (2001)Résolution et Classification pour l'Optimisation Sémantique de Requêtes dans les BDOO Déductives., , and . BDA, page 323-. INRIA, (1995)Extending Datalog for Ordered Multidimensional Databases., , and . DDLP, GMD - German National Research Center for Information Technology, (1997)F-Logic Programming and Terminological Constraints., , and . ICLP Workshop: Integration of Declarative Paradigms, page 1-11. Max-Planck-Institut für Informatik, Saarbrücken, Germany, (1994)Approximation of frequency queries by means of free-sets, , and . Principles of Data Mining and Knowledge Discovery, Springer, (2000)Representing and Reasoning on Conceptual Queries Over Image Databases., and . ISMIS, volume 1609 of Lecture Notes in Computer Science, page 340-348. Springer, (1999)Approximation du score CFOF de détection d'anomalie dans un arbre d'indexation iSAX : Application au contexte SI de la SNCF., , , and . EGC, volume E-35 of RNTI, page 165-176. Éditions RNTI, (2019)Extracting Trees of Quantitative Serial Episodes., and . KDID, volume 4747 of Lecture Notes in Computer Science, page 170-188. Springer, (2006)Iterative summarization of satellite image time series., , , , and . IGARSS, page 1425-1428. IEEE, (2014)Weight-based search to find clusters around medians in subspaces., , , and . SAC, page 471-480. ACM, (2018)