Dependency mining in large sets of stock market trading rules

  • Authors:
  • Piotr Lipinski

  • Affiliations:
  • Institute of Computer Science, University of Wroclaw, Wroclaw, Poland and LSIIT, CNRS, Université Louis Pasteur, Strasbourg, France

  • Venue:
  • Enhanced methods in computer security, biometric and artificial intelligence systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.