Finding Good Itemsets by Packing Data

  title={Finding Good Itemsets by Packing Data},
  author={Nikolaj Tatti and Jilles Vreeken},
  journal={2008 Eighth IEEE International Conference on Data Mining},
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that compress the data efficiently. As a compression technique we use decision trees combined with a refined version of MDL. More formally, assuming that the items are ordered, we create a decision tree for each item that may only depend on the previous items. Our approach allows us to find complex interactions between the… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
21 Citations
37 References
Similar Papers


Publications referenced by this paper.

Similar Papers

Loading similar papers…