Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/1689599.1689706guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Neighborhood counting for financial time series forecasting

Published: 18 May 2009 Publication History

Abstract

Time series data abound and analysis of such data is challenging and potentially rewarding. One example is financial time series analysis. Most of the intelligent data analysis methods can be applied in principle, but evolutionary computing is becoming increasingly popular and powerful.
In this paper we focus on one task of financial time series analysis - stock price forecasting based on historical data. The premise of this task is that the current price of a stock is dependent on the price of the same stock in the past. Here we consider an additional assumption, i.e., time dependency relevance, that the price in the nearer past is more relevant to the current price than that in the more distant past. This assumption appears intuitively sound, but needs formally validated. In this paper we set to test this assumption by introducing time weighting into similarity measures, as similarity is one of the key notions in time series analysis methods including evolutionary computing.
We consider the generic neighborhood counting similarity as it can be specialized for various forms of data by defining the notion of neighborhood in a way that satisfies different requirements. We do so with a view to capturing time weights in time series. This results in a novel time weighted similarity for time series. A formula is also discovered for the similarity so that it can be computed efficiently. Experiments show that this similarity outperforms the standard Euclidean distance and a time weighted variant of it. We conclude that the time dependency relevance assumption is sound.

References

[1]
R. Agrawal, K.-I. Lin, H.S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proc. VLDB95, 1995.
[2]
D. Berndt and J. Clifford. Using dynamic time warping to find patterns in time series. In AAAI-94 workshop on knowledge discovery in databases, page 229-248, 1994.
[3]
Anthony Brabazon and Michael O'Neill. Biologically Inspired Algorithms for Financial Modelling. Springer, 2006.
[4]
K.K.W. Chu and M.H. Wong. Fast time-series searching with scaling and shifting. In Proc. of PODS-1999: ACM Symp. on Principles of Database Systems, 1999.
[5]
R. Cummins and C. O'Riordan. Evolving local and global weighting schemes in information retrieval. Information Retrieval, 9(3): 311-330, 2006.
[6]
Michel Dacorogna. Changing time scale for short time forecasing in financial markets. Journal of Forecasting, 15: 203-227, 1996.
[7]
G. Das, D. Gunopulos, and H. Mannila. Finding similar time series. In Proc. of PKDD97: Principles of Data Mining and Knowledge Discovery in Databases, pages 88-100, 1997.
[8]
Yi Ding and Xue Li. Time weight collaborative filtering. In Proceedings of the 14th ACM international conference on Information and knowledge management, pages 485-492. ACM Press New York, NY, USA, 2005.
[9]
Christos Faloutsos, R. Agrawal, and A. Swami. Efficient similarity search in seqeunce databases. In Proc. of the Fourth Int. Conf. on Foundations of Data Organizations and Algorithms, pages 1-15, 1993.
[10]
Wikimedia Foundation. Wikipedia: The free encyclopedia. http://www.wikipedia.org.
[11]
Dina Q. Goldin and Paris C. Kanellakis. On similarity queries for time-series data: Constraint specification and implementation. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, volume 976 of Lecture Notes In Computer Science, pages 137-153. Springer-Verlag, 1995.
[12]
Dimitrios Gunopulos and Gautam Das. Time series similarity measures. 2000. Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining.
[13]
Steven GUSTAFSON, Leonardo VANNESCHI, Keijzer Maarten, Tettamanzi Andrea, Collet Pierre, van Hemert Jano, and Tomassini Marco. Operator-based distance for genetic programming: Subtree crossover distance. In Proc. of EuroGP: European conference on genetic programming, pages 178-189, Lausanne, Switzerland, 30 March-1 April 2005. Springer, Berlin.
[14]
Daniel S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of ACM, 24(4): 664-675, 1977.
[15]
T. Kahveci, A. Singh, and A. Gurel. Similarity searching for multiattribute sequences. In Proc. of SSDBM, 2002.
[16]
E. Keogh and S. Kasetty. On the need for time series data mining benchmarks: A survey and empirical demonstration. In Proc. of SIGKDD, 2002.
[17]
Eamonn Keogh and Chotirat Ann Ratanamahatana. Exact indexing of dynamic time warping. Knowledge and Information Systems, 2004.
[18]
S. Kim, S. Park, and W. Chu. An index-based approach for similarity search supporting time warping in large sequence databases. In Proc. of ICDE, 2001.
[19]
J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
[20]
S. Luke. When short runs beat long runs. In Proc. of GECCO-2001: Genetic and Evolutionary Computation Conference, pages 74-80. Morgan Kaufmann, 2001.
[21]
Tripti Negi and Veena Bansal. Time series: Similarity search and its applications. In Proc. ICSCI05, 2005.
[22]
S. Park, W. Chu, J. Yoon, and C. Hsu. Efficient searches for similar subsequences of different lengths in sequence databases. In Proc. of ICDE, pages 23-32, 2000.
[23]
C. S. Perng, H. Wang, S. R. Zhang, and D. Stutt Parker. Landmarks: a new model for similarity-based pattern querying in time series databases. In Proceedings of ICDE, 2000.
[24]
O. Renaud, J.-L. Starck, and F. Murtagh. Wavelet-based combined signal filtering and prediction. IEEE Transactions on Systems, Man, and Cybernetics, B - Cybernetics, 35: 1241-1251, 2005.
[25]
Samuel Steingold, Richard Wherry, and Gregory Piatetsky-Shapiro. Measuring real-time predictive models. In Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM01), 2001. Slides available at http://www.kdnuggests.com/gpspubs/ICDM-2001-RT-measuring-models/index.htm.
[26]
Stanley Smith Stevens. Mathematics, Measurement, and Psychophysics (Handbook of Experimental Psychology). Wiley, 1951.
[27]
Michail Vlachos, Marios Hadjieleftheriou, Dimitrios Gunopulos, and Eamonn Keogh. Indexing multi-dimensional time-series with support for multiple distance measures. In Proceedings of SIGKDD03: ACM International Conference on Data Mining August 24-27, 2003, Washington, DC, USA, 2003.
[28]
H. Wang. Nearest neighbors by neighborhood counting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(6): 942-953, 2006.
[29]
H. Wang and W. Dubitzky. A flexible and robust similarity measure based on contextual probability. In Proceedings of IJCAI'05, pages 27-32, 2005.
[30]
Hui Wang. All common subsequences. In Proc. IJCAI-07, pages 635-640, 2007. Oral presentation.
[31]
Hui Wang, Ivo Düntsch, Günther Gediga, and Andrzej Skowron. Hyperrelations in version space. International Journal of Approximate Reasoning, 36(3): 223-241, 2004.
[32]
Hui Wang and Andreas Weigend. Data mining for financial decision making: an editorial. Journal of Decision Support Systems, 37(4), 2004.
[33]
N. Yazdani and Z. M. Ozsoyogin. Sequence matching of images. In Proc. 9th International Conference on Scientific and Statistical Databases, Stockholm, Sweeden, June 1996.
[34]
B. K. Yi, H. V. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In Proc. of ICDE, pages 201-208, 1998.
  1. Neighborhood counting for financial time series forecasting

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      CEC'09: Proceedings of the Eleventh conference on Congress on Evolutionary Computation
      May 2009
      3356 pages
      ISBN:9781424429585

      Publisher

      IEEE Press

      Publication History

      Published: 18 May 2009

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 0
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 14 Dec 2024

      Other Metrics

      Citations

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media