{"title":"Matrix Normal Cluster-Weighted Models","authors":"S. Tomarchio, P. McNicholas, A. Punzo","doi":"10.1007/s00357-021-09389-2","DOIUrl":"https://doi.org/10.1007/s00357-021-09389-2","url":null,"abstract":"","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"38 1","pages":"556 - 575"},"PeriodicalIF":2.0,"publicationDate":"2021-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00357-021-09389-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47742217","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alexandra de Raadt, M. Warrens, R. Bosker, H. Kiers
{"title":"A Comparison of Reliability Coefficients for Ordinal Rating Scales","authors":"Alexandra de Raadt, M. Warrens, R. Bosker, H. Kiers","doi":"10.1007/s00357-021-09386-5","DOIUrl":"https://doi.org/10.1007/s00357-021-09386-5","url":null,"abstract":"","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"38 1","pages":"519 - 543"},"PeriodicalIF":2.0,"publicationDate":"2021-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00357-021-09386-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44229599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Unified Theory of the Completeness of Q-Matrices for the DINA Model","authors":"Hans-Friedrich Köhn, Chia-Yi Chiu","doi":"10.1007/s00357-021-09384-7","DOIUrl":"https://doi.org/10.1007/s00357-021-09384-7","url":null,"abstract":"","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"38 1","pages":"500 - 518"},"PeriodicalIF":2.0,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00357-021-09384-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48956298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Ordinal Trees and Random Forests: Score-Free Recursive Partitioning and Improved Ensembles","authors":"G. Tutz","doi":"10.1007/s00357-021-09406-4","DOIUrl":"https://doi.org/10.1007/s00357-021-09406-4","url":null,"abstract":"","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"39 1","pages":"241 - 263"},"PeriodicalIF":2.0,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44515903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Editorial: Journal of Classification Vol. 38-3.","authors":"Paul D McNicholas","doi":"10.1007/s00357-021-09404-6","DOIUrl":"https://doi.org/10.1007/s00357-021-09404-6","url":null,"abstract":"","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"38 3","pages":"423-424"},"PeriodicalIF":2.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8665698/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39738206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Explicit Agreement Extremes for a 2 × 2 Table with Given Marginals","authors":"José Enrique Chacón Durán","doi":"10.1007/s00357-020-09375-0","DOIUrl":"https://doi.org/10.1007/s00357-020-09375-0","url":null,"abstract":"","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"38 1","pages":"257-263"},"PeriodicalIF":2.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00357-020-09375-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51951301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alessandro Casa, Charles Bouveyron, Elena Erosheva, Giovanna Menardi
{"title":"Co-clustering of Time-Dependent Data via the Shape Invariant Model.","authors":"Alessandro Casa, Charles Bouveyron, Elena Erosheva, Giovanna Menardi","doi":"10.1007/s00357-021-09402-8","DOIUrl":"https://doi.org/10.1007/s00357-021-09402-8","url":null,"abstract":"<p><p>Multivariate time-dependent data, where multiple features are observed over time for a set of individuals, are increasingly widespread in many application domains. To model these data, we need to account for relations among both time instants and variables and, at the same time, for subject heterogeneity. We propose a new co-clustering methodology for grouping individuals and variables simultaneously, designed to handle both functional and longitudinal data. Our approach borrows some concepts from the <i>curve registration</i> framework by embedding the <i>shape invariant model</i> in the <i>latent block model</i>, estimated via a suitable modification of the SEM-Gibbs algorithm. The resulting procedure allows for several user-defined specifications of the notion of cluster that can be chosen on substantive grounds and provides parsimonious summaries of complex time-dependent data by partitioning data matrices into homogeneous blocks. Along with the explicit modelling of time evolution, these aspects allow for an easy interpretation of the clusters, from which also low-dimensional settings may benefit.</p>","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"38 3","pages":"626-649"},"PeriodicalIF":2.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8494170/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39514866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Gibbs Sampling Algorithm with Monotonicity Constraints for Diagnostic Classification Models","authors":"K. Yamaguchi, J. Templin","doi":"10.31234/osf.io/undcv","DOIUrl":"https://doi.org/10.31234/osf.io/undcv","url":null,"abstract":"Diagnostic classification models (DCMs) are restricted latent class models with a set of cross-class equality constraints and additional monotonicity constraints on their item parameters, both of which are needed to ensure the meaning of classes and model parameters. In this paper, we develop an efficient, Gibbs sampling-based Bayesian Markov chain Monte Carlo estimation method for general DCMs with monotonicity constraints. A simulation study was conducted to evaluate parameter recovery of the algorithm which showed accurate estimation of model parameters. Moreover, the proposed algorithm was compared to a previously developed Gibbs sampling algorithm which imposed constraints on only the main effect item parameters of the log-linear cognitive diagnosis model. The newly proposed algorithm showed less bias and faster convergence. An analysis of the 2000 Programme for International Student Assessment reading assessment data using this algorithm was also conducted.","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"39 1","pages":"24-54"},"PeriodicalIF":2.0,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41895649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ROC and AUC with a Binary Predictor: a Potentially Misleading Metric.","authors":"John Muschelli","doi":"10.1007/s00357-019-09345-1","DOIUrl":"https://doi.org/10.1007/s00357-019-09345-1","url":null,"abstract":"<p><p>In analysis of binary outcomes, the receiver operator characteristic (ROC) curve is heavily used to show the performance of a model or algorithm. The ROC curve is informative about the performance over a series of thresholds and can be summarized by the area under the curve (AUC), a single number. When a <b>predictor</b> is categorical, the ROC curve has one less than number of categories as potential thresholds; when the predictor is binary there is only one threshold. As the AUC may be used in decision-making processes on determining the best model, it important to discuss how it agrees with the intuition from the ROC curve. We discuss how the interpolation of the curve between thresholds with binary predictors can largely change the AUC. Overall, we show using a linear interpolation from the ROC curve with binary predictors corresponds to the estimated AUC, which is most commonly done in software, which we believe can lead to misleading results. We compare R, Python, Stata, and SAS software implementations. We recommend using reporting the interpolation used and discuss the merit of using the step function interpolator, also referred to as the \"pessimistic\" approach by Fawcett (2006).</p>","PeriodicalId":50241,"journal":{"name":"Journal of Classification","volume":"37 3","pages":"696-708"},"PeriodicalIF":2.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00357-019-09345-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"38651248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}