An entropy approach to the scaling of ordinal categorical data |
| |
Authors: | T R Jefferson J H May N Ravi |
| |
Institution: | (1) A. B. Freeman School of Business, Tulane University, USA;(2) The Katz Graduate School of Business, University of Pittsburgh, 214 Merivis Hall, Roberto Clemente Drive, 15260 Pittsburgh, PA;(3) Bell Laboratories, USA |
| |
Abstract: | This paper studies the problem of scaling ordinal categorical data observed over two or more sets of categories measuring a single characteristic. Scaling is obtained by solving a constrained entropy model which finds the most probable values of the scales given the data. A Kullback-Leibler statistic is generated which operationalizes a measure for the strength of consistency among the sets of categories. A variety of data of two and three sets of categories are analyzed using the entropy approach.This research was partially supported by the Air Force Office of Scientific Research under grant AFOSR 83-0234. The support by the Air Force through grant AFOSR-83-0234 is gratefully acknowledged. The comments of the editor and referees have been most helpful in improving the paper, and in bringing several additional references to our attention. |
| |
Keywords: | ordinal categorical data entropy minimum discrimination information scaling convex programming |
本文献已被 SpringerLink 等数据库收录! |