[PDF][PDF] A survey of sequential pattern mining

P Fournier-Viger, JCW Lin… - Data Science and …, 2017 - philippe-fournier-viger.com
Discovering unexpected and useful patterns in databases is a fundamental data mining task.
In recent years, a trend in data mining has been to design algorithms for discovering …

Frequent itemset mining: A 25 years review

JM Luna, P Fournier‐Viger… - … Reviews: Data Mining …, 2019 - Wiley Online Library
Frequent itemset mining (FIM) is an essential task within data analysis since it is responsible
for extracting frequently occurring events, patterns, or items in data. Insights from such …

[图书][B] Frequent pattern mining algorithms: A survey

CC Aggarwal, MA Bhuiyan, MA Hasan - 2014 - Springer
This chapter will provide a detailed survey of frequent pattern mining algorithms. A wide
variety of algorithms will be covered starting from Apriori. Many algorithms such as Eclat …

A survey of itemset mining

P Fournier‐Viger, JCW Lin, B Vo, TT Chi… - … : Data Mining and …, 2017 - Wiley Online Library
Itemset mining is an important subfield of data mining, which consists of discovering
interesting and useful patterns in transaction databases. The traditional task of frequent …

EFIM: a fast and memory efficient algorithm for high-utility itemset mining

S Zida, P Fournier-Viger, JCW Lin, CW Wu… - … and Information Systems, 2017 - Springer
In recent years, high-utility itemset mining has emerged as an important data mining task.
However, it remains computationally expensive both in terms of runtime and memory …

Frequent item set mining

C Borgelt - Wiley interdisciplinary reviews: data mining and …, 2012 - Wiley Online Library
Frequent item set mining is one of the best known and most popular data mining methods.
Originally developed for market basket analysis, it is used nowadays for almost any task that …

[PDF][PDF] A Systematic Framework to Generate Invariants for Anomaly Detection in Industrial Control Systems.

C Feng, VR Palleti, A Mathur, D Chana - NDSS, 2019 - pdfs.semanticscholar.org
A common method: build a predictive model, eg, AR, LDS, RNN models: x (t)= f (x {t− p: t− 1},
u {t− p: t− 1}; θ)► x {t− p: t− 1} the sensor measurements from time t− p to t− 1► u {t− p: t− 1} …

EFIM: a highly efficient algorithm for high-utility itemset mining

S Zida, P Fournier-Viger, JCW Lin, CW Wu… - … conference on artificial …, 2015 - Springer
High-utility itemset mining (HUIM) is an important data mining task with wide applications. In
this paper, we propose a novel algorithm named EFIM (EFficient high-utility Itemset Mining) …

Anomalous video event detection using spatiotemporal context

F Jiang, J Yuan, SA Tsaftaris… - Computer Vision and …, 2011 - Elsevier
Compared to other anomalous video event detection approaches that analyze object
trajectories only, we propose a context-aware method to detect anomalies. By tracking all …

Efficient maximal biclique enumeration for large sparse bipartite graphs

L Chen, C Liu, R Zhou, J Xu, J Li - Proceedings of the VLDB Endowment, 2022 - dl.acm.org
Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs.
Maximal biclique enumeration (MBE) is challenging since the number of the maximal …