世界大学计算机科学cs排,CSrankings: CSranking 是一个用于计算全球院校的计算机科学领域实力排名的开源项目,它由麻省大学阿姆斯特分校计算机与信息科学学院教授 Emery Berge...

Computer Science Rankings

This ranking of top computer science schools is designed to identify institutions and faculty actively engaged in research across a number of areas of computer science. Unlike US News and World Report's approach, which is exclusively based on surveys, this ranking is entirely metrics-based. It measures the number of publications by faculty that have appeared at the most selective conferences in each area of computer science.

This approach is intended to be difficult to game, since publishing in such conferences is generally difficult: contrast this with other approaches like citation-based metrics, which have been repeatedly shown to be easy to manipulate. That said, incorporating citations in some form is a long-term goal.

See the FAQ for more details.

This repository contains all code and data used to build the computer science rankings website, hosted here:

http://csrankings.org

Adding or modifying affiliations

You can now edit files directly in GitHub to create pull requests. All data is

in the files csrankings-[0-9].csv, with authors listed in

alphabetical order by their first name. Please read CONTRIBUTING.md for full details on

how to contribute.

Trying it out at home

Because of GitHub size limits, to run this site, you will want to download the DBLP

data by running make update-dblp (note that this will consume

upwards of 19GiB of memory). To then rebuild the databases, just run

make. You can test it by running a local web server (e.g., python3 -m http.server)

and then connecting to http://0.0.0.0:8000.

You will also need to install libxml2-utils (or whatever package

includes xmllint on your distro), npm, typescript, closure-compiler, python-lxml, pypy,

and basex via a command line like:

apt-get install libxml2-utils npm python-lxml basex; npm install -g typescript google-closure-compiler

Quick contribution via a shallow clone

A full clone of the CSrankings repository is almost 2GB, and the

csrankings.csv file is too large to edit via the GitHub web site. To

contribute a change without creating a full local clone of the

CSrankings repo, you can do a shallow clone. To do so, follow these

steps:

Fork the CSrankings repo. If you have an existing fork, but it is

not up to date with the main repository, this technique may not

work. If necessary, delete and re-create your fork to get it up to

date. (Do not delete your existing fork if it has unmerged changes you

want to preserve!)

Do a shallow clone of your fork: git clone --depth 1 https://github.com/yourusername/CSrankings. This will only download

the most recent commit, not the full git history.

Make your changes on a branch, push them to your clone, and create

a pull request on GitHub as usual.

If you want to make another contribution and some time has passed,

perform steps 1-3 again, creating a fresh fork and shallow clone.

Acknowledgements and other rankings

This site was developed primarily by and is maintained by Emery

Berger. It incorporates extensive feedback

from too many folks to mention here, including many contributors who

have helped to add and maintain faculty affiliations, home pages, and

so on.

This site was initially based on code and

data collected by Swarat

Chaudhuri (Rice University), though

it has evolved considerably since its inception. The

original faculty affiliation dataset was constructed by Papoutsaki et

al.; since

then, it has been extensively cleaned and updated by numerous

contributors. A previous ranking

also used DBLP and Brown's dataset for ranking theoretical computer

science.

This site uses information from DBLP.org which is made

available under the ODC Attribution License.

License

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值