Approximation of Frequency Queris by Means of Free-Sets

  title={Approximation of Frequency Queris by Means of Free-Sets},
  author={Jean-François Boulicaut and Artur Bykowski and Christophe Rigotti},
Given a large collection of transactions containing items, a basic common data mining problem is to extract the so-called frequent itemsets (i.e., set of items appearing in at least a given number of transactions). In this paper, we propose a structure called free-sets, from which we can approximate any itemset support (i.e., the number of transactions containing the itemset) and we formalize this notion in the framework of -adequate representation [10].We show that frequent free-sets can be… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 162 citations. REVIEW CITATIONS


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

163 Citations

Citations per Year
Semantic Scholar estimates that this publication has 163 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 17 references

Frequent itemset extra tion in highly orrelated data: a web usage mining appli ation

  • A. Bykowski, L. Gomez-Chantada
  • In Pro
  • 2000

Frequent losures as a on ise representation for binary data mining

  • J.-F. Bouli aut, A. Bykowski
  • In Pro . PAKDD'00,
  • 2000

Probalisti models for query approxima tion with large data sets. Te hni al Report 2000-07

  • D. Pavlov, H. Mannila, P. Smyth
  • Univsersity of California,
  • 2000

Probalisti models for query approximation with large data sets

  • H. Mannila D. Pavlov
  • 2000

Using onstraints during itemset mining: a generi approa h

  • J.-F. Bouli aut, B. Jeudy
  • Te hni al Report
  • 2000

Frequent set dis overy in highly- orrelated data

  • A. Bykowski
  • Te hni al Report July
  • 1999

Similar Papers

Loading similar papers…