A survey of evolutionary computation for association rule mining

A Telikani, AH Gandomi, A Shahbahrami - Information Sciences, 2020 - Elsevier
Abstract Association Rule Mining (ARM) is a significant task for discovering frequent patterns
in data mining. It has achieved great success in a plethora of applications such as market …

Efficient algorithms for mining top-k high utility itemsets

VS Tseng, CW Wu, P Fournier-Viger… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
High utility itemsets (HUIs) mining is an emerging topic in data mining, which refers to
discovering all itemsets having a utility meeting a user-specified minimum utility threshold …

BIDE: Efficient mining of frequent closed sequences

J Wang, J Han - Proceedings. 20th international conference on …, 2004 - ieeexplore.ieee.org
Previous studies have presented convincing arguments that a frequent pattern mining
algorithm should not mine all frequent patterns but only the closed ones because the latter …

Mining high utility itemsets

R Chan, Q Yang, YD Shen - Third IEEE international conference on …, 2003 - computer.org
Traditional association rule mining algorithms only generate a large number of highly
frequent rules, but these rules do not provide useful answers for what the high utility rules …

Fast algorithms for frequent itemset mining using fp-trees

G Grahne, J Zhu - IEEE transactions on knowledge and data …, 2005 - ieeexplore.ieee.org
Efficient algorithms for mining frequent itemsets are crucial for mining association rules as
well as for many other data mining tasks. Methods for mining frequent itemsets have been …

CLOSET+ searching for the best strategies for mining frequent closed itemsets

J Wang, J Han, J Pei - Proceedings of the ninth ACM SIGKDD …, 2003 - dl.acm.org
Mining frequent closed itemsets provides complete and non-redundant results for frequent
pattern analysis. Extensive studies have proposed various strategies for efficient frequent …

[PDF][PDF] Efficiently using prefix-trees in mining frequent itemsets.

G Grahne, J Zhu - FIMI, 2003 - informatik.rwth-aachen.de
Efficient algorithms for mining frequent itemsets are crucial for mining association rules.
Methods for mining frequent itemsets and for iceberg data cube computation have been …

Fundamentals of association rules in data mining and knowledge discovery

S Zhang, X Wu - Wiley Interdisciplinary Reviews: Data Mining …, 2011 - Wiley Online Library
Association rule mining is one of the fundamental research topics in data mining and
knowledge discovery that identifies interesting relationships between itemsets in datasets …

Mining frequent spatio-temporal sequential patterns

H Cao, N Mamoulis, DW Cheung - Fifth IEEE international …, 2005 - ieeexplore.ieee.org
Many applications track the movement of mobile objects, which can be represented as
sequences of timestamped locations. Given such a spatiotemporal series, we study the …

Efficient high utility itemset mining using buffered utility-lists

QH Duong, P Fournier-Viger, H Ramampiaro… - Applied …, 2018 - Springer
Discovering high utility itemsets in transaction databases is a key task for studying the
behavior of customers. It consists of finding groups of items bought together that yield a high …