N-Best Evaluation for Academic Hiring and Promotion

被引：5

作者：

Frank, Michael C. ^{[1
]}

机构：

[1] Stanford Univ, Dept Psychol, Stanford, CA 94305 USA

来源：

TRENDS IN COGNITIVE SCIENCES | 2019年 / 23卷 / 12期

关键词：

VALIDITY;

D O I：

10.1016/j.tics.2019.09.010

中图分类号：

B84 [心理学]; C [社会科学总论]; Q98 [人类学];

学科分类号：

03 ; 0303 ; 030303 ; 04 ; 0402 ;

摘要：

Current evaluations for scientists create perverse incentives. To avoid this issue, I propose an N-best policy: Hiring and promotion committees should solicit a few research products as the primary locus of evaluation. This policy aligns evaluation with the goal of selecting scientists who produce high-quality work.

引用

页码：983 / 985

页数：3

共 50 条

[1] Recommendations for the Evaluation of Academic Performance for Hiring and Promotion in Psychology
Gaertner, Anne
Leising, Daniel
Schoenbrodt, Felix D.
PSYCHOLOGISCHE RUNDSCHAU, 2023, 74 (03) : 166 - 174
[2] Improved N-Best Extraction with an Evaluation on Language Data
Bjoerklund, Johanna
Drewes, Frank
Jonsson, Anna
COMPUTATIONAL LINGUISTICS, 2022, 48 (01) : 119 - 153
[3] Results of the N-Best 2008 Dutch Speech Recognition Evaluation
van Leeuwen, David A.
Kessens, Judith
Sanders, Eric
van den Heuvel, Henk
INTERSPEECH 2009: 10TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION 2009, VOLS 1-5, 2009, : 2531 - +
[4] DISCRIMINATIVE RECOGNITION RATE ESTIMATION FOR N-BEST LIST AND ITS APPLICATION TO N-BEST RESCORING
Ogawa, Atsunori
Hori, Takaaki
Nakamura, Atsushi
2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 6832 - 6836
[5] ASR N-BEST FUSION NETS
Liu, Xinyue
Li, Mingda
Chen, Luoxin
Wanigasekara, Prashan
Ruan, Weitong
Khan, Haidar
Hamza, Wael
Su, Chengwei
2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021), 2021, : 7618 - 7622
[6] Parsing N-best lists of handwritten sentences
Zimmermann, M
Chappelier, JC
Bunke, H
SEVENTH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION, VOLS I AND II, PROCEEDINGS, 2003, : 572 - 576
[7] COMPUTING THE N-BEST LOOPLESS PATHS IN A NETWORK
CLARKE, S
KRIKORIAN, A
RAUSEN, J
JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1963, 11 (04): : 1096 - 1102
[8] LOOSE PHRASE EXTRACTION WITH n-BEST ALIGNMENTS
Xue Yongzeng Li Sheng (Microsoft Key Laboratory of Natural Language Processing and Speech
Journal of Electronics(China), 2007, (04) : 567 - 571
[9] SHoUT, the University of Twente Submission to the N-Best 2008 Speech Recognition Evaluation for Dutch
Huijbregts, Marijn
Ordelman, Roeland
van der Werff, Laurens
de Jong, Franciska
INTERSPEECH 2009: 10TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION 2009, VOLS 1-5, 2009, : 2547 - 2550
[10] N-best maximal decoders for part models
Park, Dennis
Ramanan, Deva
2011 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2011, : 2627 - 2634

← 1 2 3 4 5 →