Year: 2018
Type: conference-paper
Abstract: Weighted moving average (WMA) is extensively used for short term forecasting to remove random fluctuations in cyclical data. However, it is susceptible to the number of previous observations (window size), used to predict the next element. A large value of window size increases the model risk whereas a smaller one poses parameter risk. For training data size of N, checking the window size ranging from 2 to N-1 needs O(N 3 ) time. In this paper, we propose MRF (Map Reduce based forecasting algorithm), which checks the possible window values in parallel and reduces the time complexity to O(N 2 ). The algorithm meticulously designs < key, value > for each window size, which distributes the job equally in the reduce phase. We have shown MRF to be the correct implementation of sequential algorithm. Extensive experiments were performed on MRF. The predicted values for real life meteorological and computing datasets generated using MRF are highly correlated to actual ones. Real and predicted are also validated using paired sample t tests. Results on synthetic data exhibits scalability of MRF algorithm.
Source: Procedia Computer Science
Authors: Ankita Sinha, Prasanta K. Jana
Institution: Indian Institute of Technology Dhanbad
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Award: G2361849722
OpenAlex ID: W2807372743
