I noticed the 2014 discussion of bootstrapping Krippendorff's alpha referring to Andrew Hayes website. Whoever is interested in this algorithm: One of Andrew Hayes' student discovered an oddity in the distribution obtained by this algorithm when data are very sparse. This has been corrected by a new 2016.10.10 version of the bootstrapping algorithm that avoids this oddity and is faster as well. You can find it by googling: boot.c-alpha. pdf. This algorithm is now implemented in Hayes' KALPHA. Should anyone have questions: klaus.krippendo...@asc.upenn.edu
Sent from my iPhone ______________________________________________ R-help@r-project.org mailing list -- To UNSUBSCRIBE and more, see https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
