# A new framework for itemset generation

@inproceedings{Aggarwal1998ANF, title={A new framework for itemset generation}, author={Charu C. Aggarwal and Philip S. Yu}, booktitle={PODS '98}, year={1998} }

The problem of finding association rules in a large database of sales transactions has been widely studied in the literature, We discuss some of the weaknesses of the large itemset method for association rule generation. A different method for evaluating and finding itemsets referred to as otrongIyl collective itemsets is proposed. The concepts of “support” of an itemset and correlation of the items within an itemset are related, though not quite the same. This criterion stresses the importance…

## Figures, Tables, and Topics from this paper

## 275 Citations

Mining Associations with the Collective Strength Approach

- Computer ScienceIEEE Trans. Knowl. Data Eng.
- 2001

An algorithm is provided which provides very good computational efficiency, while maintaining statistical robustness, and the fact that this algorithm relies on relative measures rather than absolute measures such as support implies that the method can be applied to find association rules in data sets in which items may appear in a sizeable percentage of the transactions.

A Model-Based Frequency Constraint for Mining Associations from Transaction Data

- Computer ScienceData Mining and Knowledge Discovery
- 2005

A novel model-based frequency constraint is developed and it is shown that the new constraint provides improvements over a single minimum support threshold and that the precision threshold is more robust and easier to set and interpret by the user.

Advances in Mining Binary Data: Itemsets as Summaries

- Computer Science
- 2008

This thesis shows how to use itemsets for answering queries, that is, finding out the number of transactions satisfying some given formula, and proposes a new concept called normalised correlation dimension, a known concept that works well with realvalued data.

Automatic discovery of locally frequent itemsets in the presence of highly frequent itemsets

- Mathematics, Computer ScienceIntell. Data Anal.
- 2005

The notion of locally frequent itemsets is introduced and their existence as the biggest and most frequently appearing category of rare but interesting itemsets especially at commercial applications, based on the opinion of field experts is supported.

Frequent Itemsets Patterns in Data Mining

- Computer Science
- 2012

Two novel method; called Impression method, for reducing database activity of frequent item set discovery algorithms and Transaction Database Spin Algorithm for the efficient generation for large itemsets and effective reduction on transaction database size are purposeed.

An Algorithm for Mining Implicit Itemset Pairs Based on Differences of Correlations

- Computer ScienceDiscovery Science
- 2005

A new algorithm is presented that enumerates possible component itemsets based on a new pruning rule for cutting off useless components and forms the compound itemsets by combining the components thus detected, while making use of a constraint for preventing the algorithm from checking meaningless combinations.

An efficient rigorous approach for identifying statistically significant frequent itemsets

- Computer ScienceJACM
- 2012

A novel methodology to identify a meaningful support threshold s* for a dataset, such that the number of itemsets with support at least s* represents a substantial deviation from what would be expected in a random dataset with the same number of transactions and the same individual item frequencies.

Mining Large Itemsets for Association Rules

- Computer ScienceIEEE Data Eng. Bull.
- 1998

A survey of the itemset method for association rule generation and other formulations of associations which can be viable alternatives to the traditional association rule ge neration method are discussed.

PROPOSED ALGORITHM FOR FREQUENT ITEMSETS PATTERNS

- Computer Science
- 2012

A novel method; Transaction Database Snip Algorithm for the efficient generation for large itemsets and effective reductio is proposed.

Answering the Most Correlated N Association Rules Efficiently

- Computer SciencePKDD
- 2002

This paper proposes heuristics for the vertical decomposition of a database, for pruning unproductive itemsets, and for traversing a set-enumeration tree of itemsets that is tailored to the calculation of the N most significant association rules, where N can be specified by the user.

## References

SHOWING 1-10 OF 19 REFERENCES

Using a Hash-Based Method with Transaction Trimming for Mining Association Rules

- Computer ScienceIEEE Trans. Knowl. Data Eng.
- 1997

An effective algorithm for the candidate set generation is developed that is a hash-based algorithm and is especially effective for the generation of a candidate set for large 2-itemsets, thus resolving the performance bottleneck.

Dynamic itemset counting and implication rules for market basket data

- Computer ScienceSIGMOD '97
- 1997

A new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling and a new way of generating “implication rules” which are normalized based on both the antecedent and the consequent.

Beyond market baskets: generalizing association rules to correlations

- Computer ScienceSIGMOD '97
- 1997

This work develops the notion of mining rules that identify correlations (generalizing associations), and proposes measuring significance of associations via the chi-squared test for correlation from classical statistics, enabling the mining problem to reduce to the search for a border between correlated and uncorrelated itemsets in the lattice.

Online generation of association rules

- Computer ScienceProceedings 14th International Conference on Data Engineering
- 1998

This work investigates the problem of online mining of association rules in a large database consisting of sales transactions and shows how to preprocess the data effectively in order to make it suitable for repeated online queries.

Mining generalized association rules

- Computer ScienceFuture Gener. Comput. Syst.
- 1997

A new interest-measure for rules which uses the information in the taxonomy is presented, and given a user-specified “minimum-interest-level”, this measure prunes a large number of redundant rules.

Efficient Algorithms for Discovering Association Rules

- Mathematics, Computer ScienceKDD Workshop
- 1994

An improved algorithm for the problem of mining association rules from large collections of data based on careful combinatorial analysis of the information obtained in previous passes is given, which makes it possible to eliminate unnecessary candidate rules.

Mining quantitative association rules in large relational tables

- Computer ScienceSIGMOD '96
- 1996

This work deals with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary and introduces measures of partial completeness which quantify the information lost due to partitioning.

Mining association rules between sets of items in large databases

- Computer ScienceSIGMOD '93
- 1993

An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.

Data Mining: An Overview from a Database Perspective

- Computer ScienceIEEE Trans. Knowl. Data Eng.
- 1996

This article provides a survey, from a database researcher's point of view, on the data mining techniques developed recently, a classification of the available data mining Techniques, and a comparative study of such techniques is presented.

Finding interesting rules from large sets of discovered association rules

- Computer ScienceCIKM '94
- 1994

It is shown how a simple formalism of rule templates makes it possible to easily describe the structure of interesting rules, and how a visualization tool interfaces with rule templates.