Discovery of frequent tree structured patterns in semistructured web documents

DOI10.1007/3-540-45357-1_8MaRDI QIDQ2768551zbMATH OpenFDO

Authors Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Ken'ichi Takahashi, Hiroaki. T. Ueda

Publication date 3 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2035/20350047

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2088105
• scientific article; zbMATH DE number 2088106
• Algorithm for enumerating all maximal frequent tree patterns among words in tree-structured documents and its application
• Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
• A general architecture for finding structural regularities on the Web

Cited in

(13)

• A general architecture for finding structural regularities on the Web
• scientific article; zbMATH DE number 2086363 (Why is no real title available?)
• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• scientific article; zbMATH DE number 1945892 (Why is no real title available?)
• scientific article; zbMATH DE number 1966525 (Why is no real title available?)
• scientific article; zbMATH DE number 1977846 (Why is no real title available?)
• scientific article; zbMATH DE number 2084831 (Why is no real title available?)
• scientific article; zbMATH DE number 2084850 (Why is no real title available?)
• scientific article; zbMATH DE number 2088105 (Why is no real title available?)
• scientific article; zbMATH DE number 2088106 (Why is no real title available?)
• Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
• Discovering frequent subtrees from XML data using neural networks
• Algorithm for enumerating all maximal frequent tree patterns among words in tree-structured documents and its application

This page was built for publication: Discovery of frequent tree structured patterns in semistructured web documents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768551)