Analysis of the weighted kappa and its maximum with Markov moves

10/01/2020
by   Fabio Rapallo, et al.
0

In this paper the notion of Markov move from Algebraic Statistics is used to analyze the weighted kappa indices in rater agreement problems. In particular, the problem of the maximum kappa and its dependence on the choice of the weighting schemes are discussed. The Markov moves are also used in a simulated annealing algorithm to actually find the configuration of maximum agreement.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/13/2022

The weighted Tower of Hanoi

The weighted Tower of Hanoi is a new generalization of the classical Tow...
research
05/15/2022

Hybrid Methods for Running MCMC over I× J× K Contingency Tables

We consider an I × J× K table with cell counts X_ijk≥ 0 for i = 1, … , I...
research
03/22/2019

Pressure and flow statistics of Darcy flow from simulated annealing

The pressure and flow statistics of Darcy flow through a random permeabl...
research
12/24/2019

Diffuse optical tomography by simulated annealing via a spin Hamiltonian

The inverse problem of diffuse optical tomography is solved by the Marko...
research
02/24/2020

Finite space Kantorovich problem with an MCMC of table moves

In Optimal Transport (OT) on a finite metric space, one defines a distan...
research
11/18/2009

A Geometric Approach to Sample Compression

The Sample Compression Conjecture of Littlestone & Warmuth has remained ...
research
05/17/2021

Compacting Squares

Edge-connected configurations of squares are a common model for modular ...

Please sign up or login with your details

Forgot password? Click here to reset