Mining Mutually Dependent Ordered Subtrees in Tree Databases

  • Tomonobu Ozaki
  • Takenao Ohkawa
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5433)

Abstract

In this paper, in order to discover significant patterns, we focus on the problem of mining frequent mutually dependent ordered subtrees, i.e. frequent ordered subtrees in which all building blocks are mutually dependent, in tree databases. While three kinds of mutually dependent ordered subtrees are considered based on the building blocks used, we propose efficient breadth-first algorithms for each kind of subtrees. The effectiveness of the proposed framework is assessed through the experiments with synthetic and real world datasets.

Keywords

tree mining mutually dependent patterns h-confidence 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487–499 (1994)Google Scholar
  2. 2.
    Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proc. of the 2nd SIAM International Conference on Data Mining (2002)Google Scholar
  3. 3.
    Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering frequent substructures in large unordered trees. In: Proc. of the 6th International Conference on Discovery Science, pp. 47–61 (2003)Google Scholar
  4. 4.
    Chi, Y., Nijssen, S., Muntz, R.R., Kok, J.N.: Frequent subtree mining – an overview. Fundamenta Informaticae 66(1-2), 161–198 (2005)Google Scholar
  5. 5.
    Chi, Y., Xia, Y., Yang, Y., Muntz, R.R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering 17(2), 190–202 (2005)CrossRefGoogle Scholar
  6. 6.
    Hido, S., Kawano, H.: Amiot: Induced ordered tree mining in tree-structured databases. In: Proc. of the 5th IEEE International Conference on Data Mining (ICDM 2005), pp. 170–177 (2005)Google Scholar
  7. 7.
    Kanehisa, M., Goto, S., Kawashima, S., Okuno, Y., Hattori, M.: The KEGG resource for deciphering the genome. Nucleic Acids Research 32, D277–D280 (2004)CrossRefGoogle Scholar
  8. 8.
    Ozaki, T., Ohkawa, T.: Efficient mining of closed induced ordered subtrees in tree-structured databases. In: Proc. of the 6th IEEE International Conference on Data Mining - Workshops, pp. 279–283 (2006)Google Scholar
  9. 9.
    Ozaki, T., Ohkawa, T.: Efficiently mining closed constrained frequent ordered subtrees by using border information. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS, vol. 4426, pp. 745–752. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Ozaki, T., Ohkawa, T.: Mining frequent δ-free induced ordered subtrees in tree-structured databases. In: Proc. of the 5th Workshop on Learning with Logics and Logics for Learning (LLLL 2007), pp. 3–9 (2007)Google Scholar
  11. 11.
    Xiong, H., Tan, P.-N., Kumar, V.: Mining strong affinity association patterns in data sets with skewed support distribution. In: Proc. of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pp. 387–394 (2003)Google Scholar
  12. 12.
    Xiong, H., Tan, P.-N., Kumar, V.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery 13(2), 219–242 (2006)CrossRefGoogle Scholar
  13. 13.
    Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proc. of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 71–80 (2002)Google Scholar
  14. 14.
    Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae, special issue on Advances in Mining Graphs, Trees and Sequences (2005)Google Scholar
  15. 15.
    Zou, L., Lu, Y., Zhang, H., Hu, R.: Mining frequent induced subtree patterns with subtree-constraint. In: Proc. of the 6th IEEE International Conference on Data Mining - Workshops, pp. 3–7 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Tomonobu Ozaki
    • 1
  • Takenao Ohkawa
    • 2
  1. 1.Organization of Advanced Science and TechnologyKobe UniversityJapan
  2. 2.Graduate School of EngineeringKobe UniversityKobeJapan

Personalised recommendations