Skip to main content

Abstract

This paper addresses the problem of dependency mining in large sets. The first goal is to determine and reduce the dimension of data using principal component analysis. The second is to group variables into several classes using Kohonen’s self-organizing maps and then the K-means algorithm. Evaluations have been performed on 350 financial trading rules (variables) observed in a period of 1300 instants (observations). It was shown that the rules are strongly correlated, all of which can be reproduced from 150 generators with an accuracy of 95%. Moreover, the initial set of 350 rules was subdivided into 23 classes of similar rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colby, W., Meyers, T., “The Encyclopedia of Technical Market Indicators”, Down Jones-Irwin, 1990.

    Google Scholar 

  2. Jolliffe, I., T., “Principal Component Analysis”, Springer, 1986.

    Google Scholar 

  3. Kohonen, T., “Self-Organizing Maps”, Series in Information Science, Vol. 30. Heidelberg, Springer, Second ed. 1997.

    Google Scholar 

  4. Korczak, J., Lipinski, P., Roger, P., “Evolution Strategy in Portfolio Optimization”, Artificial Evolution, ed. P. Collet, Lecture Notes in Computer Science, vol. 2310, Springer, 2002, pp. 156–167.

    Google Scholar 

  5. Korczak, J., Roger, P., “Stock timing using genetic algorithms”, Applied Stochastic Models in Business and Industry, 2002, pp. 121–134.

    Google Scholar 

  6. Murphy, J., “Technical Analysis of the Financial Markets”, NUIF, 1998.

    Google Scholar 

  7. Vesanto, J., Himberg, J., Alhoniemi E., Parhankangas, J., “SOM Toolbox for Matlab 5”, SOM Toolbox Team, Helsinki University of Technology, Finland, Libella Oy Espoo (http://www.cis.hut.fi/projects/somtoolbox).

    Google Scholar 

  8. Weigend, A., S., Gershenfeld, N., A., “Time Series Prediction: Forecasting the Future and Understanding the Past”, Addison-Wesley, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Lipinski, P. (2005). Dependency Mining in Large Sets of Stock Market Trading Rules. In: Pejaś, J., Piegat, A. (eds) Enhanced Methods in Computer Security, Biometric and Artificial Intelligence Systems. Springer, Boston, MA. https://doi.org/10.1007/0-387-23484-5_32

Download citation

  • DOI: https://doi.org/10.1007/0-387-23484-5_32

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7776-0

  • Online ISBN: 978-0-387-23484-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics