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 …

Frequent pattern mining: current status and future directions

J Han, H Cheng, D Xin, X Yan - Data mining and knowledge discovery, 2007 - Springer
Frequent pattern mining has been a focused theme in data mining research for over a
decade. Abundant literature has been dedicated to this research and tremendous progress …

Efficient algorithms for mining high utility itemsets from transactional databases

VS Tseng, BE Shie, CW Wu… - IEEE transactions on …, 2012 - ieeexplore.ieee.org
Mining high utility itemsets from a transactional database refers to the discovery of itemsets
with high utility like profits. Although a number of relevant algorithms have been proposed in …

Efficient tree structures for high utility pattern mining in incremental databases

CF Ahmed, SK Tanbeer, BS Jeong… - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
Recently, high utility pattern (HUP) mining is one of the most important research issues in
data mining due to its ability to consider the nonbinary frequency values of items in …

Text classification using graph mining-based feature extraction

C Jiang, F Coenen, R Sanderson, M Zito - Research and Development in …, 2010 - Springer
A graph-based approach to document classification is described in this paper. The graph
representation offers the advantage that it allows for a much more expressive document …

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds

T Truong, H Duong, B Le… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Mining High Average-Utility Itemsets (HAUIs) in a quantitative database is an extension of
the traditional problem of frequent itemset mining, having several practical applications …

Efficient mining of weighted interesting patterns with a strong weight and/or support affinity

U Yun - Information Sciences, 2007 - Elsevier
Most algorithms for frequent pattern mining use a support constraint to prune the
combinatorial search space but support-based pruning is not enough. After mining datasets …

Effective use of frequent itemset mining for image classification

B Fernando, E Fromont, T Tuytelaars - … Vision, Florence, Italy, October 7-13 …, 2012 - Springer
In this paper we propose a new and effective scheme for applying frequent itemset mining to
image classification tasks. We refer to the new set of obtained patterns as Frequent Local …

Mining mid-level features for image classification

B Fernando, E Fromont, T Tuytelaars - International Journal of Computer …, 2014 - Springer
Mid-level or semi-local features learnt using class-level information are potentially more
distinctive than the traditional low-level local features constructed in a purely bottom-up …

Interactive mining of high utility patterns over data streams

CF Ahmed, SK Tanbeer, BS Jeong, HJ Choi - Expert Systems with …, 2012 - Elsevier
High utility pattern (HUP) mining over data streams has become a challenging research
issue in data mining. When a data stream flows through, the old information may not be …