Incremental association rule mining based on matrix compression for edge computing

Zhou, Dongai, Ouyang, Meng, Kuang, Zhejun, Li, Zhen, Zhou, Jin Peng and Cheng, Xiaochun ORCID: https://orcid.org/0000-0003-0371-9646 (2019) Incremental association rule mining based on matrix compression for edge computing. IEEE Access, 7 . pp. 1730444-173053. ISSN 2169-3536 [Article] (doi:10.1109/ACCESS.2019.2956823)

Preview

PDF - Published version (with publisher's formatting) Available under License Creative Commons Attribution 4.0. Download (5MB) | Preview

Abstract

A growing amount of data is being generated, communicated and processed at the edge nodes of cloud systems; this has the potential to improve response times and thus reduce communication bandwidth. We found that traditional static association rule mining cannot solve certain real-world problems with dynamically changing data. Incremental association rule mining algorithms have been studied. This paper combines the fast update pruning (FUP) algorithm with a compressed Boolean matrix and proposes a new incremental association rule mining algorithm, named the FUP algorithm based on a compression matrix (FBCM). This algorithm requires only a single scan of both the database and incremental databases, establishes two compressible Boolean matrices, and applies association rule mining to those matrices. The FBCM algorithm effectively improves the computational efficiency of incremental association rule mining and hence is suitable for knowledge discovery in the edge nodes of cloud systems.

Actions (login required)

View Item

Statistics

DownloadsShow export options

Export as CSVXMLJSON

Activity Overview

6 month trend

151Downloads

6 month trend

100Hits

Additional statistics are available via IRStats2.