A survey of utility-oriented pattern mining

W Gan, JCW Lin, P Fournier-Viger… - … on Knowledge and …, 2019 - ieeexplore.ieee.org
The main purpose of data mining and analytics is to find novel, potentially useful patterns
that can be utilized in real-world applications to derive beneficial knowledge. For identifying …

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 …

CHARM: An efficient algorithm for closed itemset mining

MJ Zaki, CJ Hsiao - Proceedings of the 2002 SIAM international conference …, 2002 - SIAM
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets,
yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper …

Fast vertical mining using diffsets

MJ Zaki, K Gouda - Proceedings of the ninth ACM SIGKDD international …, 2003 - dl.acm.org
A number of vertical mining algorithms have been proposed recently for association mining,
which have shown to be very effective and usually outperform horizontal approaches. The …

Search for neutral heavy leptons produced in Z decays

DELPHI collaboration - Zeitschrift für Physik C Particles and Fields, 1997 - Springer
Abstract Weak isosinglet Neutral Heavy Leptons (vm) have been searched for using data
collected by the DELPHI detector corresponding to 3.3× 10 6 hadronic Z 0 decays at LEP1 …

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 …

[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 …

Efficient algorithms for mining closed itemsets and their lattice structure

MJ Zaki, CJ Hsiao - IEEE transactions on knowledge and data …, 2005 - ieeexplore.ieee.org
The set of frequent closed itemsets uniquely determines the exact frequency of all itemsets,
yet it can be orders of magnitude smaller than the set of all frequent itemsets. In this paper …

Moment: Maintaining closed frequent itemsets over a stream sliding window

Y Chi, H Wang, PS Yu, RR Muntz - Fourth IEEE International …, 2004 - ieeexplore.ieee.org
This paper considers the problem of mining closed frequent itemsets over a sliding window
using limited memory space. We design a synopsis data structure to monitor transactions in …

Spin: mining maximal frequent subgraphs from graph databases

J Huan, W Wang, J Prins, J Yang - Proceedings of the tenth ACM …, 2004 - dl.acm.org
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is
the overwhelming abundance of such patterns. In large graph databases, the total number of …