Extract Deep Web-Detail Pages with Simple Tree Match

摘要：

In this paper, we provide a method to extract data from Deep Web-Detail Pages. The method use the Simple Tree Match to compute the max match value between two trees, and use the Hungarian algorithm to trace the result of the STM compute, after this we use tree merge method to generate Wrapper. At last, we use Term Frequency to optimize the Wrapper. In experimental, we use the Wrapper to extract data; the results show that our method compared with other methods is feasible and effective.

关键词： STM HungarianAlgorithm Web Extract Deep Web.

作者: Wei ZHANG Ye DENG Ranran DU Qiuhong Wang

作者单位: Department of Computer Science and Technology, Ocean University of China Qing Dao, Shandong Province, China

会议类型: 国际会议

会议名称: 2011 6th Joint International Information Technology and Artificial Intelligence Conference(2011年第六届IEEE联合国际信息技术与人工智能会议 IEEE ITAIC 2011)

会议地点: 重庆

会议语种:英文

页码: 250-254

在线出版日期: 2011-08-20（万方平台首次上网日期，不代表论文的发表时间）