Abstract
In order to extract structural features among nodes, in which characteristic words appear, from tree-structured documents, we proposed a text mining algorithm for enumerating all frequent consecutive path patterns (CPPs) on a list W of words (PAKDD, 2004). First of all, in this paper, we extend a CPP to a tree pattern, which is called a tree association pattern (TAP), over a set W of words. A TAP is an ordered rooted tree t such that the root of t has no child or at least 2 children, all leaves of t are labeled with nonempty subsets of W, and all internal nodes, if exists, are labeled with strings. Next, we present text mining algorithms for enumerating all maximal frequent TAPs in tree-structured documents. Then, by reporting experimental results for Reuters news-wires, we evaluate our algorithms. Finally, as an application of CPPs, we present an algorithm for a wrapper based on CPP using XSLT transformation language and demonstrate simply the use of wrapper to translate one of Reuters news-wires to other XML document.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bădică, A., Bădică, C., Popescu, E.: Implementing logic wrappers using xslt stylesheets. In: Proc. ICCGI-2006, p. 31 (2006)
Clark, J.: XSL transformations (XSLT) version 1.0. W3C recommendation (1999), http://www.w3.org/TR/xslt
Fernandez, M., Suciu, D.: Optimizing regular path expressions using graph schemas. In: Proc. ICDE 1998, pp. 14–23 (1998)
Gonnet, G., Baeza-Yates, R.: Handbook of Algorithms and Data Structures. Addison-Wesley, Reading (1991)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001)
Ishida, K., Uchida, T., Kawamoto, K.: Extracting structural features among words from document data streams. In: Sattar, A., Kang, B.-h. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 332–341. Springer, Heidelberg (2006)
Lewis, D.: Reuters-21578 text categorization test collection. UCI KDD Archive (1997), http://kdd.ics.uci.edu/databases/reuters21578/reuters21578.html
Miyahara, T., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of frequent tree structured patterns in semistructured web documents. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 47–52. Springer, Heidelberg (2001)
Apache Xalan Project. Xalan, http://xalan.apache.org/
Uchida, T., Mogawa, T., Nakamura, Y.: Finding frequent structural features among words in tree-structured documents. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 351–360. Springer, Heidelberg (2004)
Wang, K., Liu, H.: Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering 12, 353–371 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uchida, T., Kawamoto, K. (2009). Algorithm for Enumerating All Maximal Frequent Tree Patterns among Words in Tree-Structured Documents and Its Application. In: Ślęzak, D., Kim, Th., Zhang, Y., Ma, J., Chung, Ki. (eds) Database Theory and Application. DTA 2009. Communications in Computer and Information Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10583-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-10583-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10582-1
Online ISBN: 978-3-642-10583-8
eBook Packages: Computer ScienceComputer Science (R0)