[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Mining DAG Patterns from DAG Databases

  • Conference paper
Advances in Web-Age Information Management (WAIM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3129))

Included in the following conference series:

Abstract

Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most important ones is finding frequent patterns in databases. Although much work has been done to this problem, to the best of our knowledge, no previous research studies how to find frequent DAG (directed acyclic graph) patterns from DAG data. Without such a mining method, the knowledge cannot be discovered from the databases storing DAG data such as family genealogy profiles, product structures, XML documents and course structures. Therefore, a solution method containing four stages is proposed in this paper to discover frequent DAG patterns from DAG databases.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Lin, X., Liu, C., Zhang, Y., Zhou, X.: Efficiently computing frequent tree-like topology patterns in a web environment. In: Proceedings of Technology of Object-Oriented Languages and Systems (1999)

    Google Scholar 

  2. Wang, K., Liu, H.Q.: Discovering structural association of semistructured data. IEEE Trans. on Knowledge and Data Engineering 12, 353–371 (2000)

    Article  Google Scholar 

  3. Wang, K., Liu, H.Q.: Mining is-part-of association patterns from semistructured data. In: Proceedings of the 9th IFIP 2.6 Working Conference on Database Semantics (2001)

    Google Scholar 

  4. Inokuuchi, A., Washio, T., Motoda, H.: An Apriori-based Algorithm for mining frequent substructures from graph data. In: Proceeding of the 4th European Conference on Principles and Practices of Knowledge Discovery in Databases, pp. 13–23 (2000)

    Google Scholar 

  5. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the IEEE International Conference on Data Mining (2001)

    Google Scholar 

  6. Nanopoulos, A., Manolopoulos, Y.: Mining patterns from graph traversals. Data and Knowledge Engineering 37, 243–266 (2001)

    Article  MATH  Google Scholar 

  7. Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings of 2002 Int. Conf. on Data Mining (ICDM 2002), Maebashi, Japan (2002)

    Google Scholar 

  8. Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proceedings of 2003 ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 2003), Washington, D.C. (2003)

    Google Scholar 

  9. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  10. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 478–499 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, YL., Kao, HP., Ko, MT. (2004). Mining DAG Patterns from DAG Databases. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27772-9_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22418-1

  • Online ISBN: 978-3-540-27772-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics