Year Year arrow
arrow-active-down-0
Publisher Publisher arrow
arrow-active-down-1
Journal
1
Journal arrow
arrow-active-down-2
Institution Institution arrow
arrow-active-down-3
Institution Country Institution Country arrow
arrow-active-down-4
Publication Type Publication Type arrow
arrow-active-down-5
Field Of Study Field Of Study arrow
arrow-active-down-6
Topics Topics arrow
arrow-active-down-7
Open Access Open Access arrow
arrow-active-down-8
Language Language arrow
arrow-active-down-9
Filter Icon Filter 1
Year Year arrow
arrow-active-down-0
Publisher Publisher arrow
arrow-active-down-1
Journal
1
Journal arrow
arrow-active-down-2
Institution Institution arrow
arrow-active-down-3
Institution Country Institution Country arrow
arrow-active-down-4
Publication Type Publication Type arrow
arrow-active-down-5
Field Of Study Field Of Study arrow
arrow-active-down-6
Topics Topics arrow
arrow-active-down-7
Open Access Open Access arrow
arrow-active-down-8
Language Language arrow
arrow-active-down-9
Filter Icon Filter 1
Export
Sort by: Relevance
  • New
  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.295
Modular Local Classification via Cluster-Guided Feature Selection in Tabular Data
  • Dec 29, 2025
  • Acta Informatica Pragensia
  • Leila Boussaad

  • New
  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.293
Evaluating AI Text Detection Tools for Distinguishing Human-Written from AI-Generated Abstracts in Persian-Language Journals of Library and Information Science
  • Dec 29, 2025
  • Acta Informatica Pragensia
  • Amrollah Shamsi + 3 more

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.283
Personalized Learning Analytics Through Static Code Analysis in Computer Science Education
  • Aug 27, 2025
  • Acta Informatica Pragensia
  • Marek Horváth + 2 more

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.281
Analysis of Benford's Law Conformity with Web of Science Citations of Documents
  • Aug 11, 2025
  • Acta Informatica Pragensia
  • David Jiri Slosar

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.276
Systematic Review on Algorithmic Trading
  • Aug 9, 2025
  • Acta Informatica Pragensia
  • David Jukl + 1 more

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.277
DORA: Dionaea Observation and Data Collection Analysis for Real-Time Cyberattack Surveillance and Threat Intelligence
  • Aug 8, 2025
  • Acta Informatica Pragensia
  • Hartinah Hartinah + 3 more

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.275
In-Memory Versus Disk-Based Computing with Random Forest for Stock Analysis: A Comparative Study
  • Aug 6, 2025
  • Acta Informatica Pragensia
  • Chitra Joshi + 3 more

Background: The advancement of big data analytics calls for careful selection of processing frameworks to optimize machine learning effectiveness. Choosing the appropriate framework can significantly influence the speed and accuracy of data analysis, ultimately leading to more informed decision making. In adapting to this changing landscape, businesses should focus on factors such as how well a system scales, how easily it can be used and how effectively it integrates with their existing tools. The effectiveness of these frameworks plays a crucial role in determining data processing speed, model training efficiency and predictive accuracy. As data become increasingly large, diverse and fast-moving, conventional processing systems often fall short of the performance required for modern analytics.Objective: This research seeks to thoroughly assess the performance of two prominent big data processing frameworks-Apache Spark (in-memory computing) and MapReduce (disk-based computing)-with a focus on applying random forest algorithms to predict stock prices. The primary objective is to assess and compare their effectiveness in handling large-scale financial datasets, focusing on key aspects such as predictive accuracy, processing speed and scalability.Methods: The investigation uses the MapReduce methodology and Apache Spark independently to analyse a substantial stock price dataset and to train a random forest regressor. Mean squared error (MSE) and root mean square error (RMSE) were employed to assess the primary performance indicators of the models, while mean absolute error (MAE) and the R-squared value were used to evaluate the goodness of fit of the models.Results: The RMSE, MAE and MSE obtained for the Spark-based implementation were lower, compared to the MapReduce-based implementation, although these low values indicate high prediction accuracy. It also had a big impact on the time it took to train and run models because of its optimized in-memory processing. As opposed to this, the MapReduce approach had higher latency and lower accuracy, reflecting its disk-based constraints and reduced efficiency for iterative machine learning tasks.Conclusion: The conclusion supports the fact that Spark is the better option for complex machine learning tasks such as stock price prediction, as it is good for handling large amounts of data. MapReduce is still a reliable framework but not fast enough to process and not lightweight enough for analytics that are too rapid and iterative. The outcomes of this study are helpful for data scientists and financial analysts to choose the most appropriate framework for big data machine learning applications.

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.284
Theory and Practice of Generative Artificial Intelligence Usage
  • Jul 26, 2025
  • Acta Informatica Pragensia
  • David Chudan + 1 more

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.278
Student Perceptions and Preferences in Personalized AI-driven Learning
  • Jul 7, 2025
  • Acta Informatica Pragensia
  • Marta Slepankova + 5 more

  • Open Access Icon
  • Research Article
  • 10.18267/j.aip.269
Generative Artificial Intelligence in Ubiquitous Learning: Evaluating a Chatbot-based Recommendation Engine for Personalized and Context-aware Education
  • Jul 1, 2025
  • Acta Informatica Pragensia
  • Manel Guettala + 3 more