IDEAS home Printed from https://ideas.repec.org/a/spr/qualqt/v51y2017i2d10.1007_s11135-016-0430-2.html
   My bibliography  Save this article

Classification trees for multivariate ordinal response: an application to Student Evaluation Teaching

Author

Listed:
  • Mariangela Sciandra

    (University of Palermo)

  • Antonella Plaia

    (University of Palermo)

  • Vincenza Capursi

    (University of Palermo)

Abstract

Data from multiple items on an ordinal scale are commonly collected when qualitative variables, such as feelings, attitudes and many other behavioral and health-related variables are observed. In this paper we introduce a method to derive a distance-based tree for multivariate ordinal response that allows, when subject-specific characteristics are available, to derive common profiles for respondents giving the same/similar multivariate ratings. Special attention will be paid to the performance comparison in terms of AUC, for three different distances used as splitting criteria. Simulated data an a dataset from a Student Evaluation of Teaching survey will be used as illustrative examples. The latter will be used to show the performance of the procedure in profiling students by identifying which features of their experience are most closely related to their expressed satisfaction.

Suggested Citation

  • Mariangela Sciandra & Antonella Plaia & Vincenza Capursi, 2017. "Classification trees for multivariate ordinal response: an application to Student Evaluation Teaching," Quality & Quantity: International Journal of Methodology, Springer, vol. 51(2), pages 641-655, March.
    • Handle: RePEc:spr:qualqt:v:51:y:2017:i:2:d:10.1007_s11135-016-0430-2
    DOI: 10.1007/s11135-016-0430-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11135-016-0430-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11135-016-0430-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Raffaella Piccarreta, 2008. "Classification trees for ordinal variables," Computational Statistics, Springer, vol. 23(3), pages 407-427, July.
    2. 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.
    3. Shih, Yu-Shan, 2001. "Selecting the best splits for classification trees with categorical variables," Statistics & Probability Letters, Elsevier, vol. 54(4), pages 341-345, October.
    4. Siciliano, Roberta & Mola, Francesco, 2000. "Multivariate data analysis and modeling through classification and regression trees," Computational Statistics & Data Analysis, Elsevier, vol. 32(3-4), pages 285-301, January.
    5. Mariano Ruiz Espejo, 2015. "Statistical Methods for Ranking Data," International Statistical Review, International Statistical Institute, vol. 83(1), pages 172-173, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gerhard Tutz, 2022. "Ordinal Trees and Random Forests: Score-Free Recursive Partitioning and Improved Ensembles," Journal of Classification, Springer;The Classification Society, vol. 39(2), pages 241-263, July.
    2. Antonio D’Ambrosio & Carmela Iorio & Michele Staiano & Roberta Siciliano, 2019. "Median constrained bucket order rank aggregation," Computational Statistics, Springer, vol. 34(2), pages 787-802, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pier Perri & Peter Heijden, 2012. "A Property of the CHAID Partitioning Method for Dichotomous Randomized Response Data and Categorical Predictors," Journal of Classification, Springer;The Classification Society, vol. 29(1), pages 76-90, April.
    2. Claudio M. Rocco & Kash Barker & Jose Moronta, 2022. "Determining the best algorithm to detect community structures in networks: application to power systems," Environment Systems and Decisions, Springer, vol. 42(2), pages 251-264, June.
    3. Zeleke Worku, 2017. "A Bayesian Analysis of Sub-Samples in Survival Analysis," Biostatistics and Biometrics Open Access Journal, Juniper Publishers Inc., vol. 3(2), pages 40-48, October.
    4. Roberta Siciliano & Antonio D’Ambrosio & Massimo Aria & Sonia Amodio, 2017. "Analysis of Web Visit Histories, Part II: Predicting Navigation by Nested STUMP Regression Trees," Journal of Classification, Springer;The Classification Society, vol. 34(3), pages 473-493, October.
    5. Lee, Tzu-Haw & Shih, Yu-Shan, 2006. "Unbiased variable selection for classification trees with multivariate responses," Computational Statistics & Data Analysis, Elsevier, vol. 51(2), pages 659-667, November.
    6. Adolfo Morrone & Alfonso Piscitelli & Antonio D’Ambrosio, 2019. "How Disadvantages Shape Life Satisfaction: An Alternative Methodological Approach," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 141(1), pages 477-502, January.
    7. Mussini Mauro, 2018. "On Measuring Polarization For Ordinal Data: An Approach Based On The Decomposition Of The Leti Index," Statistics in Transition New Series, Polish Statistical Association, vol. 19(2), pages 277-296, June.
    8. Lee, Paul H. & Yu, Philip L.H., 2012. "Mixtures of weighted distance-based models for ranking data with applications in political studies," Computational Statistics & Data Analysis, Elsevier, vol. 56(8), pages 2486-2500.
    9. Antonella Plaia & Mariangela Sciandra, 2019. "Weighted distance-based trees for ranking data," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 13(2), pages 427-444, June.
    10. Claudio Conversano & Francesco Mola & Roberta Siciliano, 2001. "Partitioning Algorithms and Combined Model Integration for Data Mining," Computational Statistics, Springer, vol. 16(3), pages 323-339, September.
    11. Lee, Paul H. & Yu, Philip L.H., 2010. "Distance-based tree models for ranking data," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1672-1682, June.
    12. Antonio D’Ambrosio & Willem J. Heiser, 2016. "A Recursive Partitioning Method for the Prediction of Preference Rankings Based Upon Kemeny Distances," Psychometrika, Springer;The Psychometric Society, vol. 81(3), pages 774-794, September.
    13. Piccarreta, Raffaella, 2010. "Binary trees for dissimilarity data," Computational Statistics & Data Analysis, Elsevier, vol. 54(6), pages 1516-1524, June.
    14. Cappelli, Carmela & Mola, Francesco & Siciliano, Roberta, 2002. "A statistical approach to growing a reliable honest tree," Computational Statistics & Data Analysis, Elsevier, vol. 38(3), pages 285-299, January.
    15. George Petrakos & Claudio Conversano & Gregory Farmakis & Francesco Mola & Roberta Siciliano & Photis Stavropoulos, 2004. "New ways of specifying data edits," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 167(2), pages 249-274, May.
    16. Noh, Hyun Gon & Song, Moon Sup & Park, Sung Hyun, 2004. "An unbiased method for constructing multilabel classification trees," Computational Statistics & Data Analysis, Elsevier, vol. 47(1), pages 149-164, August.
    17. Dine, Abdessamad & Larocque, Denis & Bellavance, François, 2009. "Multivariate trees for mixed outcomes," Computational Statistics & Data Analysis, Elsevier, vol. 53(11), pages 3795-3804, September.
    18. Wolf, Bethany J. & Slate, Elizabeth H. & Hill, Elizabeth G., 2015. "Ordinal Logic Regression: A classifier for discovering combinations of binary markers for ordinal outcomes," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 152-163.
    19. Etumnu, Chinonso & Gray, Allan W., 2020. "A Clustering Approach to Understanding Farmers’ Success Strategies," Journal of Agricultural and Applied Economics, Cambridge University Press, vol. 52(3), pages 335-351, August.
    20. Lechner, Michael & Okasa, Gabriel, 2019. "Random Forest Estimation of the Ordered Choice Model," Economics Working Paper Series 1908, University of St. Gallen, School of Economics and Political Science.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:qualqt:v:51:y:2017:i:2:d:10.1007_s11135-016-0430-2. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.