Approximate erasable pattern discovery and analytics on stream data

doi:10.1016/j.knosys.2025.113161

Approximate erasable pattern discovery and analytics on stream data

2025-03-01

0

PRE

AI

DOI：10.1016/j.knosys.2025.113161

Original

Original request for help

Save

Abstract

En 中文

Erasable pattern mining, which finds patterns that can be removed by having a low gain value, minimizes losses by finding products that have less profit to overcome financial crises occurring in industrial fields such as manufacturing factories. When using data in the real world, there are errors of various sizes in the data, such as measurement errors, communication errors, or noise. The results from these environments are not accurate and the defects in the pattern extracted in this way may cause long-lasting effects and significant losses in the industrial field. Accordingly, we propose a mining strategy that extracts reliable and robust erasable patterns in any environment. Our proposed algorithm applies the concept of approximate factor to consider an error range of data and the number of transactions. It also extracts erasable patterns quickly and efficiently by considering characteristics of data streams generated and accumulated in real time. In this paper, approximate erasable pattern mining is performed from the data stream to extract reliable erasable patterns even in an environment where errors may occur. The performance evaluations are conducted using four real datasets that have various characteristics and two synthetic dataset groups. The results of the evaluations demonstrate our approach is faster the maximum four times over regarding runtime and generally efficient regarding memory usage.

Keywords:

Data mining

Approximation

Erasable pattern

Error tolerance

Stream data

Approximate erasable pattern discovery and analytics on stream data

Abstract

Journal

Organization