基于目录树的网络科技资源采集算法  

Crawler Algorithm Based on Directory Tree in Network Science and Technology Resource

作　　者：李国栋[1] 刘忠强[1] 柳长安[1] 

机构地区：[1]华北电力大学计算机科学与技术学院,北京102206

出　　处：《计算机工程》2009年第1期277-279,282,共4页Computer Engineering

基　　金：国家科技基础条件平台建设基金资助项目(2005DKA63904)

摘　　要：针对网络科技领域资源分类方式多样化、数据量大等特点,提出一种基于目录树的采集算法,以领域本体知识库提供的本体知识作为评价依据进行有效目录链接的提取和识别,通过一种改进的链接分析策略获取有效的节点链接并进行采集操作。该算法研究采集体系结构,注重对最新资源获取速度的优化。实验结果证明,该算法可有效提高资源采集速率。Aimming at full consideration of the characteristics of the network technology in a various methods of classification of resources and a large quantity, this paper proposes a kind of crawler algorithm based on directory tree. The algorithm extracts and recognizes the directory links based on domain ontology knowledge as effective evaluation, and links the nodes effectively through a modified strategy of link analysis, eventually carry through collecting operation. The algorithm not only studies in-depth on the crawler architecture, but also pays attention to the speed of access to the latest resources optimization. Experimental results show that the algorithm can effectively achieve the established objectives both in speed and efficiency.

关 键 词：科技资源 信息采集 目录树 本体 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]