Comparing with the greedy heuristic web spiders algorithm, the major advantages of the proposed non-greedy web spider algorithm display are in the following two aspects: on the one hand, it chooses some optimal link with the biggest link value and still chooses some subprime link to search, then using iterative thought to find more network information. This can not only improve the detection and inspection accuracy rate of all network knowledge, and with buffer queue to deposit link, we will gradually understand knowledge in a broader view formed from the whole network distribution by using the recursion.
展开▼
