Please use this identifier to cite or link to this item:
Title: Extreme learning machine based stock prediction with information theory, genetic algorithm and indicator voting mechanism
Authors: Gu, Yi.
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Issue Date: 2011
Abstract: Stock market is one of the most lucrative markets in the world. As such, it has been the center of attraction for researchers and practitioners. So far, some neural network models, such as BP and SVM, have been applied to stock prediction. However, they are either too slow or easy to converge to local optimum, which affects prediction performance. To overcome these limitations, Extreme Learning Machine is studied and applied. The fast speed and high accurate performance relative to SVM proved ELM’s effectiveness and efficiency on time series prediction. To select an optimal set of input variables for ELM, Information Theory and Genetic Algorithm are developed to select a set of optimal input features, by maximizing the relevance between input features and output targets, and minimizing the redundancy between input features themselves, the ELM performance on stock prediction is maximized. Moreover, an Indicator Voting Mechanism is proposed to make the system more robust. Thus, by integrating ELM, Information Theory, Genetic Algorithm and Indicator Voting System, the Stock Prediction System is developed. The experimental results on several stock prediction problems have shown that the system can produce effective recommendations and increase investors’ cumulative wealth by more than market average return.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
2.28 MBAdobe PDFView/Open

Page view(s) 50

checked on Oct 23, 2020

Download(s) 50

checked on Oct 23, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.