Skip to main content
SpringerLink
Log in
Book cover

Pacific-Asia Conference on Knowledge Discovery and Data Mining

PAKDD 2008: New Frontiers in Applied Data Mining pp 75–86Cite as

Mining Mutually Dependent Ordered Subtrees in Tree Databases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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. 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)

    Article  Google Scholar 

  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. Kanehisa, M., Goto, S., Kawashima, S., Okuno, Y., Hattori, M.: The KEGG resource for deciphering the genome. Nucleic Acids Research 32, D277–D280 (2004)

    Article  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. 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. Xiong, H., Tan, P.-N., Kumar, V.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery 13(2), 219–242 (2006)

    Article  Google Scholar 

  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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Organization of Advanced Science and Technology, Kobe University, Japan

    Tomonobu Ozaki

  2. Graduate School of Engineering, Kobe University, 1-1 Rokkodai-cho, Nada, Kobe, 657-8501, Japan

    Takenao Ohkawa

Authors
  1. Tomonobu Ozaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takenao Ohkawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technologies, University of Sydney, NSW, Australia

    Sanjay Chawla

  2. The Institute of Scientific and Industrial Research, Osaka University, 8-1, Mihogaoka, Ibaraki, 567, Osaka, Japan

    Takashi Washio

  3. Division of Computing Science, Hokkaido University, 060-0814, Sapporo, Japan

    Shin-ichi Minato

  4. School of Medicine, Department of Medical Informatics, Shimane University, 89-1 Enya-cho, Izumo, 693-8501, Shimane, Japan

    Shusaku Tsumoto

  5. Central Research Institute of Electric Power Industry, 2-11-1 Iwado-kita, Komae-shi, 201-8511, Tokyo, Japan

    Takashi Onoda

  6. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, 101-8430, Tokyo, Japan

    Seiji Yamada

  7. The Institute of Scientific and Industrial Research, Osaka University, 8-1 Mihogaoka, Ibaraki, 567, Osaka, Japan

    Akihiro Inokuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ozaki, T., Ohkawa, T. (2009). Mining Mutually Dependent Ordered Subtrees in Tree Databases . In: Chawla, S., et al. New Frontiers in Applied Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00399-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00399-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00398-1

  • Online ISBN: 978-3-642-00399-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation