| 書(shū)目名稱(chēng) | Metric Methods for Analyzing Partially Ranked Data | | 編輯 | Douglas E. Critchlow | | 視頻video | http://file.papertrans.cn/633/632462/632462.mp4 | | 叢書(shū)名稱(chēng) | Lecture Notes in Statistics | | 圖書(shū)封面 |  | | 描述 | 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 < n. More complex types of partially ranked data are also investigated. Group theory is an important tool for extending the metrics. Full rankings are identified with elements of the permutation group, whereas partial rankings are identified with points in a coset space of the permutation group. The problem thus becomes one of ex- tending metrics on the permutation group to metrics on a coset space of the permutation group. To carry out t | | 出版日期 | Book 1985 | | 關(guān)鍵詞 | Fitting; Likelihood; Variance; data analysis; multidimensional scaling | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-1106-8 | | isbn_softcover | 978-0-387-96288-7 | | isbn_ebook | 978-1-4612-1106-8Series ISSN 0930-0325 Series E-ISSN 2197-7186 | | issn_series | 0930-0325 | | copyright | Springer-Verlag Berlin Heidelberg 1985 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-8 01:07
發(fā)表于 2025-3-21 17:22:43
