Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Metric Methods for Analyzing Partially Ranked Data

Metric Methods for Analyzing Partially Ranked Data

Critchlow, Douglas E.

Paperback

Series: Lecture Notes in Statistics, Book 34

General MathematicsProbability & Statistics

ISBN10: 0387962883
ISBN13: 9780387962887
Publisher: Springer Nature
Published: Jan 6 1986
Pages: 216
Weight: 0.73
Height: 0.49 Width: 6.14 Depth: 9.21
Language: English
A full ranking of n items is simply an ordering of all these items, of the form: first choice, second choice, -. ., n-th choice. If two judges each rank the same n items, statisticians have used various metrics to measure the closeness of the two rankings, including Ken- dall's tau, Spearman's rho, Spearman's footrule, Ulam's metric, Hal1l11ing distance, and Cayley distance. These metrics have been em- ployed in many contexts, in many applied statistical and scientific problems. Thi s monograph presents genera 1 methods for extendi ng these metri cs to partially ranked data. Here partially ranked data refers, for instance, to the situation in which there are n distinct items, but each judge specifies only his first through k-th choices, where k

Also in

Probability & Statistics

View All