Exact probabilities for the general matching problem.
The writer outlines how a FORTRAN 77 program is used to compute the probability of obtaining a given number of matched pairs of cards under the conditions of random pairing of two decks of arbitrary composition. He contends that the program offers an exact test of significance for J. Cohen's kappa...
| Publicado en: | Educational & Psychological Measurement Vol. 56; pp. 839 - 843 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Sage Publications Inc.
October 1996
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ssf&AN=507522940&site=ehost-live header: @attributes: shortDbName: ssf uiTerm: 507522940 longDbName: Social Sciences Full Text (H.W. Wilson) uiTag: AN controlInfo: bkinfo: jinfo: jid: 00131644 EPM jtl: Educational & Psychological Measurement issn: 00131644 maglogo: N pubinfo: dt: October 1996 vid: 56 pid: 344 pub: Sage Publications Inc. artinfo: ui: 507522940 10.1177/0013164496056005011 ppf: 839 ppct: 4 formats: tig: atl: Exact probabilities for the general matching problem. aug: au: Rae, Gordon su: Statistical software Matching theory Probability measures Computer software Psychometrics Probability theory sug: subj: Statistical software Matching theory Probability measures Computer software Psychometrics Probability theory ab: The writer outlines how a FORTRAN 77 program is used to compute the probability of obtaining a given number of matched pairs of cards under the conditions of random pairing of two decks of arbitrary composition. He contends that the program offers an exact test of significance for J. Cohen's kappa under the matching model. pubtype: Academic Journal doctype: Article src: R language: English refInfo: copyright: @attributes: flag: N holdings: @attributes: islocal: N |
|---|