By Topic

Discussion on interest spider's algorithm of search engine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Du ya-jun ; Dept. of Appl. Math., Southwest Jiaotong Univ., Chengdu, China ; Xu yang ; Li zhan-shen ; Qi Dong-mei

At this paper, by analyzing the crawler algorithm and its programs, we put forward an interest spider objecting to user. The spider takes on three characteristics: (1) understand means what user require, and analyze and conclude user's interest and crawl intelligently Internet by user history interest; (2) a much smaller user search space than the space of Internet; (3) search process on real time with user's keyword and history interest. And so, the spider spends 2∼10 minutes.

Published in:

Information Reuse and Integration, 2004. IRI 2004. Proceedings of the 2004 IEEE International Conference on

Date of Conference:

8-10 Nov. 2004