scholarly journals Weighting schemes and incomplete data: A generalized Bayesian framework for chance-corrected interrater agreement.

2021 ◽  
Author(s):  
Rutger van Oest ◽  
Jeffrey M. Girard
2021 ◽  
Author(s):  
Rutger Van Oest ◽  
Jeffrey M. Girard

Van Oest (2019) developed a framework to assess interrater agreement for nominal categories and complete data. We generalize this framework to all four situations of nominal or ordinal categories and complete or incomplete data. The mathematical solution yields a chance-corrected agreement coefficient that accommodates any weighting scheme for penalizing rater disagreements and any number of raters and categories. By incorporating Bayesian estimates of the category proportions, the generalized coefficient also captures situations in which raters classify only subsets of items; that is, incomplete data. Furthermore, this coefficient encompasses existing chance-corrected agreement coefficients: the S-coefficient, Scott’s pi, Fleiss’ kappa, and Van Oest’s uniform prior coefficient, all augmented with a weighting scheme and the option of incomplete data. We use simulation to compare these nested coefficients. The uniform prior coefficient tends to perform best, in particular, if one category has a much larger proportion than others. The gap with Scott’s pi and Fleiss’ kappa widens if the weighting scheme becomes more lenient to small disagreements and often if more item classifications are missing; missingness biases play a moderating role. The uniform prior coefficient usually performs much better than the S-coefficient, but the S-coefficient sometimes performs best for small samples, missing data, and lenient weighting schemes. The generalized framework implies a new interpretation of chance-corrected weighted agreement coefficients: These coefficients estimate the probability that both raters in a pair assign an item to its correct category without guessing. Whereas Van Oest showed this interpretation for unweighted agreement, we generalize to weighted agreement.


2020 ◽  
Author(s):  
Julie Inge-Marie Helene Borchsenius ◽  
Rasmus Hasselbalch ◽  
Morten Lind ◽  
Lisbet Ravn ◽  
Thomas Kallemose ◽  
...  

Abstract Introduction Systematic triage is performed in the Emergency Department (ED) to assess the urgency of care for each patient. The Copenhagen Triage Algorithm (CTA) is a newly developed, evidence-based triage system, however the interrater agreement remains unknown. Method This was a prospective cohort study. The collection of data was conducted in the three sections (Acute/Cardiology, Medicine and Surgery) of the ED of Herlev Hospital. Patients were assessed independently by two different nurses using CTA. The interrater variability of CTA was calculated using Fleiss kappa. The analysis was stratified according to less or more than 2 years of ED experience. Results A total of 110 patients were included of which 10 were excluded due to incomplete data. The raters agreed on triage category 80 % of the time corresponding to a kappa value of 0.70 (95% confidence interval 0.57-0.83). Stratified on ED sections, the agreement was 83 % in the Acute/Cardiology section corresponding to a kappa value of 0.73 (0.55-0.91), 79 % in the Medicine section corresponding to a kappa value of 0.64 (0.39-0.89) and 0.56 % in the Surgery section corresponding to a kappa value of 0.56 (0.21-0.90). The experienced raters had an interrater agreement of 0.73 (0.56-0.90), while the less experienced raters had an agreement of 0.76, (0.28-1.24). Conclusion A substantial interrater agreement was found for the Copenhagen triage algorithm.


1997 ◽  
Vol 36 (04/05) ◽  
pp. 41-46
Author(s):  
A. Kjaer ◽  
W. Jensen ◽  
T. Dyrby ◽  
L. Andreasen ◽  
J. Andersen ◽  
...  

Abstract.A new method for sleep-stage classification using a causal probabilistic network as automatic classifier has been implemented and validated. The system uses features from the primary sleep signals from the brain (EEG) and the eyes (AOG) as input. From the EEG, features are derived containing spectral information which is used to classify power in the classical spectral bands, sleep spindles and K-complexes. From AOG, information on rapid eye movements is derived. Features are extracted every 2 seconds. The CPN-based sleep classifier was implemented using the HUGIN system, an application tool to handle causal probabilistic networks. The results obtained using different training approaches show agreements ranging from 68.7 to 70.7% between the system and the two experts when a pooled agreement is computed over the six subjects. As a comparison, the interrater agreement between the two experts was found to be 71.4%, measured also over the six subjects.


2019 ◽  
Vol 2 (5) ◽  
Author(s):  
Ji-hua Hu ◽  
Jia-xian Liang

Interstation travel speed is an important indicator of the running state of hybrid Bus Rapid Transit and passenger experience. Due to the influence of road traffic, traffic lights and other factors, the interstation travel speeds are often some kind of multi-peak and it is difficult to use a single distribution to model them. In this paper, a Gaussian mixture model charactizing the interstation travel speed of hybrid BRT under a Bayesian framework is established. The parameters of the model are inferred using the Reversible-Jump Markov Chain Monte Carlo approach (RJMCMC), including the number of model components and the weight, mean and variance of each component. Then the model is applied to Guangzhou BRT, a kind of hybrid BRT. From the results, it can be observed that the model can very effectively describe the heterogeneous speed data among different inter-stations, and provide richer information usually not available from the traditional models, and the model also produces an excellent fit to each multimodal speed distribution curve of the inter-stations. The causes of different speed distribution can be identified through investigating the Internet map of GBRT, they are big road traffic and long traffic lights respectively, which always contribute to a main road crossing. So, the BRT lane should be elevated through the main road to decrease the complexity of the running state.


Sign in / Sign up

Export Citation Format

Share Document