forked from emeryberger/CSrankings
-
Notifications
You must be signed in to change notification settings - Fork 0
/
faq.html
566 lines (509 loc) · 15.5 KB
/
faq.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
<html>
<head>
<link href='https://fonts.googleapis.com/css?family=News+Cycle:400,700' rel='stylesheet' type='text/css'>
<link rel="stylesheet" href="css/bootstrap.min.css">
<meta name="description" content="Computer Science Rankings">
<meta name="keywords" content="computer science rankings, best computer science programs, best computer science schools, top computer science schools, top computer science universities, best computer science programs">
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {inlineMath: [["$","$"],["\\(","\\)"]]}
});
</script>
<script type="text/javascript" src="https://www.tuhh.de/MathJax/MathJax.js?config=TeX-AMS_HTML-full"></script>
<title>FAQ - CSRankings: Computer Science Rankings (beta)</title>
<!-- <link rel="stylesheet" href="css/bootstrap-theme.min.css"> -->
<script>
(function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
(i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
})(window,document,'script','https://www.google-analytics.com/analytics.js','ga');
ga('create', 'UA-78147305-1', 'auto');
ga('send', 'pageview');
</script>
<script src="js/bootstrap.min.js"></script>
<style type="text/css">
body {
font-family: Helvetica, Arial;
}
table td {
vertical-align: top;
}
td {
padding-top: 2px;
padding-bottom: 2px;
}
a {
color : blue ;
}
a.only_these_areas {
cursor: pointer;
}
div.hovertip {
cursor: pointer;
}
span.hovertip {
cursor: pointer;
}
</style>
</head>
<body>
<div class="container">
<div class="page-header">
<h1>FAQ Computer Science Rankings (beta)</h1>
<div class="panel panel-info">
<div class="panel-heading">
<p>
Frequently asked questions for <a href="http://csrankings.org">CSRankings.org</a>.
</p>
<div class="row">
<!-- col-xs-3 col-sm-6 col-md-4 -->
<div class="col-sm-12 col-md-12 col-lg-12">
<div class="table">
<table class="table-sm table-striped">
<thead>
<tr>
<th>
<p><br />Why another ranking? Why this methodology?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
Rankings are intensely popular and
influential. While we might wish for a
world without rankings, wishing will not
make rankings go away.
</p>
<p>Given this state of affairs, it makes
sense to aim for a ranking system that
is meaningful and transparent. Unfortunately, the most influential
rankings right now are those from US
News and World Report, which is entirely
reputation-based and <a target="_blank"
href="http://www.usnews.com/education/best-graduate-schools/articles/science-schools-methodology">relies
on surveys sent to department heads and
directors of graduate studies.</a>
</p>
<p>
By contrast, CSRankings is entirely
metrics-based: it weighs departments by
their presence at the most prestigious
publication venues. This approach is
intended to be both incentive-aligned
(faculty already aim to publish at top
venues) and difficult to game, since
publishing in such conferences is
difficult. It is admittedly bean-counting,
but its intent is to "count the right
beans." It is also entirely transparent;
all code and data are publicly available
at <a href="https://github.com/emeryberger/CSRankings">
https://github.com/emeryberger/CSRankings
</a> under a <a rel="license"
href="http://creativecommons.org/licenses/by-nc-nd/4.0/">Creative
Commons
Attribution-NonCommercial-NoDerivatives
4.0 International License</a> (note: this
means you may not distribute anything built from
CSrankings' code or data).
</p>
<p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />How about incorporating citations?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
Unfortunately, citation-based metrics have
been repeatedly shown to
be <a target="_blank"
href="http://arxiv.org/abs/1212.0638">subject</a>
to <a target="_blank"
href="http://evaluation.hypotheses.org/files/2010/12/pdf_IkeAntkareISSI.pdf">manipulation</a>. There
are <a href="http://retractionwatch.com/2017/08/22/one-way-boost-unis-ranking-ask-faculty-cite/">universities
instructing faculty</a> to cite each
other, and the phenomenon
of <a href="https://www.statnews.com/2017/01/13/citation-cartels-science/">"citation
cartels"</a> is well documented.
</p>
<p>There are also methodological challenges:
citations for all papers are not freely
available and change rapidly, and citation
count systems like Google Scholar do not do
a great job of disambiguating
authors <em>and</em> can be gamed by
authors. (See <a href="https://scholar.google.com/citations?user=qGuYgMsAAAAJ&hl=en">Et
al.'s</a> page for a humorous example.)
</p>
<p>Note that selective conferences are
already a proxy for citation impact:
papers published at these conferences are
on average much more highly cited than
papers that appear in less selective, less
prestigious venues.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />What do <em>adjusted counts</em> and <em>average counts</em> mean?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p><b>Adjusted counts</b>: each publication is counted
exactly once, with credit adjusted by splitting evenly
across all co-authors. This approach makes it impossible to
boost rankings simply by adding authors to a paper.
</p>
<p>
<b>Average count</b> is the geometric mean
of the adjusted counts per area (for n areas selected, this is the nth
root of the product of all adjusted counts (+ 1)).
$$averageCount = \sqrt[N]{\prod_{i=1}^N(adjustedCounts_i + 1)}$$
<em>This
computation implicitly normalizes for publication rates and sizes of
areas.</em>
</p>
<p>
Note that publications must be at least 6 pages long to be counted.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />
How were research areas determined?
<br />
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
Nearly all categories are based on
research-focused <a href="http://www.acm.org/special-interest-groups">ACM
SIGs</a>. Areas not represented by ACM
SIGs are intended to span <em>most</em>
established research-centric areas of
computer science.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />Why is (some area) not included?<br />
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
For any research-focused area to be
included, at least 50
<a href="https://en.wikipedia.org/wiki/List_of_research_universities_in_the_United_States#Universities_classified_as_.22R1:_Doctoral_Universities_-_Highest_Research_Activity.22">R1
institutions</a> must have publications in the
top conferences in that area in the last 10 years.
This threshold is to ensure that there is
enough research activity in an area to
enable a meaningful ranking. A number of ACM
SIGs do not meet this criteria.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />
How were the conferences selected?
<br />
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
The conferences listed were developed in consultation
with faculty across a range of
institutions, including via community surveys.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />Why so few conferences per area?<br />
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
Only the very top conferences in each area
are listed. All conferences listed must be
roughly equivalent in terms of number of
submissions, selectivity and impact to
avoid creating incentives to target less
selective conferences.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />Why is conference X not listed?<br />
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
Additional
conferences are not listed when they
are not roughly equivalent to the rest in
terms of number of submissions,
selectivity and citation impact.
</p>
<p>For example: in the area of programming
languages, PLDI and POPL
currently get roughly 300 and 220
submissions each year, respectively. Their
acceptance rates over the last 10 years
are 20% and 21%, while their
citation impacts (measured by h5-median,
via Google Scholar) are 69 and 65 (higher is better).
</p>
<p>For illustration, here are the stats for
other conferences in this area which did not make the cut:
<ul>
<li>OOPSLA: 200 submissions / year, 25% acceptance rate, h5-median: 49.</li>
<li>PPoPP: 150 submissions / year, 21% acceptance rate, h5-median: 50.</li>
<li>ICFP: 100 submissions / year, 31% acceptance rate, h5-median: 35.</li>
</ul>
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />How is authorship count adjusted?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
A single faculty member gets 1/N credit for a paper, where N is the
number of authors, regardless of their affiliation or status (faculty,
student, or otherwise). The number never changes. A paper can count
for at most 1.0, in the case that all authors are / end up becoming
faculty in the database.
</p>
<p>
The key downside to counting papers
without adjusting for authors is that it
would make it trivial to inflate the
effect of writing a single paper simply by
adding authors. Splitting authorship
credit means that authors are incentivized
to
appropriately <a href="http://www.acm.org/publications/policies/policy_on_authorship">treat
authorship credits</a>. Note that
publication rates are normalized across
areas.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />How about adjusting the count only by faculty in the database (or some other means)?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
Here are some of the
numerous downsides of only including
authors present in the database:
<ul>
<li>Authorship counts would be difficult
to calculate (manually).</li>
<li>Authorship counts would be dynamic
(that is, they would change over
time). When an author dies and is no
longer in the database, everyone else
would have to have their credit
increased (talk about perverse
incentives).</li>
<li>It would create an incentive
for senior faculty to have their junior
collaborators not get tenure (since they
would then likely leave the
database).</li>
<li>It would favor collaboration with
industry (not in the database) over
collaboration with academics. Note that
companies do not
generally provide public access to their
employee directories.</li>
<li>It would create a disincentive for
faculty to see their students get
faculty appointments (since it would
reduce credit).</li>
</ul>
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />What are the criteria for including faculty?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
The criteria for inclusion are that anyone who is a full-time,
tenure-track faculty member on a given
campus <em>who can <b>solely</b> advise PhD
students</em> in Computer Science can be
included in the database. This approach
thus extends the reach of the database to
a number of faculty from other departments
who have adjunct appointments with a CS
department or similar that let them advise
CS PhD students.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />What about including faculty from ECE, Informatics, etc.?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
As mentioned above, tenure-track faculty
who can advise PhD students in CS can be
included regardless of their home
department. The primary audience of
CSRankings is prospective graduate
students who are seeking a postgraduate
degree in Computer Science.
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />Why isn't <em>(prestigious science journal A)</em> included?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
CSrankings uses DBLP as its data source,
and DBLP does not currently index general
science journals (including Science, Nature,
and PNAS).
</p>
</td>
</tr>
</tbody>
<thead>
<tr>
<th>
<p><br />How can I submit change requests (to add faculty, change home pages, change affiliations, etc.)?
</p>
</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<p>
<em>Submit a pull request</em> for
the <a href="https://github.com/emeryberger/CSRankings">CSrankings GitHub repo</a>.
<a href="https://github.com/emeryberger/CSrankings/blob/gh-pages/docs/CONTRIBUTING.md">More details<//a>, <a href="https://www.digitalocean.com/community/tutorials/how-to-create-a-pull-request-on-github">tutorial on pull requests here</a>.
</p>
<p>
Make sure that faculty members' names correspond to
their <a href="http://dblp.uni-trier.de/search/">DBLP</a>
author entries.
<b>Please
also read <a href="https://github.com/emeryberger/CSrankings/blob/gh-pages/docs/CONTRIBUTING.md">this
guide to contributing</a> before
submitting any proposed changes.</b>
</p>
</td>
</tr>
</tbody>
</table>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</body>
</html>