Discovery of Frequent Tag Tree Patterns in Semistructured Web Documents
Many Web documents such as HTML files and XML files have no rigid structure and are called semistructured data. In general, such semistructured Web documents are represented by rooted trees with ordered children. We propose a new method for discovering frequent tree structured patterns in semistructured Web documents by using a tag tree pattern as a hypothesis. A tag tree pattern is an edge labeled tree with ordered children which has structured variables. An edge label is a tag or a keyword in such Web documents, and a variable can be substituted by an arbitrary tree. So a tag tree pattern is suited for representing tree structured patterns in such Web documents. First we show that it is hard to compute the optimum frequent tag tree pattern. So we present an algorithm for generating all maximally frequent tag tree patterns and give the correctness of it. Finally, we report some experimental results on our algorithm. Although this algorithm is not efficient, experiments show that we can extract characteristic tree structured patterns in those data.
KeywordsRooted Tree Term Tree Minimum Frequency Truth Assignment Edge Label
Unable to display preview. Download preview PDF.
- 1.S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 2000.Google Scholar
- 2.T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. Proc. 2nd SIAM Int. Conf. Data Mining (SDM-2002) (to appear), 2002.Google Scholar
- 3.C.-H. Chang, S.-C. Lui, and Y.-C. Wu. Applying pattern mining to web information extraction. Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2001), Springer-Verlag, LNAI 2035, pages 4–15, 2001.Google Scholar
- 4.M. Fernandez and D. Suciu. Optimizing regular path expressions using graph schemas. Proceedings of the 14th International Conference on Data Engineering (ICDE-98), IEEE Computer Society, pages 14–23, 1998.Google Scholar
- 5.K. Furukawa, T. Uchida, K. Yamada, T. Miyahara, T. Shoudai, and Y. Nakamura. Extracting characteristic structures among words in semistructured documents. Proc. PAKDD-2002, Springer-Verlag, LNAI (to appear), 2002.Google Scholar
- 7.T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tree structuted patterns in semistructured web documents. Proc. PAKDD-2001, Springer-Verlag, LNAI 2035, pages 47–52, 2001.Google Scholar
- 8.T. Shoudai, T. Uchida, and T. Miyahara. Polynomial time algorithms for finding unordered tree patterns with internal variables. Proc. FCT-2001, Springer-Verlag, LNCS 2138, pages 335–346, 2001.Google Scholar
- 10.Y. Suzuki, T. Shoudai, T. Miyahara, and T. Uchida. Polynomial time inductive inference of ordered tree patterns with internal variables from positive data. Proc. LA Winter Symposium, Kyoto, Japan, pages 33-1–33-12, 2002.Google Scholar