A FAST COMMUNITY BASED ALGORITHM FOR GENERATING WEB CRAWLER SEEDS SET

Shervin Daneshpajouh, Mojtaba Mohammadi Nasiri, Mohammad Ghodsi

2008

Abstract

In this paper, we present a new and fast algorithm for generating the seeds set for web crawlers. A typical crawler normally starts from a fixed set like DMOZ links, and then continues crawling from URLs found in these web pages. Crawlers are supposed to download more good pages in less iterations. Crawled pages are good if they have high PageRanks and are from different communities. In this paper, we present a new algorithm with O(n) running time for generating crawler's seeds set based on HITS algorithm. A crawler can download qualified web pages, from different communities, starting from generated seeds set using our algorithm in less iteration.

Paper Citation

in Harvard Style

Daneshpajouh S., Mohammadi Nasiri M. and Ghodsi M. (2008). A FAST COMMUNITY BASED ALGORITHM FOR GENERATING WEB CRAWLER SEEDS SET . In Proceedings of the Fourth International Conference on Web Information Systems and Technologies - Volume 2: WEBIST, ISBN 978-989-8111-27-2, pages 98-105. DOI: 10.5220/0001527400980105

in Bibtex Style

@conference{webist08,
author={Shervin Daneshpajouh and Mojtaba Mohammadi Nasiri and Mohammad Ghodsi},
title={A FAST COMMUNITY BASED ALGORITHM FOR GENERATING WEB CRAWLER SEEDS SET},
booktitle={Proceedings of the Fourth International Conference on Web Information Systems and Technologies - Volume 2: WEBIST,},
year={2008},
pages={98-105},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001527400980105},
isbn={978-989-8111-27-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Web Information Systems and Technologies - Volume 2: WEBIST,
TI - A FAST COMMUNITY BASED ALGORITHM FOR GENERATING WEB CRAWLER SEEDS SET
SN - 978-989-8111-27-2
AU - Daneshpajouh S.
AU - Mohammadi Nasiri M.
AU - Ghodsi M.
PY - 2008
SP - 98
EP - 105
DO - 10.5220/0001527400980105