Using finite transducers for describing and synthesising structural time-series constraints

We describe a large family of constraints for structural time series by means of function composition. These constraints are on aggregations of features of patterns that occur in a time series, such as the number of its peaks, or the range of its steepest ascent. The patterns and features are usually linked to physical properties of the time series generator, which are important to capture in a constraint model of the system, i.e. a conjunction of constraints that produces similar time series. We formalise the patterns using finite transducers, whose output alphabet corresponds to semantic values that precisely describe the steps for identifying the occurrences of a pattern. Based on that description, we automatically synthesise automata with accumulators, as well as constraint checkers. The description scheme not only unifies the structure of the existing 30 time-series constraints in the Global Constraint Catalogue, but also leads to over 600 new constraints, with more than 100,000 lines of synthesised code.

[1]  Mats Carlsson,et al.  On the reification of global constraints , 2012, Constraints.

[2]  Nikolaj Bjørner,et al.  Symbolic finite state transducers: algorithms and applications , 2012, POPL '12.

[3]  Steve Linton,et al.  Generating custom propagators for arbitrary constraints , 2014, Artif. Intell..

[4]  Steven P. Abney.  Partial parsing via finite-state cascades , 1996, Natural Language Engineering.

[5]  Nicolas Beldiceanu,et al.  Global Constraint Catalog, 2nd Edition (revision a) , 2012 .

[6]  Lior Rokach,et al.  Data Mining And Knowledge Discovery Handbook , 2005 .

[7]  T. Warren Liao,et al.  Clustering of time series data - a survey , 2005, Pattern Recognit..

[8]  Luc De Raedt,et al.  Itemset mining: A constraint programming perspective , 2011, Artif. Intell..

[9]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[10]  Mats Carlsson,et al.  SICStus Prolog User''s Manual , 1993 .

[11]  Leland Wilkinson,et al.  TimeExplorer: Similarity Search Time Series by Their Signatures , 2013, ISVC.

[12]  Andrew Harvey,et al.  Forecasting, Structural Time Series Models and the Kalman Filter. , 1991 .

[13]  Tak-Chung Fu,et al.  A review on time series data mining , 2011, Eng. Appl. Artif. Intell..

[14]  Haixun Wang,et al.  Landmarks: a new model for similarity-based pattern querying in time series databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[15]  Eljas Soisalon-Soininen,et al.  Elements of Language Theory , 1988 .

[16]  Dina Q. Goldin,et al.  On Similarity Queries for Time-Series Data: Constraint Specification and Implementation , 1995, CP.

[17]  Pierre Flener,et al.  Toward sustainable development in constraint programming , 2013, Constraints.

[18]  David S. Fung,et al.  Methods for the estimation of missing values in time series , 2006 .

[19]  Helmut Simonis,et al.  Describing and Generating Solutions for the EDF Unit Commitment Problem with the ModelSeeker , 2013, CP.

[20]  Helmut Simonis,et al.  A Constraint Seeker: Finding and Ranking Global Constraints from Examples , 2011, CP.

[21]  Mats Carlsson,et al.  Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators , 2014, CP.

[22]  Nicolas Beldiceanu,et al.  Global Constraint Catalog , 2005 .

[23]  Eamonn Keogh.  Mining Time Series Data , 2005 .

[24]  Mats Carlsson,et al.  Reformulation of Global Constraints Based on Constraints Checkers , 2005, Constraints.

[25]  Mats Carlsson,et al.  Global Constraint Catalogue: Past, Present and Future , 2007, Constraints.

[26]  Helmut Simonis,et al.  A Model Seeker: Extracting Global Constraint Models from Positive Examples , 2012, CP.