Skip to main content

Gene Trajectory Clustering for Learning the Stock Market Sectors

  • Conference paper
Adaptive and Natural Computing Algorithms (ICANNGA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5495))

Included in the following conference series:

Abstract

Hybrid Gene Trajectory Clustering (GTC) algorithm [1,2] proves to be a good candidate to cluster multi-dimensional noisy time series. In this paper we apply the hybrid GTC to learn the structure of the stock market and to infer interesting relationships out of closing prices data. We conclude that hybrid GTC can successfully identify homogeneous and stable stock clusters and these clusters can further help the investors.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Chan, Z.S.H., Kasabov, N.K.: Gene trajectory clustering with a hybrid genetic algorithm and expectation maximization method. In: Proceedings of 2004 IEEE International Joint Conference on Neural Networks, 2004, vol. 3, pp. 1669–1674. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  2. Chan, Z.S.H., Kasabov, N.K., Collins, L.: A hybrid genetic algorithm and expectation maximization method for global gene trajectory clustering. J. Bioinformatics and Computational Biology 3(5), 1227–1242 (2005)

    Article  Google Scholar 

  3. Schoenfeld, S.A.: Active Index Investing: Maximizing Portfolio Performance and Minimizing Risk Through Global Index Strategies, 1st edn. Wiley, Chichester (2004)

    Google Scholar 

  4. Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. Technical report, No. 99-15, University of California, Irvine (1999)

    Google Scholar 

  5. McLachlan, G., Krishnan, T.: The EM Algorithm and Extensions. John Wiley and Sons, Chichester (1997)

    MATH  Google Scholar 

  6. Elton, E.J., Gruber, M.J., Brown, S.J., Goetzmann, W.N.: Modern Portfolio Theory and Investment Analysis. Wiley, Chichester (2006)

    Google Scholar 

  7. Gavrilov, M., Anguelov, D., Indyk, P., Matwani, R.: Mining the stock market (extended abstract): which measure is best? In: KDD 2000: Proceedings of the sixth ACM SIGKDD international conference on knowledge discovery and data mining, pp. 487–496. ACM, New York (2000)

    Chapter  Google Scholar 

  8. Doherty, K.A., Adams, R.G., Davey, N., Pensuwon, W.: Hierarchical topological clustering learns stock market sectors. In: ICSC Congress on Computational Intelligence Methods and Applications, 2005. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moldovan, D., Silaghi, G.C. (2009). Gene Trajectory Clustering for Learning the Stock Market Sectors. In: Kolehmainen, M., Toivanen, P., Beliczynski, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2009. Lecture Notes in Computer Science, vol 5495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04921-7_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04921-7_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04920-0

  • Online ISBN: 978-3-642-04921-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics