Distance-based tree models for ranking data
Ranking data has applications in different fields of studies, like marketing, psychology and politics. Over the years, many models for ranking data have been developed. Among them, distance-based ranking models, which originate from the classical rank correlations, postulate that the probability of observing a ranking of items depends on the distance between the observed ranking and a modal ranking. The closer to the modal ranking, the higher the ranking probability is. However, such a model basically assumes a homogeneous population and does not incorporate the presence of covariates. To overcome these limitations, we combine the strength of a tree model and the existing distance-based models to build a model that can handle more complexity and improve prediction accuracy. We will introduce a recursive partitioning algorithm for building a tree model with a distance-based ranking model fitted at each leaf. We will also consider new weighted distance measures which allow different weights for different ranks in formulating more flexible distance-based tree models. Finally, we will apply the proposed methodology to analyze a ranking dataset of Inglehart's items collected in the 1999 European Values Studies.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Ahn, Hongshik, 1996. "Log-normal regression modeling through recursive partitioning," Computational Statistics & Data Analysis, Elsevier, vol. 21(4), pages 381-398, April.
- Agostino Tarsitano, 2009. "Comparing The Effectiveness Of Rank Correlation Statistics," Working Papers 200906, Università della Calabria, Dipartimento di Economia, Statistica e Finanza "Giovanni Anania" - DESF.
- Train,Kenneth E., 2009.
"Discrete Choice Methods with Simulation,"
Cambridge University Press, number 9780521766555.
- Train,Kenneth E., 2009. "Discrete Choice Methods with Simulation," Cambridge Books, Cambridge University Press, number 9780521747387, February.
- Kenneth Train, 2003. "Discrete Choice Methods with Simulation," Online economics textbooks, SUNY-Oswego, Department of Economics, number emetr2.
- Hausman, Jerry A. & Ruud, Paul A., 1987. "Specifying and testing econometric models for rank-ordered data," Journal of Econometrics, Elsevier, vol. 34(1-2), pages 83-104.
- Francesco Audrino & Peter Bühlmann, 2001. "Tree-structured generalized autoregressive conditional heteroscedastic models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 63(4), pages 727-744.
- Beggs, S. & Cardell, S. & Hausman, J., 1981. "Assessing the potential demand for electric cars," Journal of Econometrics, Elsevier, vol. 17(1), pages 1-19, September.
- Murphy, Thomas Brendan & Martin, Donal, 2003. "Mixtures of distance-based models for ranking data," Computational Statistics & Data Analysis, Elsevier, vol. 41(3-4), pages 645-655, January.
- Philip Yu, 2000. "Bayesian analysis of order-statistics models for ranking data," Psychometrika, Springer;The Psychometric Society, vol. 65(3), pages 281-299, September. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:54:y:2010:i:6:p:1672-1682. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.