A site-ranking algorithm for a small group of sites

Authors:
KiJoo Kim;MunSu Kang;YoungSik Choi
Affiliations:
Department of Computer Engineering, Korea Aerospace University, Goyang-City, Gyeonggi-Province, Korea;Department of Computer Engineering, Korea Aerospace University, Goyang-City, Gyeonggi-Province, Korea;Department of Computer Engineering, Korea Aerospace University, Goyang-City, Gyeonggi-Province, Korea
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Year:
2007

Citing 6
Cited 0

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Mining the Web: Discovering Knowledge from HyperText Data

Mining the Web: Discovering Knowledge from HyperText Data
Three target document range metrics for university web sites

Journal of the American Society for Information Science and Technology
Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search

IEEE Transactions on Knowledge and Data Engineering
Block-level link analysis

Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
The powerrank web link analysis algorithm

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hyperlink, or shortly link, analysis seeks to model the web structures and discover the relations among web sites or Web pages. The extracted models or relations can be used for the web mining applications, including market researches and various online businesses. It is well known that PageRank of Google's search engine is one of the most successful stories of link analysis. In this paper, we investigate into the link structures among the sites, each of which is the collection of web pages in the same university domain in Korea. However, the PageRank algorithm cannot be directly applied to the ranking of a relatively small number of sites or communities since the transition probabilities from a node with a low out-degree significantly affect the whole rankings among the sites. We modify the original version of the PageRank algorithm in order to make it fit into the site ranking, we propose a site ranking algorithm, which is a modification of the PageRank algorithm. The experimental results show that our approach to the site ranking performs much better than PageRank.