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 …

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 …

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

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 …

[CITATION][C] Concept Data Analysis: Theory and Applications

C Carpineto - 2004 - books.google.com
With the advent of the Web along with the unprecedented amount of information available in
electronic format, conceptual data analysis is more useful and practical than ever, because …

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 …

Computing iceberg concept lattices with titanic

G Stumme, R Taouil, Y Bastide, N Pasquier… - Data & knowledge …, 2002 - Elsevier
We introduce the notion of iceberg concept lattices and show their use in knowledge
discovery in databases. Iceberg lattices are a conceptual clustering method, which is well …

Mining non-redundant association rules

MJ Zaki - Data mining and knowledge discovery, 2004 - Springer
The traditional association rule mining framework produces many redundant rules. The
extent of redundancy is a lot larger than previously suspected. We present a new framework …

An efficient algorithm for enumerating closed patterns in transaction databases

T Uno, T Asai, Y Uchida, H Arimura - … , DS 2004, Padova, Italy, October 2-5 …, 2004 - Springer
The class of closed patterns is a well known condensed representations of frequent patterns,
and have recently attracted considerable interest. In this paper, we propose an efficient …