Efficiently Predicting Frequent Patterns over Uncertain Data Streams
Chuan-Ming Liu, Kuan-Teng Liao · Procedia Computer Science · 2019
In recent decades, frequent pattern mining has become popular in real time computing because it helps users extract meaningful business or technical trends over uncertain data streams. Generally, mainstream frequent pattern mining approaches can accurately explore frequent patterns whether the approaches are used in expected support or probabilistic frequentness mechanisms. However, whichever are implemented, they all have time issues when extracting frequent patterns if there exists a volume of data tuples in each time instance. To explore frequent patterns over uncertain data streams efficiently, we propose a predicted approach for forecasting frequent patterns with hidden Markov models. The model consists of a construction phase and a testing phase. In the former phase, the hidden Markov model is constructed by the history of past data, and in the latter phase, the results of evaluations and adjustments of transition probabilities occur. By constructing models of patterns, frequent patterns can be easily obtained. Experimental results show the proposed approach can save time cost when exploring frequent patterns and provide approximate 72% average accuracy in 50 sequential predictions; thereby, our approach can efficiently and accurately predict frequent patterns over uncertain data streams.