首页 | 本学科首页   官方微博 | 高级检索  
     


A minimum-cost network-flow solution to the case V thurstone scaling problem
Authors:James M. Lattin
Affiliation:(1) Graduate School of Business, Stanford University, 94305 Stanford, California
Abstract:This paper presents an approach for determining unidimensional scale estimates that are relatively insensitive to limited inconsistencies in paired comparisons data. The solution procedure, shown to be a minimum-cost network-flow problem, is presented in conjunction with a sensitivity diagnostic that assesses the influence of a single pairwise comparison on traditional Thurstone (ordinary least squares) scale estimates. When the diagnostic indicates some source of distortion in the data, the network technique appears to be more successful than Thurstone scaling in preserving the interval scale properties of the estimates.My special thanks go to Alvin Silk, Thomas Magnanti, and Roy Welsch for their support and advice throughout the formative stages of this paper, and to V. Srinivasan for his helpful comments on a later draft of this paper. I also wish to thank the Editor, Associate Editor, and two reviewers for their constructive suggestions.James M. Lattin is Associate Professor of Marketing and Management Science and the James and Doris McNamara Faculty Fellow for 1988-1989.
Keywords:Thurstone scaling  outliers  sensitivity diagnostic  network optimization
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号