Association mining

A Ceglar, JF Roddick - ACM Computing Surveys (CSUR), 2006 - dl.acm.org
The task of finding correlations between items in a dataset, association mining, has received
considerable attention over the last decade. This article presents a survey of association …

Data Mining The Text Book

C Aggarwal - 2015 - Springer
This textbook explores the different aspects of data mining from the fundamentals to the
complex data types and their applications, capturing the wide diversity of problem domains …

[图书][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 …

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 …

Frequent subgraph discovery

M Kuramochi, G Karypis - Proceedings 2001 IEEE international …, 2001 - ieeexplore.ieee.org
As data mining techniques are being increasingly applied to non-traditional domains,
existing approaches for finding frequent itemsets cannot be used as they cannot model the …

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 …

Mafia: A maximal frequent itemset algorithm for transactional databases

D Burdick, M Calimlim, J Gehrke - … 17th international conference …, 2001 - ieeexplore.ieee.org
We present a new algorithm for mining maximal frequent itemsets from a transactional
database. Our algorithm is especially efficient when the itemsets in the database are very …

Efficiently mining frequent trees in a forest

MJ Zaki - Proceedings of the eighth ACM SIGKDD international …, 2002 - dl.acm.org
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining
semistructured data, and so on. We formulate the problem of mining (embedded) subtrees in …

Frequent substructure-based approaches for classifying chemical compounds

M Deshpande, M Kuramochi, N Wale… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
Computational techniques that build models to correctly assign chemical compounds to
various classes of interest have many applications in pharmaceutical research and are used …

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 …