The Evolutionary PageRank Approach for Journal Ranking
博士 === 國立中央大學 === 資訊管理學系 === 102 === The journal ranking problem has drawn a great deal of attention from researchers in various fields due to its importance in the evaluation of academic performance. Most previous studies solved the journal ranking problem with either a subjective approach based on...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/vtjr2w |
id |
ndltd-TW-102NCU05396004 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102NCU053960042019-05-15T21:32:34Z http://ndltd.ncl.edu.tw/handle/vtjr2w The Evolutionary PageRank Approach for Journal Ranking 運用演化式 PageRank之期刊排名演算法 Xiang-han Chen 陳詳翰 博士 國立中央大學 資訊管理學系 102 The journal ranking problem has drawn a great deal of attention from researchers in various fields due to its importance in the evaluation of academic performance. Most previous studies solved the journal ranking problem with either a subjective approach based on expert survey metrics or an objective approach based on citation-based metrics. Since both approaches have their own advantages and disadvantages, and since they are usually complementary, this work proposes a brand new approach that integrates the two previous approaches. In addition, the class-ranking is quite valuable method to provide decision makers with the incentive preparation in practice. However, it is a resource allocation and combinatorial optimization, so it is difficult to get results by the traditional citation analysis method. To this end, we propose the second approach in this study to solve the class-ranking with citation-based data. In this study, we propose two evolutionary PageRank algorithms. The first method uses the Multi-Objective Particle Swarm Optimization to balance citation analysis and expert opinion. Experiments evaluating ranking quality were carried out with citation records and experts’ surveys to show the effectiveness of the proposed method. The results indicate that the proposed method can improve PageRank journal ranking results. The second method uses a tree-based chromosome to represent a class-ranking problem. This encoding can be combining all assigned classes and prestige values in a chromosome effectively. We, also, use the Genetic Algorithm to determine an optimal graded assignment based on the citations and users constraints. Experimental results also proved that this method can be allocation classes precisely, and ensure the similarity between the members of the same class. Yen-Linag Chen 陳彥良 2014 學位論文 ; thesis 99 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立中央大學 === 資訊管理學系 === 102 === The journal ranking problem has drawn a great deal of attention from researchers in various fields due to its importance in the evaluation of academic performance. Most previous studies solved the journal ranking problem with either a subjective approach based on expert survey metrics or an objective approach based on citation-based metrics. Since both approaches have their own advantages and disadvantages, and since they are usually complementary, this work proposes a brand new approach that integrates the two previous approaches. In addition, the class-ranking is quite valuable method to provide decision makers with the incentive preparation in practice. However, it is a resource allocation and combinatorial optimization, so it is difficult to get results by the traditional citation analysis method. To this end, we propose the second approach in this study to solve the class-ranking with citation-based data.
In this study, we propose two evolutionary PageRank algorithms. The first method uses the Multi-Objective Particle Swarm Optimization to balance citation analysis and expert opinion. Experiments evaluating ranking quality were carried out with citation records and experts’ surveys to show the effectiveness of the proposed method. The results indicate that the proposed method can improve PageRank journal ranking results. The second method uses a tree-based chromosome to represent a class-ranking problem. This encoding can be combining all assigned classes and prestige values in a chromosome effectively. We, also, use the Genetic Algorithm to determine an optimal graded assignment based on the citations and users constraints. Experimental results also proved that this method can be allocation classes precisely, and ensure the similarity between the members of the same class.
|
author2 |
Yen-Linag Chen |
author_facet |
Yen-Linag Chen Xiang-han Chen 陳詳翰 |
author |
Xiang-han Chen 陳詳翰 |
spellingShingle |
Xiang-han Chen 陳詳翰 The Evolutionary PageRank Approach for Journal Ranking |
author_sort |
Xiang-han Chen |
title |
The Evolutionary PageRank Approach for Journal Ranking |
title_short |
The Evolutionary PageRank Approach for Journal Ranking |
title_full |
The Evolutionary PageRank Approach for Journal Ranking |
title_fullStr |
The Evolutionary PageRank Approach for Journal Ranking |
title_full_unstemmed |
The Evolutionary PageRank Approach for Journal Ranking |
title_sort |
evolutionary pagerank approach for journal ranking |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/vtjr2w |
work_keys_str_mv |
AT xianghanchen theevolutionarypagerankapproachforjournalranking AT chénxiánghàn theevolutionarypagerankapproachforjournalranking AT xianghanchen yùnyòngyǎnhuàshìpagerankzhīqīkānpáimíngyǎnsuànfǎ AT chénxiánghàn yùnyòngyǎnhuàshìpagerankzhīqīkānpáimíngyǎnsuànfǎ AT xianghanchen evolutionarypagerankapproachforjournalranking AT chénxiánghàn evolutionarypagerankapproachforjournalranking |
_version_ |
1719115431373963264 |