DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 95 === As the increasing of importance in search engines, Internet users change their behavior browsing the Internet little by little. In recent years, most part of search engines use link analysis algorithms to measure the importance of web pages. They employ the co...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/73139679471982609346 |
id |
ndltd-TW-095NCKU5392059 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-095NCKU53920592015-10-13T13:59:58Z http://ndltd.ncl.edu.tw/handle/73139679471982609346 DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence DRank+:一個加速網頁聲望收斂的目錄特徵網頁聲望預測方法 Chia-Sheng Liu 劉家升 碩士 國立成功大學 資訊工程學系碩博士班 95 As the increasing of importance in search engines, Internet users change their behavior browsing the Internet little by little. In recent years, most part of search engines use link analysis algorithms to measure the importance of web pages. They employ the conventional flat web graph constructed by web pages and link relation of web pages to measure the relative importance of web pages. The most famous link analysis algorithm is PageRank algorithm. However, previous researches in recent years have found that there exists an inherent bias against newly created pages in PageRank. For this issue, some researchers have proposed a new ranking algorithm called Page Quality to solve it. Page Quality utilizes the difference of PageRank at continuous time stages to predict a reasonable importance score of pages at next time stage. We also have proposed a new ranking algorithm called DRank to solve the same issue last year. It utilizes the intrinsic characteristic of hierarchical structure embedded in URL and the cluster phenomenon of PageRank in a directory to predict the possible importance of pages in the future and to diminish the inherent bias of search engines to new pages. In this paper, we modify the original DRank algorithm and propose a new ranking algorithm called MDRank to complement the weaker part of DRank which could fail while the number of pages in directory is not enough. The integrated algorithm is called DRank+, which combines DRank and MDRank. In our experiments, the modified DRank algorithm obtains more accuracy in predicting the importance score of pages at next time stage than the original DRank algorithm. Furthermore, MDRank can also obtain more accuracy in predicting the future importance score of pages while the number of pages in directories is few. It also interprets that DRank+ not only alleviates the bias of newly created pages successfully but also reaches more accuracy than Page Quality and original DRank in predicting the importance of newly created pages. Hung-Yu Kao 高宏宇 2007 學位論文 ; thesis 41 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 95 === As the increasing of importance in search engines, Internet users change their behavior browsing the Internet
little by little. In recent years, most part of search engines use link analysis algorithms to measure the importance of web pages. They employ the conventional flat web graph constructed by web pages and link relation of web
pages to measure the relative importance of web pages. The most famous link analysis algorithm is PageRank algorithm. However, previous researches in recent years have found that there exists an inherent bias against newly created pages in PageRank. For this issue, some researchers have proposed a new ranking algorithm called Page Quality to solve it. Page Quality utilizes the difference of PageRank at continuous time stages to predict a reasonable importance score of pages at next time stage. We also have proposed a new ranking algorithm called DRank to solve the same issue last year. It utilizes the intrinsic characteristic of hierarchical structure embedded in URL and the cluster phenomenon of PageRank in a directory to predict the possible importance of pages in the future and to diminish the inherent bias of search engines to new pages. In this paper, we modify the original DRank algorithm and propose a new ranking algorithm called MDRank to complement the weaker part of DRank which could fail while the number of pages in directory is not enough. The integrated algorithm is called DRank+, which combines DRank and MDRank. In our experiments, the modified DRank algorithm obtains more accuracy in predicting the importance score of pages at next time stage than the original DRank algorithm. Furthermore, MDRank can also obtain more accuracy in predicting the future importance score of pages while the number of pages in directories is few. It also interprets that DRank+ not only alleviates the bias of newly created pages successfully but also reaches more accuracy than Page Quality and original DRank in predicting the importance of newly created pages.
|
author2 |
Hung-Yu Kao |
author_facet |
Hung-Yu Kao Chia-Sheng Liu 劉家升 |
author |
Chia-Sheng Liu 劉家升 |
spellingShingle |
Chia-Sheng Liu 劉家升 DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence |
author_sort |
Chia-Sheng Liu |
title |
DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence |
title_short |
DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence |
title_full |
DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence |
title_fullStr |
DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence |
title_full_unstemmed |
DRank+: A Directory based PageRank Prediction Method for Fast PageRank Convergence |
title_sort |
drank+: a directory based pagerank prediction method for fast pagerank convergence |
publishDate |
2007 |
url |
http://ndltd.ncl.edu.tw/handle/73139679471982609346 |
work_keys_str_mv |
AT chiashengliu drankadirectorybasedpagerankpredictionmethodforfastpagerankconvergence AT liújiāshēng drankadirectorybasedpagerankpredictionmethodforfastpagerankconvergence AT chiashengliu drankyīgèjiāsùwǎngyèshēngwàngshōuliǎndemùlùtèzhēngwǎngyèshēngwàngyùcèfāngfǎ AT liújiāshēng drankyīgèjiāsùwǎngyèshēngwàngshōuliǎndemùlùtèzhēngwǎngyèshēngwàngyùcèfāngfǎ |
_version_ |
1717747367917125632 |