Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Journal of Applied Data Sciences

Harnessing the Power of Prophet Algorithm for Advanced Predictive Modeling of Grab Holdings Stock Prices Hery, Hery; Haryani, Calandra A.; Widjaja, Andree E.; Mitra, Aditya Rama
Journal of Applied Data Sciences Vol 5, No 2: MAY 2024
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v5i2.181

Abstract

This study investigates the effectiveness of the Prophet algorithm in predicting Grab Holdings' stock prices dataset from Kaggle. By meticulously analyzing historical closing, high, low, and volume data, the research aims to uncover market patterns and gain insights into investor sentiment based on short-term forecasting. The findings reveal a dynamic trajectory for Grab Holdings' stock, characterized by significant fluctuations and evolving investor confidence. The stock reached a peak of $14 in early 2022, indicating optimism, but subsequently experienced a decline to $4 by late 2023, reflecting a shift in sentiment. Notably, 2023 witnessed heightened volatility compared to 2022, evident in more significant price swings and increased trading volume. The Prophet algorithm demonstrated promising potential for prediction better than traditional methods, which overlook the presence of seasonality or fail to adapt to evolving market conditions, leading to less accurate forecasts. The excellent performance of Prophet is indicated by a Mean Absolute Percentage Error (MAPE) of 10.45511%, a Mean Absolute Error (MAE) of 3.112026, and a Root Mean Squared Error (RMSE) of 3.516969. Compared to the traditional ARIMA, MAE and RMSE resulting from Prophet are much lower than their counterparts, which are 14.49675 and 16.079898, respectively. These widely used metrics suggest moderate accuracy in predicting future stock prices. This research offers valuable insights for investors that they can use to understand the trend of Grab Holdings' stock price and make more informed investment decisions regarding buying or selling opportunities. However, it is crucial to acknowledge the inherent limitations of such models and interpret results cautiously, considering the ever-changing dynamics of the financial market.
Unsupervised Learning for MNIST with Exploratory Data Analysis for Digit Recognition Hery, Hery; Haryani, Calandra A.; Widjaja, Andree E.; Tarigan, Riswan E.; Aribowo, Arnold
Journal of Applied Data Sciences Vol 5, No 2: MAY 2024
Publisher : Bright Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47738/jads.v5i2.184

Abstract

This research investigates the application of unsupervised learning techniques for digit recognition using the MNIST dataset. Through a comparative analysis, various dimensionality reduction methods, including ISOmap, PCA, and tSNE, were evaluated for their effectiveness in visualizing and processing the MNIST data. The findings reveal that tSNE consistently outperforms ISOmap and PCA in terms of accuracy, F1- score, precision, and recall, showcasing its superior capability in preserving relevant information within the dataset. Utilizing tSNE for visualizing and clustering digits provides valuable insights into the underlying structure of the dataset, uncovering complex patterns in digit relationships. These results contribute to the advancement of digit recognition systems, offering potential improvements in classification accuracy and model reliability. The success of tSNE highlights the importance of nonlinear dimensionality reduction techniques in handling complex datasets, such as MNIST. This research underscores the significance of unsupervised learning approaches, particularly tSNE, in enhancing digit recognition systems' performance, with implications extending across various application domains. Continued research is recommended to explore further applications and potentials of unsupervised learning techniques and to deepen our understanding of the MNIST dataset's structure and complexity.