Financial Time Series Segmentation based on Specialized Binary Tree Representation

[1]  Tak-Chung Fu,et al.  An evolutionary approach to pattern-based time series segmentation , 2004, IEEE Transactions on Evolutionary Computation.

[2]  Tak-chung Fu,et al.  A specialized binary tree for financial time series representation , 2004 .

[3]  Eugene Fink,et al.  Indexing of Compressed Time Series , 2004 .

[4]  Eugene Fink,et al.  Search for Patterns in Compressed Time Series , 2002, Int. J. Image Graph..

[5]  Eamonn J. Keogh,et al.  An online algorithm for segmenting time series , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[6]  Tak-chung Fu,et al.  Flexible time series pattern matching based on perceptually important points , 2001 .

[7]  Padhraic Smyth,et al.  Deformable Markov model templates for time-series pattern matching , 2000, KDD '00.

[8]  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).

[9]  Ashok N. Srivastava,et al.  Data Mining for Features Using Scale-Sensitive Gated Experts , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Jaideep Srivastava,et al.  Event detection from time series data , 1999, KDD '99.

[11]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[12]  Jiawei Han,et al.  Mining Segment-Wise Periodic Patterns in Time-Related Databases , 1998, KDD.

[13]  Heikki Mannila,et al.  Rule Discovery from Time Series , 1998, KDD.

[14]  C. S. Wallace,et al.  Minimum Message Length Segmentation , 1998, PAKDD.

[15]  Jonathan J. Oliver,et al.  Bayesian Approaches to Segmenting A Simple Time Series , 1997 .

[16]  G. F. Bryant,et al.  A new algorithm for segmenting data from time series , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[17]  A. Srivastava,et al.  Improved time series segmentation using gated experts with simulated annealing , 1996, Proceedings of International Conference on Neural Networks (ICNN'96).

[18]  José Carlos Príncipe,et al.  A neighborhood map of competing one step predictors for piecewise segmentation and identification of time series , 1996, Proceedings of International Conference on Neural Networks (ICNN'96).

[19]  Hagit Shatkay,et al.  Approximate queries and representations for large data sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[20]  G. F. Bryant,et al.  A solution to the segmentation problem based on dynamic programming , 1994, 1994 Proceedings of IEEE International Conference on Control and Applications.

[21]  J. Hershberger,et al.  Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .

[22]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .