Please wait a minute...
New Technology of Library and Information Service  2008, Vol. 24 Issue (9): 64-69    DOI: 10.11925/infotech.1003-3513.2008.09.11
Current Issue | Archive | Adv Search |
An Empirical Study of Ranking “211 Project” Universities Based on Websites Hyperlinks Analysis
Wang Jiandong  Sun Huiming
(Department of Information Management, Peking University,  Beijing 100871,China)
Download: PDF (522 KB)  
Export: BibTeX | EndNote (RIS)      

The paper points out that there are two defects in the current study on university evaluation based on websites hyperlinks analysis, the first lies in the hypothesis that all links are of equal importance and the second is the fact that the data are unreliable. Then the authors design an FBS crawling algorithm, which can crawl different types of websites to different extent, and construct and initiate a quantitative study on the hyperlink community of universities of “211 Project”. Based on the data, the authors design an experiment in order to test the three SNA indexes which can measure the significance of notes in the network. The results show that the proximity prestige index performs better than the other two indexes. Combining the proximity prestige index with PageRank arithmetic, the authors then design a new index, which is called “UnivRank” in short. The final results show that the new index performs significantly better than the other ones.

Key words Websites hyperlinks analysis      University evaluation      SNA      PageRank      UnivRank     
Received: 19 March 2008      Published: 25 September 2008


Corresponding Authors: Wang Jiandong     E-mail:
About author:: Wang Jiandong,Sun Huiming

Cite this article:

Wang Jiandong,Sun Huiming. An Empirical Study of Ranking “211 Project” Universities Based on Websites Hyperlinks Analysis. New Technology of Library and Information Service, 2008, 24(9): 64-69.

URL:     OR

[1] Webmetrics Ranking of World Universities January’07 Distribution by Continent[EB/OL]. (2006-07-20). [2007-07-11].
[2] 周思来. 基于网络计量指标的大学评价实验研究[D]. 北京:北京大学,2007.
[3] 张晓鹏. 从“基于网络的世界大学排名”看中国大学与世界及亚洲一流大学的差距[J]. 中国高等教育评估,2006(1):22-24.
[4] 段宇峰. 网络链接分析与网站评价研究[M]. 北京:北京图书馆出版社,2005.
[5] Google的秘密-PageRank 彻底解说[EB/OL]. [2007-07-11].
[6] Wouter de Nooy,  Mrvar A,  Batagelj V. Exploratory Social Network Analysis with Pajek[M]. Cambridge:Cambridge University Press, 2005.
[7] 邱均平. 世界一流大学及学科竞争力评价研究报告[M]. 北京:科学出版社. 2007.
[8] 《中国大学评价》课题组. 挑大学选专业-2007高考志愿填报指南[M]. 北京:中国统计出版社.2007.
[9] Google在线文档-Google的受欢迎的秘密[EB/OL]. (2005-07-20).[2007-07-11]. _use.html.

[1] Qikai Cheng,Jiamin Wang,Wei Lu. Discovering Domain Vocabularies Based on Citation Co-word Network[J]. 数据分析与知识发现, 2019, 3(6): 57-65.
[2] Chen Xiaowei,Shi Yutian. Identifying Key Nodes in Social Network with Improved PageRank Algorithm[J]. 数据分析与知识发现, 2017, 1(8): 68-75.
[3] Liu Tong,Yang Jingcheng. Evaluating Online Healthcare Consultation Feedbacks Based on Signal Transmission Algorithm[J]. 数据分析与知识发现, 2017, 1(11): 29-36.
[4] Tang Xiaobo, Fang Xiaoke. Research on Microblog Ranking Strategy with the Social Relations[J]. 现代图书情报技术, 2013, 29(9): 74-81.
[5] Liang Chen, Xu Jian. Research on Methods and Tools of Social Network Visualization[J]. 现代图书情报技术, 2012, 28(5): 7-15.
[6] Duan Xiaoli, Wang Yu. The Subject Extraction Based on Topic Segmentation and PageRank Algorithm[J]. 现代图书情报技术, 2010, 26(12): 34-39.
[7] Fu Zhenzhen,Lu Wei. The Search Engine Optimizing Strategy and Evaluation Based on Keywords[J]. 现代图书情报技术, 2009, 25(6): 61-65.
[8] He Minggui,Zhou Ning,Rong Huigui. Web Page Snapshot Based on Delta Encoding and It’s Visualization[J]. 现代图书情报技术, 2009, 25(5): 72-75.
[9] Zhao Huaming. Construction of High Available Platform for Information Services Based on Virtual Machine[J]. 现代图书情报技术, 2009, 25(12): 18-24.
[10] Dou Tianfang,Zhang Chengyu. The Establishment and Technology about  Storage System in Digital Library[J]. 现代图书情报技术, 2005, 21(1): 15-17.
[11] Yang Siluo. Research on Ranking Technology of Search Engines[J]. 现代图书情报技术, 2005, 21(1): 43-47.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938