| 最小节点信息树抽取规则及可视化生成方法 |
| |
| 引用本文： | 霍滨焱.最小节点信息树抽取规则及可视化生成方法[J].应用科技,2009,36(7):37-40. |
| |
| 作者姓名： | 霍滨焱 |
| |
| 作者单位： | 黑龙江科技学院,计算机与信息工程学院,黑龙江,哈尔滨,150027 |
| |
| 基金项目： | 黑龙江科技学院引进高层次人才科研启动基金 |
| |
| 摘 要： | 提出了最小节点信息树概念，将抽取规则分为粗略规则和精细规则，降低了DOM树的高度，提高了信息抽取效率．设计并实现了一种最小节点信息树抽取规则的可视化实现方法．
|
| 关 键 词： | Web信息抽取 抽取规则 最小节点信息树 |
Visualized implementation of Web information extraction rule based on mini-node DOM tree |
| |
| HUO Bin-yan.Visualized implementation of Web information extraction rule based on mini-node DOM tree[J].Applied Science and Technology,2009,36(7):37-40. |
| |
| Authors: | HUO Bin-yan |
| |
| Institution: | HUO Bin-yan (Computer and Information Engineering College, Heilongjiang Institute of Science and Technology, Harbin 150027, China) |
| |
| Abstract: | The mini-node DOM tree conception is presented. The initial rule is classified into rough rule and fine rule, thus the height of DOM tree is reduced and the efficiency of extraction is improved. A Web information extraction rule system based on mini-node DOM tree was designed and implemented. |
| |
| Keywords: | Web information extraction extraction rule mini-node DOM tree |
| 本文献已被 维普 万方数据 等数据库收录！ |
