A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data

@inproceedings{Suzuki2002APT,
  title={A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data},
  author={Yusuke Suzuki and Kohtaro Inomae and Takayoshi Shoudai and Tetsuhiro Miyahara and Tomoyuki Uchida},
  booktitle={ILP},
  year={2002}
}
Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. Knowledge representations for tree structured data are quite important to discover interesting features which such tree structured data have. In this paper, as a representation of structural features we propose a structured ordered tree pattern, called a term tree, which is a rooted tree pattern consisting of ordered children and structured variables. A variable in a term tree can… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Data on the Web: From Relations to Semistructured Data and XML

S. Abiteboul, P. Buneman, D. Suciu
2000
View 17 Excerpts
Highly Influenced

Finding Patterns Common to a Set of Strings

J. Comput. Syst. Sci. • 1980
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…