COPP-Miner: Top-k Contrast Order-Preserving Pattern Mining for Time Series Classification

Y Wu, Y Meng, Y Li, L Guo, X Zhu… - … on Knowledge and …, 2023 - ieeexplore.ieee.org
Recently, order-preserving pattern (OPP) mining, a new sequential pattern mining method,
has been proposed to mine frequent relative orders in a time series. Although frequent …

MCoR-Miner: Maximal co-occurrence nonoverlap** sequential rule mining

Y Li, C Zhang, J Li, W Song, Z Qi… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
The aim of sequential pattern mining (SPM) is to discover potentially useful information from
a given sequence. Although various SPM methods have been investigated, most of these …

Co-occurrence order-preserving pattern mining with keypoint alignment for time series

Y Wu, Z Wang, Y Li, Y Guo, H Jiang, X Zhu… - ACM Transactions on …, 2024 - dl.acm.org
Recently, order-preserving pattern (OPP) mining has been proposed to discover some
patterns, which can be seen as trend changes in time series. Although existing OPP mining …

Privacy-preserving big data stream mining: Opportunities, challenges, directions

A Cuzzocrea - 2017 ieee international conference on data …, 2017 - ieeexplore.ieee.org
This paper explores recent achievements and novel challenges of the annoying privacy-
preserving big data stream mining problem, which consists in applying mining algorithms to …

OPF-Miner: Order-preserving pattern mining with forgetting mechanism for time series

Y Li, C Ma, R Gao, Y Wu, J Li… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in
which a group of ranks of time series is used to represent an OPP. This approach can …

Anytime frequent itemset mining of transactional data streams

P Goyal, JS Challa, S Shrivastava, N Goyal - Big Data Research, 2020 - Elsevier
Mining frequent itemsets from transactional data streams has become very essential in
today's world with many applications such as stock market analysis, retail chain analysis …

Dynamic set kNN self-join

D Amagata, T Hara, C **ao - 2019 IEEE 35th international …, 2019 - ieeexplore.ieee.org
In many applications, data objects can be represented as sets. For example, in video on-
demand and social network services, the user data consists of a set of movies that have …

Efficient algorithms for top-k stabbing queries on weighted interval data (full version)

D Amagata, J Yamada, Y Ji, T Hara - arxiv preprint arxiv:2405.05601, 2024 - arxiv.org
Intervals have been generated in many applications (eg, temporal databases), and they are
often associated with weights, such as prices. This paper addresses the problem of …

Imminence monitoring of critical events: A representation learning approach

Y Li, T Ge - Proceedings of the 2021 International Conference on …, 2021 - dl.acm.org
Complex event monitoring is an important problem in data streams that has drawn much
attention. Most previous work assumes that the user knows and provides a complex event …

Top-k closed co-occurrence patterns mining with differential privacy over multiple streams

J Wang, S Fang, C Liu, J Qin, X Li, Z Shi - Future Generation Computer …, 2020 - Elsevier
The frequent pattern mining over data streams is a very important problem for many
applications. However, many researches investigate a single stream in which every …