• 検索結果がありません。

JAIST Repository: 予測株価を用いた投資行動の最適化手法に関する研究

N/A
N/A
Protected

Academic year: 2021

シェア "JAIST Repository: 予測株価を用いた投資行動の最適化手法に関する研究"

Copied!
3
0
0

読み込み中.... (全文を見る)

全文

(1)

Japan Advanced Institute of Science and Technology

JAIST Repository

https://dspace.jaist.ac.jp/ Title 予測株価を用いた投資行動の最適化手法に関する研究 Author(s) 山田, 幸治 Citation Issue Date 2014-09

Type Thesis or Dissertation Text version author

URL http://hdl.handle.net/10119/12271 Rights

(2)

1

Optimization of investment decisions using investor's

utility and a probability distribution of stocks price

obtained by machine learning

Koji Yamada (1110955) School of Information Science,

Japan Advanced Institute of Science and Technology August 9, 20141

Keywords: Machine learning, k-Nearest Neighbor, Optimization, Prospect Theory, Automated trading, Finance.

Decision making is very interesting topic. Since our life greatly depends on the quality of our choice, decision making is always a top concern. Earnest research on decision making has been conducted so far. In this paper we will try to get some new findings about decision making by using latest technologies from Artificial Intelligence, economics and finance.

Financial market is one of the situations where the decision making will be seriously important. Various studies on how to analyze a financial market and how to make a best decision have been done. For example, William Forsyth Sharpe established CAPM (Capital Asset Pricing Model) in 1960s. Stephen Ross proposed the Multi-Factor Model and APT (Arbitrage Pricing Theory) in 1976. Expected utility by John von Neumann and Oskar Morgenstern in 1944 and Prospect theory by Daniel Kahneman and Amos Tversky in 1979 are the theories for decision making.

In engineering field, with the development of computer science, we can afford a large number of calculations in very short period of time.

(3)

2

Several kinds of algorithms to analyze a large amount of data have been developed. For instance, Clustering, Association Rule, k-Nearest Neighbor, Decision Tree, Neural Network, Support Vector Machine (SVM) and Reinforcement Learning.

This paper will target the financial market and propose a high performance trading agent that has the special ability to analyze data and to optimize the investor's utility (the feeling of satisfaction). Firstly, I will introduce k-Nearest Neighbor which is used as an analysis tool. It can predict a probability distribution of future stock prices, based on the past data. Secondly, three different kinds of method such as average, voting and Prospect utility are applied to optimize a decision making. We describe several techniques to adjust several best parameters (k in k-NN, α-β-λ in value function) needed in the decision making algorithms. Finally, in order to verify the performance of these proposals, we use actual market data like TOPIX. As a result, this research shows that these methods can lead to a good result (profit).

参照

関連したドキュメント

In the case of the former, simple liquidity ratios such as credit-to-deposit ratios nett stable funding ratios, liquidity coverage ratios and the assessment of the gap

The notion of free product with amalgamation of groupoids in [16] strongly influenced Ronnie Brown to introduce in [5] the fundamental groupoid on a set of base points, and so to give

The notion of free product with amalgamation of groupoids in [16] strongly influenced Ronnie Brown to introduce in [5] the fundamental groupoid on a set of base points, and so to give

The Mathematical Society of Japan (MSJ) inaugurated the Takagi Lectures as prestigious research survey lectures.. The Takagi Lectures are the first se- ries of the MSJ official

The Mathematical Society of Japan (MSJ) inaugurated the Takagi Lectures as prestigious research survey lectures.. The Takagi Lectures are the first series of the MSJ official

I give a proof of the theorem over any separably closed field F using ℓ-adic perverse sheaves.. My proof is different from the one of Mirkovi´c

Keywords: continuous time random walk, Brownian motion, collision time, skew Young tableaux, tandem queue.. AMS 2000 Subject Classification: Primary:

Section 3 is first devoted to the study of a-priori bounds for positive solutions to problem (D) and then to prove our main theorem by using Leray Schauder degree arguments.. To show