Advertisement

A FP-Tree-Based Method for Inverse Frequent Set Mining

  • Yuhong Guo
  • Yuhai Tong
  • Shiwei Tang
  • Dongqing Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4042)

Abstract

Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open problem that whether there are reasonably efficient search strategies to find a compatible data set in practice. In this paper, we propose a FP-tree-based method for the inverse problem. Compared with previous “generation-and-test” methods, our method is a zero trace back algorithm, which saves huge computational costs. Furthermore, our algorithm provides a good heuristic search strategy to rapidly find a FP-tree, leading to rapidly finding the compatible databases. More importantly, our method can find a set of compatible databases instead of finding only one compatible database in previous methods.

Keywords

Frequent Item Transaction Database Frequent Itemset Mining Minimum Support Threshold Zero Trace 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mielikainen, T.: On Inverse Frequent Set Mining. In: IEEE ICDM Workshop on Privacy Preserving Data Mining, pp. 18–23. IEEE Computer Society, Los Alamitos (2003)Google Scholar
  2. 2.
    Wu, X., Wu, Y., Wang, Y., Li, Y.: Privacy-Aware Market Basket Data Set Generation: A Feasible Approach for Inverse Frequent Set Mining. In: Proc. 5th SIAM International Conference on Data Mining (2005)Google Scholar
  3. 3.
    Wang, Y., Wu, X.: Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation. In: Proc. 5th International Conference on Data Mining, pp. 482–489 (2005)Google Scholar
  4. 4.
    Chen, X., Orlowska, M.: A Further Study on Inverse Frequent Set Mining. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol. 3584, pp. 753–760. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Calders, T.: Computational Complexity of Itemset Frequency Satisfiability. In: Proc. 23rd ACM PODS 2004, pp. 143–154. ACM Press, New York (2004)Google Scholar
  6. 6.
    Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of the ACM SIGMOD International Conference on Management of Database, pp. 1–12 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yuhong Guo
    • 1
  • Yuhai Tong
    • 1
  • Shiwei Tang
    • 1
  • Dongqing Yang
    • 1
  1. 1.Department of Computer SciencePeking UniversityBeijingChina

Personalised recommendations