[PDF] from asu.eduR Balakrishnan… - Proceedings of the 20th …, 2011 - portal.acm.org ... sources. This adjustedagreement is modeled as a graph with sources at the vertices. On this agreement graph, a quality score of a source that we call SourceRank, is calculated as the stationary visit probabil- ity of a random walk. ... Cited by 4 - Related articles - All 9 versions
A Ippolito, DJ Wallace, D Gladman, PR Fortin… - Lupus, 2011 - lup.sagepub.com ... In our study, the kappa for ANA was 'fair.' However, the reason the kappa is low is because kappa does not measure pure agreement, but 'chance-adjusted' agreement, ie, how much more agreement is present than would be expected by chance alone, given the frequency of ... Cited by 1 - Related articles - All 3 versions
[PDF] from www2011india.comR Balakrishnan… - Proceedings of the 20th …, 2011 - portal.acm.org ... The agreement computed between the same two sources is multiplied by (1 − collusion) to get the adjustedagreement used for computing SourceRank above. 3.5 Online Query Processing To process the queries, the top-k sources with the highest SourceRank are selected. ... Cited by 2 - Related articles - All 5 versions
[CITATION] Getting to yes: Negotiating agreement without giving in
[PDF] from steveborgatti.comSP Borgatti… - A Companion to Cognitive …, 2011 - books.google.com ... is on the right. Since L is just a constant, the entire right side is just a linear scaling of mij, which is the amount of agreement between students I and J. For convenience, we call this adjustedagreement m* ij. did j=(Lmij− 1)/(L ... Cited by 1 - Related articles - All 6 versions
沪公网安备号：31010402006960 （网站）31010405000484 （蝌蝌APP）
安全保密
