scholarly journals Implementing Hidden Markov Model to Predict Foreign Exchange Movement

Author(s):  
Tri Swasono Himawan ◽  
Tutuk Indriyani ◽  
Weny Mistarika Rahmawati

Investment refers to personal bussiness. So many people have got profit from investment both real and non real sectors. Foreign Exchange (FOREX) is the example of non real sector. The currency fluctuation of FOREX usually occurs and this causes many investors fooled by the pattern of currency fluctuation. Finally, they get lost and even lost capital. Hidden Markov Model was implemented in this research to predict the movement of FOREX of 8 currencies. The data were trained by Baum-Welch algorithm and predicted by Forward algorithm. The trial obtained the average MAPE (Mean Absolute Precentage Error) of 8 currencies which was relatively small (0.0038082% belongs to high and 0.0040706% belongs to low), less than 1%. The currency of USD/IDR has the smallest error score among the other tested currencies. Its average MAPE was 0.0032624% and the average deviation was 42. Thus, this system is well proven to predict the movement of currency.

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2392
Author(s):  
Óscar Belmonte-Fernández ◽  
Emilio Sansano-Sansano ◽  
Antonio Caballer-Miedes ◽  
Raúl Montoliu ◽  
Rubén García-Vidal ◽  
...  

Indoor localization is an enabling technology for pervasive and mobile computing applications. Although different technologies have been proposed for indoor localization, Wi-Fi fingerprinting is one of the most used techniques due to the pervasiveness of Wi-Fi technology. Most Wi-Fi fingerprinting localization methods presented in the literature are discriminative methods. We present a generative method for indoor localization based on Wi-Fi fingerprinting. The Received Signal Strength Indicator received from a Wireless Access Point is modeled by a hidden Markov model. Unlike other algorithms, the use of a hidden Markov model allows ours to take advantage of the temporal autocorrelation present in the Wi-Fi signal. The algorithm estimates the user’s location based on the hidden Markov model, which models the signal and the forward algorithm to determine the likelihood of a given time series of Received Signal Strength Indicators. The proposed method was compared with four other well-known Machine Learning algorithms through extensive experimentation with data collected in real scenarios. The proposed method obtained competitive results in most scenarios tested and was the best method in 17 of 60 experiments performed.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yanxue Zhang ◽  
Dongmei Zhao ◽  
Jinxing Liu

The biggest difficulty of hidden Markov model applied to multistep attack is the determination of observations. Now the research of the determination of observations is still lacking, and it shows a certain degree of subjectivity. In this regard, we integrate the attack intentions and hidden Markov model (HMM) and support a method to forecasting multistep attack based on hidden Markov model. Firstly, we train the existing hidden Markov model(s) by the Baum-Welch algorithm of HMM. Then we recognize the alert belonging to attack scenarios with the Forward algorithm of HMM. Finally, we forecast the next possible attack sequence with the Viterbi algorithm of HMM. The results of simulation experiments show that the hidden Markov models which have been trained are better than the untrained in recognition and prediction.


Author(s):  
Chit San Lwin ◽  
Xiangqian Wu

This paper presents a new segmentation and recognition algorithms for Myanmar script inputted from offline printed images. Zone segmentation considers horizontal and vertical zones; it is applied to segment letters according to their roles such as primary or peripheral characters. In doing so, statistical and structural features of segmented characters are explored and exploited in recognition process. Hidden Markov model is used for recognition of primary characters while Kohonen self-organization map is used for peripheral characters. The recognized characters by each model are then combined, and finally are recognized by k-nearest neighbors algorithm with the help of lexicon is composed of all common Myanmar characters. Our OCR system for Myanmar characters tested on a dataset that approximately contains 7560 compounded characters. From the results, our system achieves higher significant results both segmentation and recognition compared to the other contemporary Myanmar OCR’s approaches.


2012 ◽  
Vol 132 (10) ◽  
pp. 1589-1594 ◽  
Author(s):  
Hayato Waki ◽  
Yutaka Suzuki ◽  
Osamu Sakata ◽  
Mizuya Fukasawa ◽  
Hatsuhiro Kato

Sign in / Sign up

Export Citation Format

Share Document