Concise Representation of Frequent Patterns Based on Disjunction-Free Generators

@inproceedings{Kryszkiewicz2001ConciseRO,
  title={Concise Representation of Frequent Patterns Based on Disjunction-Free Generators},
  author={Marzena Kryszkiewicz},
  booktitle={ICDM},
  year={2001}
}
Many data mining problems require the discovery of frequent patterns in order to be solved. Frequent itemsets are useful in the discovery of association rules, episode rules, sequential patterns and clusters. The number of frequent itemsets is usually huge. Therefore, it is important to work out concise representations of frequent itemsets. In the paper, we describe three basic. lossless representations of frequent patterns in an uniform way and ofer a new lossless representation of frequent… CONTINUE READING
Highly Cited
This paper has 109 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 62 extracted citations

Non-derivable itemset mining

Data Mining and Knowledge Discovery • 2006
View 14 Excerpts
Highly Influenced

Deducing Bounds on the Support of Itemsets

Database Support for Data Mining Applications • 2004
View 5 Excerpts
Highly Influenced

Mining All Non-Derivable Frequent Itemsets

View 4 Excerpts
Highly Influenced

109 Citations

01020'00'04'09'14'19
Citations per Year
Semantic Scholar estimates that this publication has 109 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…