CATLVM User Guide for Latent Class-Profile Analysis

Size: px
Start display at page:

Download "CATLVM User Guide for Latent Class-Profile Analysis"

Transcription

1 CATLVM User Guide for Latent Class-Profile Analysis Dimension Term Type Definition nkase Integer scalar Number of subject nstr Integer scalar Number of subgroups nc Integer scalar Number of static latent subgroups ns Integer scalar Number of dynamic latent statuses npf Integer scalar Number of latent status-profiles nt Integer scalar Number of time points nsi Integer scalar Number of manifest items nrs Integer vector of length nsi Number of categories for each item ncov$gam.pf Integer scalar Number of covariates for GAM.PF ncov$eta Integer scalar Number of covariates for ETA Parameters for an LCPA Parameter Array dimension Definition param$lcpa$big.rho nsi max(nrs) ns nt nc nstr Item response probabilities within a latent status at time t for each latent class and subgroup param$lcpa$gam.pf npf nc nstr Status-profile prevalence for each latent class and subgroup Param$lcpa$eta ns nt npf nc nstr Conditional probability of status membership at time t given a latent status profile param$lcpa$beta$gam.pf ncov$gam.pf npf nc nstr Logistic regression coefficients to predict status-profile membership param$lcpa$beta$eta ncov$eta ns nt npf nc nstr Logistic regression coefficients to predict the conditional probability of latent status at time t given a profile 1

2 1. Loading the data Data should be loaded in a list. Data-list consists of following: data$is.grp (logical) True if analysis will use group variable. data$group (optional) An integer vector of group variable with length of nkase. Integer values should start from 1. If data$is.grp = TRUE, then data$group should be provided. data$lcpa$si Observed manifest items to measure latent statuses. It should be an array size of nkase nsi nt. The values must be integer starting from 1. Missing values should be coded as NA. data$lcpa$cov$gam.pf (optional) Observed covariates to predict latent status-profile membership. It should be a matrix size of nkase ncov$gam.pf. data$lcpa$cov$eta (optional) Observed covariates to predict the conditional probability of status membership at time t given a status-profile. It should be an array size of nkase ncov$eta nt. 2. Model configuration Model configuration should be saved in a list. Model-list consists of following: model$lca$is.lca (logical, optional) True if you want to fit a latent class analysis (see User s manual for latent class analysis). The latent class will be used as a latent group variable. If model$lca$nc (optional) Number of static latent classes. model$lcpa$is.lcpa (logical) True if you want to fit a latent transition analysis. model$lcpa$ns Number of dynamic latent statuses. model$lcpa$npf 2

3 Number of latent status profiles. model$lcpa$nt Number of time points. model$lcpa$nrs Integer vector. Number of response categories for each item. The length of vector should be equal to the number of items (i.e., nsi). 3. Parameter constraints (optional) Parameter constraints should be saved in a list. Constraint-list consists of following: constraint$lcpa$equal$big.rho$group (logical) True if param$lcpa$big.rho are constrained to be equal across group variable. Default value = FALSE. constraint$lcpa$equal$big.rho$time (logical) True if param$lcpa$big.rho are constrained to be equal across time points. Default value = FALSE. constraint$lcpa$equal$big.rho$class (logical) True if param$lcpa$big.rho are constrained to be equal across latent classes (latent group variable). It will be used only when model$lca$is.lca = TRUE. Default value = FALSE. constraint$lcpa$big.rho Integer array of 1 or 0. The elements of constraint$lcpa$big.rho with one represent that the corresponding param$lcpa$big.rho will be freely estimated. The elements of constraint$lcpa$big.rho with 0 means that the corresponding param$lcpa$big.rho will be fixed as zero. Dimension of constraint$lcpa$big.rho is equal to param$lcpa$big.rho. Default setting is to freely estimate. constraint$lcpa$gam.pf Integer array of 1 or 0. The array displays the constraint of param$lcpa$gam.pf. The elements of constraint$lcpa$gam.pf with 1 represents that the corresponding param$lcpa$gam.pf will be freely estimated. The elements of 3

4 constraint$lcpa$gam.pf with 0 means that the corresponding param$lcpa$gam.pf will be fixed as zero. Dimension of constraint$lcpa$gam.pf is npf nc nstr. Default setting is to freely estimate. constraint$lcpa$eta Integer array of 1 or 0. The elements of constraint$lcpa$etaa with 1 represents that the corresponding param$lcpa$eta will be freely estimated. The elements of constraint$lcpa$eta with 0 means that the corresponding param$lcpa$eta will be fixed as zero. Dimension of constraint$lcpa$eta is equal to param$lcpa$eta. Default setting is to freely estimate. 4. Starting values (optional) Starting-value configuration should be saved in a list. Starval-list consists of following: starval$is.random (logical, optional) True if you want to generate random starting values. Default value = TRUE. starval$param$lcpa (optional) Starting values provided by users. If starval$is.random = FALSE, then users should provide starting values for LCPA parameters. The dimension starval$param$lcpa is equal to param$lcpa. starval$ntry (optional) Number of sets of different starting values that the program will try. This is to assure global maximum at the final solution. Default value = 10. starval$try.maxits (optional) Maximum number of iterations for each set of starting values. Program will pick the set starting values which leads to the largest likelihood after this trial iteration. Default value = Iteration (optional) Iteration configuration should be saved in a list. Iteration-list consists of following: iteration$maxits (optional) Maximum number of iterations. Default value =

5 iteration$eps (optional) Convergence criteria. Default value = 1e-6. 5

6 An example of latent class-profile analysis using CATLVM This is a three-class LCPA with logistic regression. Three latent classes are measured by six binary items from two subgroups. nkase = 500 nstr = 1 nc = 1 nt = 4 ns = 3 npf = 4 nsi = 4 nrc = c(2, 2, 2, 2) In R Console ## Items of first three subjects LCPA.sItem[1:3,,],, 1 [,3] [,4] [1,] [2,] [3,] ,, 2 [,3] [,4] [1,] [2,] 1 1 NA 1 [3,] ,, 3 [,3] [,4] [1,] [2,]

7 [3,] NA,, 4 [,3] [,4] [1,] [2,] [3,] 2 NA 2 2 ## GAM.PF cvariate of first three subjects LCPA.covariate$gam.pf[1:3,] [1] ## ETA cvariate of first three subjects LCPA.covariate$eta[1:3,,] [,3] [,4] [1,] [2,] [3,] ############### ## LOAD DATA ## ############### data <- list() data$lcpa$si <- LCPA.sItem ########################## ## SPECIFY AN LCPA MODEL ## ########################## model <- list() model$lcpa$is.lcpa <- TRUE model$lcpa$ns <- 3 model$lcpa$npf <- 4 model$lcpa$nrs <- c(2, 2, 2, 2) ############################# 7

8 ## RESTRICT RHO PARAMETERS ## ############################# constraint <- list() constraint$lcpa$equal$big.rho$time <- TRUE ########################## ## STARTING VALUE SETUP ## ########################## starval <- list() starval$is.random <- TRUE ##################### ## RUNNING PROGRAM ## ##################### LCPA.1 <- cat.lvm(data=data, model=model, starval=starval, + constraint=constraint) e e e e-07 OK, converged at 671 summary(lcpa.1) Length Class Mode model 3 -none- list iteration 6 -none- list param 1 -none- list constraint 1 -none- list prior 0 -none- list ######################### ## ESTIMATED PRAMETERS ## ######################### LCPA.1$param $lcpa $lcpa$big.rho,, Stage.1, Time.1,, 8

9 sitem sitem sitem sitem ,, Stage.2, Time.1,, sitem sitem sitem sitem ,, Stage.3, Time.1,, sitem sitem sitem sitem ,, Stage.1, Time.2,, sitem sitem sitem sitem ,, Stage.2, Time.2,, sitem sitem sitem sitem

10 ,, Stage.3, Time.2,, sitem sitem sitem sitem ,, Stage.1, Time.3,, sitem sitem sitem sitem ,, Stage.2, Time.3,, sitem sitem sitem sitem ,, Stage.3, Time.3,, sitem sitem sitem sitem ,, Stage.1, Time.4,, sitem sitem

11 sitem sitem ,, Stage.2, Time.4,, sitem sitem sitem sitem ,, Stage.3, Time.4,, sitem sitem sitem sitem $lcpa$gam.pf,, Profile Profile Profile Profile $lcpa$eta,, Profile.1,, Time.1 Time.2 Time.3 Time.4 Stage e Stage e Stage e

12 ,, Profile.2,, Time.1 Time.2 Time.3 Time.4 Stage e e Stage e e Stage e e ,, Profile.3,, Time.1 Time.2 Time.3 Time.4 Stage e Stage e Stage e ,, Profile.4,, Time.1 Time.2 Time.3 Time.4 Stage e Stage e Stage e ############################## ## INFO ABOUT EM ITERATIONS ## ############################## LCPA.1$iteration $maxits [1] 2500 $eps [1] 1e-06 $niter [1] 671 $maxdiff 12

13 [1] e-07 $converged [1] TRUE $llvec [1] ################################# ## INFO ABOUT FITTED LCPA MODEL ## ################################# LCPA.1$model $lcpa $lcpa$is.lcpa [1] TRUE $lcpa$npf [1] 4 $lcpa$ns [1] 3 $lcpa$nrs [1] $lcpa$nkase [1] 500 $lcpa$nstr [1] 1 $lcpa$nsi [1] 4 $lcpa$nt [1] 4 13

14 $lcpa$nc [1] 1 $lcpa$ncov $lcpa$ncov$gam.pf [1] 0 $lcpa$ncov$eta [1] 0 $lca $lca$is.lca [1] FALSE $lca$nc [1] 1 $lta $lta$is.lta [1] FALSE ###################################### ## INFO ABOUT PARAMETER CONSTRAINTS ## ###################################### LCPA.1$constraint $lcpa $lcpa$equal $lcpa$equal$big.rho $lcpa$equal$big.rho$group [1] FALSE $lcpa$equal$big.rho$time [1] TRUE 14

15 $lcpa$equal$big.rho$class [1] FALSE $lcpa$big.rho,, Stage.1, Time.1,, sitem sitem sitem sitem.4 1 1,, Stage.2, Time.1,, sitem sitem sitem sitem.4 1 1,, Stage.3, Time.1,, sitem sitem sitem sitem.4 1 1,, Stage.1, Time.2,, sitem sitem sitem sitem

16 ,, Stage.2, Time.2,, sitem sitem sitem sitem.4 1 1,, Stage.3, Time.2,, sitem sitem sitem sitem.4 1 1,, Stage.1, Time.3,, sitem sitem sitem sitem.4 1 1,, Stage.2, Time.3,, sitem sitem sitem sitem.4 1 1,, Stage.3, Time.3,, sitem sitem

17 sitem sitem.4 1 1,, Stage.1, Time.4,, sitem sitem sitem sitem.4 1 1,, Stage.2, Time.4,, sitem sitem sitem sitem.4 1 1,, Stage.3, Time.4,, sitem sitem sitem sitem $lcpa$gam.pf,, Profile.1 1 Profile.2 1 Profile.3 1 Profile

18 $lcpa$eta,, Profile.1,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage ,, Profile.2,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage ,, Profile.3,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage ,, Profile.4,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage ####################################### ## ADD GAM.PF COVARIATES TO THE LCPA ## ####################################### data$lcpa$cov$gam.pf <- LCPA.covariate$gam.pf ##################### ## RUNNING PROGRAM ## 18

19 ##################### LCPA.REG.1.ML <- cat.lvm(data=data, model=model, starval=starval, + constraint=constraint) Trying to find the best set of starting values... SET: SET: SET: SET: SET: SET: SET: SET: SET: SET: Done. SET 10 selected. Starting main iteration e e e e-07 OK, converged at 184 #################################### ## ADD ETA COVARIATES TO THE LCPA ## #################################### data$lcpa$cov$eta <- LCPA.covariate$eta ###################################################### ## FIX SOME ETAs AS ZERO TO AVOID BOUNDARY SOLUTION ## ###################################################### constraint$lcpa$eta <- LCPA.REG.1.ML$constraint$lcpa$ETA w <- LCPA.REG.1.ML$param$lcpa$eta <

20 constraint$lcpa$eta[w] <- 0 ########################## ## STARTING VALUE SETUP ## ########################## starval <- list() starval$is.random <- FALSE starval$param <- LCPA.REG.1.ML$param starval$param$lcpa$beta$eta <- + array(0, c(2, LCPA.1$model$lcpa$ns, LCPA.1$model$lcpa$nt, + LCPA.1$model$lcpa$npf, LCPA.1$model$lcpa$nc, + LCPA.1$model$lcpa$nstr)) ##################### ## RUNNING PROGRAM ## ##################### LCPA.REG.2.ML <- cat.lvm(data=data, model=model, starval=starval, + constraint=constraint) Starting main iteration e e e e-07 OK, converged at 620 ######################### ## ESTIMATED PRAMETERS ## ######################### LCPA.REG.2.ML$param $lcpa $lcpa$big.rho,, Stage.1, Time.1,, 20

21 sitem sitem sitem sitem ,, Stage.2, Time.1,, sitem sitem sitem sitem ,, Stage.3, Time.1,, sitem sitem sitem sitem ,, Stage.1, Time.2,, sitem sitem sitem sitem ,, Stage.2, Time.2,, sitem sitem sitem sitem

22 ,, Stage.3, Time.2,, sitem sitem sitem sitem ,, Stage.1, Time.3,, sitem sitem sitem sitem ,, Stage.2, Time.3,, sitem sitem sitem sitem ,, Stage.3, Time.3,, sitem sitem sitem sitem ,, Stage.1, Time.4,, sitem sitem

23 sitem sitem ,, Stage.2, Time.4,, sitem sitem sitem sitem ,, Stage.3, Time.4,, sitem sitem sitem sitem $lcpa$gam.pf,, Profile Profile Profile Profile $lcpa$eta,, Profile.1,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage

24 ,, Profile.2,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage ,, Profile.3,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage ,, Profile.4,, Time.1 Time.2 Time.3 Time.4 Stage Stage Stage $lcpa$beta $lcpa$beta$gam.pf,,, Profile.1 Profile.2 Profile.3 Profile.4 Int cov.gam.pf $lcpa$beta$eta,, Time.1, Profile.1,, Int NA cov.eta NA 24

25 ,, Time.2, Profile.1,, Int NA cov.eta NA,, Time.3, Profile.1,, Int cov.eta ,, Time.4, Profile.1,, Int NA cov.eta NA,, Time.1, Profile.2,, Int NA cov.eta NA,, Time.2, Profile.2,, Int cov.eta ,, Time.3, Profile.2,, Int. NA 0 NA cov.eta.1 NA 0 NA,, Time.4, Profile.2,, 25

26 Int NA cov.eta NA,, Time.1, Profile.3,, Int. 0 NA cov.eta.1 0 NA ,, Time.2, Profile.3,, Int. 0 NA cov.eta.1 0 NA ,, Time.3, Profile.3,, Int. 0 NA cov.eta.1 0 NA ,, Time.4, Profile.3,, Int. 0 NA cov.eta.1 0 NA ,, Time.1, Profile.4,, Int NA cov.eta NA,, Time.2, Profile.4,, Stage.1 Stage.2 Stage.3 Int NA 26

27 cov.eta NA,, Time.3, Profile.4,, Int. NA NA 0 cov.eta.1 NA NA 0,, Time.4, Profile.4,, Int. NA NA 0 cov.eta.1 NA NA 0 27

CATLVM User Guide for Latent Transition Analysis

CATLVM User Guide for Latent Transition Analysis CATLVM User Guide for Latent Transition Analysis Dimension Term Type Definition nkase Integer scalar Number of subject nstr Integer scalar Number of subgroups nc Integer scalar Number of latent subgroups

More information

SAS Graphics Macros for Latent Class Analysis Users Guide

SAS Graphics Macros for Latent Class Analysis Users Guide SAS Graphics Macros for Latent Class Analysis Users Guide Version 2.0.1 John Dziak The Methodology Center Stephanie Lanza The Methodology Center Copyright 2015, Penn State. All rights reserved. Please

More information

Expectation Maximization (EM) and Gaussian Mixture Models

Expectation Maximization (EM) and Gaussian Mixture Models Expectation Maximization (EM) and Gaussian Mixture Models Reference: The Elements of Statistical Learning, by T. Hastie, R. Tibshirani, J. Friedman, Springer 1 2 3 4 5 6 7 8 Unsupervised Learning Motivation

More information

Package hiernet. March 18, 2018

Package hiernet. March 18, 2018 Title A Lasso for Hierarchical Interactions Version 1.7 Author Jacob Bien and Rob Tibshirani Package hiernet March 18, 2018 Fits sparse interaction models for continuous and binary responses subject to

More information

Package StagedChoiceSplineMix

Package StagedChoiceSplineMix Type Package Package StagedChoiceSplineMix August 11, 2016 Title Mixture of Two-Stage Logistic Regressions with Fixed Candidate Knots Version 1.0.0 Date 2016-08-10 Author Elizabeth Bruch ,

More information

Function Algorithms: Linear Regression, Logistic Regression

Function Algorithms: Linear Regression, Logistic Regression CS 4510/9010: Applied Machine Learning 1 Function Algorithms: Linear Regression, Logistic Regression Paula Matuszek Fall, 2016 Some of these slides originated from Andrew Moore Tutorials, at http://www.cs.cmu.edu/~awm/tutorials.html

More information

Package SMAT. January 29, 2013

Package SMAT. January 29, 2013 Package SMAT January 29, 2013 Type Package Title Scaled Multiple-phenotype Association Test Version 0.98 Date 2013-01-26 Author Lin Li, Ph.D.; Elizabeth D. Schifano, Ph.D. Maintainer Lin Li ;

More information

Package SmoothHazard

Package SmoothHazard Package SmoothHazard September 19, 2014 Title Fitting illness-death model for interval-censored data Version 1.2.3 Author Celia Touraine, Pierre Joly, Thomas A. Gerds SmoothHazard is a package for fitting

More information

Package cwm. R topics documented: February 19, 2015

Package cwm. R topics documented: February 19, 2015 Package cwm February 19, 2015 Type Package Title Cluster Weighted Models by EM algorithm Version 0.0.3 Date 2013-03-26 Author Giorgio Spedicato, Simona C. Minotti Depends R (>= 2.14), MASS Imports methods,

More information

Package StVAR. February 11, 2017

Package StVAR. February 11, 2017 Type Package Title Student's t Vector Autoregression (StVAR) Version 1.1 Date 2017-02-10 Author Niraj Poudyal Maintainer Niraj Poudyal Package StVAR February 11, 2017 Description Estimation

More information

John J. Dziak, Stephanie M. Lanza, and Xianming Tan

John J. Dziak, Stephanie M. Lanza, and Xianming Tan Appendix 2: Technical Appendix for Effect Size, Statistical Power and Sample Size Requirements for the Bootstrap Likelihood Ratio Test in Latent Class Analysis John J. Dziak, Stephanie M. Lanza, and Xianming

More information

Clustering Lecture 5: Mixture Model

Clustering Lecture 5: Mixture Model Clustering Lecture 5: Mixture Model Jing Gao SUNY Buffalo 1 Outline Basics Motivation, definition, evaluation Methods Partitional Hierarchical Density-based Mixture model Spectral methods Advanced topics

More information

Package RAMP. May 25, 2017

Package RAMP. May 25, 2017 Type Package Package RAMP May 25, 2017 Title Regularized Generalized Linear Models with Interaction Effects Version 2.0.1 Date 2017-05-24 Author Yang Feng, Ning Hao and Hao Helen Zhang Maintainer Yang

More information

Introduction to Machine Learning CMU-10701

Introduction to Machine Learning CMU-10701 Introduction to Machine Learning CMU-10701 Clustering and EM Barnabás Póczos & Aarti Singh Contents Clustering K-means Mixture of Gaussians Expectation Maximization Variational Methods 2 Clustering 3 K-

More information

Also, for all analyses, two other files are produced upon program completion.

Also, for all analyses, two other files are produced upon program completion. MIXOR for Windows Overview MIXOR is a program that provides estimates for mixed-effects ordinal (and binary) regression models. This model can be used for analysis of clustered or longitudinal (i.e., 2-level)

More information

CS 229 Midterm Review

CS 229 Midterm Review CS 229 Midterm Review Course Staff Fall 2018 11/2/2018 Outline Today: SVMs Kernels Tree Ensembles EM Algorithm / Mixture Models [ Focus on building intuition, less so on solving specific problems. Ask

More information

The glmmml Package. August 20, 2006

The glmmml Package. August 20, 2006 The glmmml Package August 20, 2006 Version 0.65-1 Date 2006/08/20 Title Generalized linear models with clustering A Maximum Likelihood and bootstrap approach to mixed models. License GPL version 2 or newer.

More information

Package PrivateLR. March 20, 2018

Package PrivateLR. March 20, 2018 Type Package Package PrivateLR March 20, 2018 Title Differentially Private Regularized Logistic Regression Version 1.2-22 Date 2018-03-19 Author Staal A. Vinterbo Maintainer Staal

More information

7 Control Structures, Logical Statements

7 Control Structures, Logical Statements 7 Control Structures, Logical Statements 7.1 Logical Statements 1. Logical (true or false) statements comparing scalars or matrices can be evaluated in MATLAB. Two matrices of the same size may be compared,

More information

Package gpr. February 20, 2015

Package gpr. February 20, 2015 Package gpr February 20, 2015 Version 1.1 Date 2013-08-27 Title A Minimalistic package to apply Gaussian Process in R License GPL-3 Author Maintainer ORPHANED Depends R (>= 2.13) This package provides

More information

CHAPTER 7 EXAMPLES: MIXTURE MODELING WITH CROSS- SECTIONAL DATA

CHAPTER 7 EXAMPLES: MIXTURE MODELING WITH CROSS- SECTIONAL DATA Examples: Mixture Modeling With Cross-Sectional Data CHAPTER 7 EXAMPLES: MIXTURE MODELING WITH CROSS- SECTIONAL DATA Mixture modeling refers to modeling with categorical latent variables that represent

More information

Package HMMASE. February 4, HMMASE R package

Package HMMASE. February 4, HMMASE R package Package HMMASE February 4, 2014 Type Package Title HMMASE R package Version 1.0 Date 2014-02-04 Author Juan R. Steibel, Heng Wang, Ping-Shou Zhong Maintainer Heng Wang An R package that

More information

ECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov

ECE521: Week 11, Lecture March 2017: HMM learning/inference. With thanks to Russ Salakhutdinov ECE521: Week 11, Lecture 20 27 March 2017: HMM learning/inference With thanks to Russ Salakhutdinov Examples of other perspectives Murphy 17.4 End of Russell & Norvig 15.2 (Artificial Intelligence: A Modern

More information

CSE 158. Web Mining and Recommender Systems. Midterm recap

CSE 158. Web Mining and Recommender Systems. Midterm recap CSE 158 Web Mining and Recommender Systems Midterm recap Midterm on Wednesday! 5:10 pm 6:10 pm Closed book but I ll provide a similar level of basic info as in the last page of previous midterms CSE 158

More information

Clustering & Dimensionality Reduction. 273A Intro Machine Learning

Clustering & Dimensionality Reduction. 273A Intro Machine Learning Clustering & Dimensionality Reduction 273A Intro Machine Learning What is Unsupervised Learning? In supervised learning we were given attributes & targets (e.g. class labels). In unsupervised learning

More information

CHAPTER 1 INTRODUCTION

CHAPTER 1 INTRODUCTION Introduction CHAPTER 1 INTRODUCTION Mplus is a statistical modeling program that provides researchers with a flexible tool to analyze their data. Mplus offers researchers a wide choice of models, estimators,

More information

Package glmmml. R topics documented: March 25, Encoding UTF-8 Version Date Title Generalized Linear Models with Clustering

Package glmmml. R topics documented: March 25, Encoding UTF-8 Version Date Title Generalized Linear Models with Clustering Encoding UTF-8 Version 1.0.3 Date 2018-03-25 Title Generalized Linear Models with Clustering Package glmmml March 25, 2018 Binomial and Poisson regression for clustered data, fixed and random effects with

More information

Practice Questions for Midterm

Practice Questions for Midterm Practice Questions for Midterm - 10-605 Oct 14, 2015 (version 1) 10-605 Name: Fall 2015 Sample Questions Andrew ID: Time Limit: n/a Grade Table (for teacher use only) Question Points Score 1 6 2 6 3 15

More information

SAS Structural Equation Modeling 1.3 for JMP

SAS Structural Equation Modeling 1.3 for JMP SAS Structural Equation Modeling 1.3 for JMP SAS Documentation The correct bibliographic citation for this manual is as follows: SAS Institute Inc. 2012. SAS Structural Equation Modeling 1.3 for JMP. Cary,

More information

Package pnmtrem. February 20, Index 9

Package pnmtrem. February 20, Index 9 Type Package Package pnmtrem February 20, 2015 Title Probit-Normal Marginalized Transition Random Effects Models Version 1.3 Date 2013-05-19 Author Ozgur Asar, Ozlem Ilk Depends MASS Maintainer Ozgur Asar

More information

Example Using Missing Data 1

Example Using Missing Data 1 Ronald H. Heck and Lynn N. Tabata 1 Example Using Missing Data 1 Creating the Missing Data Variable (Miss) Here is a data set (achieve subset MANOVAmiss.sav) with the actual missing data on the outcomes.

More information

Package PUlasso. April 7, 2018

Package PUlasso. April 7, 2018 Type Package Package PUlasso April 7, 2018 Title High-Dimensional Variable Selection with Presence-Only Data Version 3.1 Date 2018-4-4 Efficient algorithm for solving PU (Positive and Unlabelled) problem

More information

Package mixsqp. November 14, 2018

Package mixsqp. November 14, 2018 Encoding UTF-8 Type Package Version 0.1-79 Date 2018-11-05 Package mixsqp November 14, 2018 Title Sequential Quadratic Programming for Fast Maximum-Likelihood Estimation of Mixture Proportions URL https://github.com/stephenslab/mixsqp

More information

Package SAENET. June 4, 2015

Package SAENET. June 4, 2015 Type Package Package SAENET June 4, 2015 Title A Stacked Autoencoder Implementation with Interface to 'neuralnet' Version 1.1 Date 2015-06-04 An implementation of a stacked sparse autoencoder for dimension

More information

A New Method of Using Polytomous Independent Variables with Many Levels for the Binary Outcome of Big Data Analysis

A New Method of Using Polytomous Independent Variables with Many Levels for the Binary Outcome of Big Data Analysis Paper 2641-2015 A New Method of Using Polytomous Independent Variables with Many Levels for the Binary Outcome of Big Data Analysis ABSTRACT John Gao, ConstantContact; Jesse Harriott, ConstantContact;

More information

S2 Text. Instructions to replicate classification results.

S2 Text. Instructions to replicate classification results. S2 Text. Instructions to replicate classification results. Machine Learning (ML) Models were implemented using WEKA software Version 3.8. The software can be free downloaded at this link: http://www.cs.waikato.ac.nz/ml/weka/downloading.html.

More information

Package SeleMix. R topics documented: November 22, 2016

Package SeleMix. R topics documented: November 22, 2016 Package SeleMix November 22, 2016 Type Package Title Selective Editing via Mixture Models Version 1.0.1 Date 2016-11-22 Author Ugo Guarnera, Teresa Buglielli Maintainer Teresa Buglielli

More information

Clustering and The Expectation-Maximization Algorithm

Clustering and The Expectation-Maximization Algorithm Clustering and The Expectation-Maximization Algorithm Unsupervised Learning Marek Petrik 3/7 Some of the figures in this presentation are taken from An Introduction to Statistical Learning, with applications

More information

The brlr Package. March 22, brlr... 1 lizards Index 5. Bias-reduced Logistic Regression

The brlr Package. March 22, brlr... 1 lizards Index 5. Bias-reduced Logistic Regression The brlr Package March 22, 2006 Version 0.8-8 Date 2006-03-22 Title Bias-reduced logistic regression Author David Firth URL http://www.warwick.ac.uk/go/dfirth Maintainer David Firth

More information

Package sensory. R topics documented: February 23, Type Package

Package sensory. R topics documented: February 23, Type Package Package sensory February 23, 2016 Type Package Title Simultaneous Model-Based Clustering and Imputation via a Progressive Expectation-Maximization Algorithm Version 1.1 Date 2016-02-23 Author Brian C.

More information

Using Machine Learning to Optimize Storage Systems

Using Machine Learning to Optimize Storage Systems Using Machine Learning to Optimize Storage Systems Dr. Kiran Gunnam 1 Outline 1. Overview 2. Building Flash Models using Logistic Regression. 3. Storage Object classification 4. Storage Allocation recommendation

More information

Package actyr. August 5, 2015

Package actyr. August 5, 2015 Type Package Package actyr August 5, 2015 Title Replication Package for Abbring, Campbell, Tilly, Yang (2014): Very Simple Markov Perfect Industry Dynamics Version 1.0 Date 2015-08-01 Author Jan Tilly

More information

Last updated January 4, 2012

Last updated January 4, 2012 Last updated January 4, 2012 This document provides a description of Mplus code for implementing mixture factor analysis with four latent class components with and without covariates described in the following

More information

The grplasso Package

The grplasso Package The grplasso Package June 27, 2007 Type Package Title Fitting user specified models with Group Lasso penalty Version 0.2-1 Date 2007-06-27 Author Lukas Meier Maintainer Lukas Meier

More information

CS395T paper review. Indoor Segmentation and Support Inference from RGBD Images. Chao Jia Sep

CS395T paper review. Indoor Segmentation and Support Inference from RGBD Images. Chao Jia Sep CS395T paper review Indoor Segmentation and Support Inference from RGBD Images Chao Jia Sep 28 2012 Introduction What do we want -- Indoor scene parsing Segmentation and labeling Support relationships

More information

Generalized least squares (GLS) estimates of the level-2 coefficients,

Generalized least squares (GLS) estimates of the level-2 coefficients, Contents 1 Conceptual and Statistical Background for Two-Level Models...7 1.1 The general two-level model... 7 1.1.1 Level-1 model... 8 1.1.2 Level-2 model... 8 1.2 Parameter estimation... 9 1.3 Empirical

More information

Package FisherEM. February 19, 2015

Package FisherEM. February 19, 2015 Type Package Title The Fisher-EM algorithm Version 1.4 Date 2013-06-21 Author Charles Bouveyron and Camille Brunet Package FisherEM February 19, 2015 Maintainer Camille Brunet

More information

Package mrm. December 27, 2016

Package mrm. December 27, 2016 Type Package Package mrm December 27, 2016 Title An R Package for Conditional Maximum Likelihood Estimation in Mixed Rasch Models Version 1.1.6 Date 2016-12-23 Author David Preinerstorfer Maintainer David

More information

Package VarReg. April 24, 2018

Package VarReg. April 24, 2018 Type Package Title Semi-Parametric Variance Regression Version 1.0.2 Package VarReg April 24, 2018 Maintainer Kristy Robledo Methods for fitting semi-parametric mean and variance

More information

Introduction to the R Statistical Computing Environment R Programming: Exercises

Introduction to the R Statistical Computing Environment R Programming: Exercises Introduction to the R Statistical Computing Environment R Programming: Exercises John Fox (McMaster University) ICPSR 2014 1. A straightforward problem: Write an R function for linear least-squares regression.

More information

3 Types of Gradient Descent Algorithms for Small & Large Data Sets

3 Types of Gradient Descent Algorithms for Small & Large Data Sets 3 Types of Gradient Descent Algorithms for Small & Large Data Sets Introduction Gradient Descent Algorithm (GD) is an iterative algorithm to find a Global Minimum of an objective function (cost function)

More information

Package acebayes. R topics documented: November 21, Type Package

Package acebayes. R topics documented: November 21, Type Package Type Package Package acebayes November 21, 2018 Title Optimal Bayesian Experimental Design using the ACE Algorithm Version 1.5.2 Date 2018-11-21 Author Antony M. Overstall, David C. Woods & Maria Adamou

More information

Package mtsdi. January 23, 2018

Package mtsdi. January 23, 2018 Version 0.3.5 Date 2018-01-02 Package mtsdi January 23, 2018 Author Washington Junger and Antonio Ponce de Leon Maintainer Washington Junger

More information

Introduction to the R Statistical Computing Environment R Programming: Exercises

Introduction to the R Statistical Computing Environment R Programming: Exercises Introduction to the R Statistical Computing Environment R Programming: Exercises John Fox (McMaster University) ICPSR Summer Program 2010 1. A challenging problem: Iterated weighted least squares (IWLS)

More information

A tutorial for blockcluster R package Version 1.01

A tutorial for blockcluster R package Version 1.01 A tutorial for blockcluster R package Version 1.01 Parmeet Singh Bhatia INRIA-Lille, parmeet.bhatia@inria.fr Contents 1 Introduction 1 2 Package details 2 2.1 cocluster function....................................

More information

Learning Alignments from Latent Space Structures

Learning Alignments from Latent Space Structures Learning Alignments from Latent Space Structures Ieva Kazlauskaite Department of Computer Science University of Bath, UK i.kazlauskaite@bath.ac.uk Carl Henrik Ek Faculty of Engineering University of Bristol,

More information

Package bgeva. May 19, 2017

Package bgeva. May 19, 2017 Version 0.3-1 Package bgeva May 19, 2017 Author Giampiero Marra, Raffaella Calabrese and Silvia Angela Osmetti Maintainer Giampiero Marra Title Binary Generalized Extreme Value

More information

Machine Learning. Topic 5: Linear Discriminants. Bryan Pardo, EECS 349 Machine Learning, 2013

Machine Learning. Topic 5: Linear Discriminants. Bryan Pardo, EECS 349 Machine Learning, 2013 Machine Learning Topic 5: Linear Discriminants Bryan Pardo, EECS 349 Machine Learning, 2013 Thanks to Mark Cartwright for his extensive contributions to these slides Thanks to Alpaydin, Bishop, and Duda/Hart/Stork

More information

Logistic Regression. May 28, Decision boundary is a property of the hypothesis and not the data set e z. g(z) = g(z) 0.

Logistic Regression. May 28, Decision boundary is a property of the hypothesis and not the data set e z. g(z) = g(z) 0. Logistic Regression May 28, 202 Logistic Regression. Decision Boundary Decision boundary is a property of the hypothesis and not the data set. sigmoid function: h (x) = g( x) = P (y = x; ) suppose predict

More information

Gradient LASSO algoithm

Gradient LASSO algoithm Gradient LASSO algoithm Yongdai Kim Seoul National University, Korea jointly with Yuwon Kim University of Minnesota, USA and Jinseog Kim Statistical Research Center for Complex Systems, Korea Contents

More information

D-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview

D-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview Chapter 888 Introduction This procedure generates D-optimal designs for multi-factor experiments with both quantitative and qualitative factors. The factors can have a mixed number of levels. For example,

More information

Package extweibquant

Package extweibquant Type Package Package extweibquant February 19, 2015 Title Estimate Lower Extreme Quantile with the Censored Weibull MLE and Censored Weibull Mixture Version 1.1 Date 2014-12-03 Author Yang (Seagle) Liu

More information

As a reference, please find a version of the Machine Learning Process described in the diagram below.

As a reference, please find a version of the Machine Learning Process described in the diagram below. PREDICTION OVERVIEW In this experiment, two of the Project PEACH datasets will be used to predict the reaction of a user to atmospheric factors. This experiment represents the first iteration of the Machine

More information

The Mplus modelling framework

The Mplus modelling framework The Mplus modelling framework Continuous variables Categorical variables 1 Mplus syntax structure TITLE: a title for the analysis (not part of the syntax) DATA: (required) information about the data set

More information

PRI Workshop Introduction to AMOS

PRI Workshop Introduction to AMOS PRI Workshop Introduction to AMOS Krissy Zeiser Pennsylvania State University klz24@pop.psu.edu 2-pm /3/2008 Setting up the Dataset Missing values should be recoded in another program (preferably with

More information

Package vbmp. March 3, 2018

Package vbmp. March 3, 2018 Type Package Package vbmp March 3, 2018 Title Variational Bayesian Multinomial Probit Regression Version 1.47.0 Author Nicola Lama , Mark Girolami Maintainer

More information

c. Typically results in an intractably large set of test cases even for small programs

c. Typically results in an intractably large set of test cases even for small programs Multiple-Choice Questions: 1. True or false? Generally, in practice, developers exhaustively test software. a. True b. False 2. True or false? All real software contains bugs. a. True b. False 3. Which

More information

Package palmtree. January 16, 2018

Package palmtree. January 16, 2018 Package palmtree January 16, 2018 Title Partially Additive (Generalized) Linear Model Trees Date 2018-01-15 Version 0.9-0 Description This is an implementation of model-based trees with global model parameters

More information

LCA Stata Plugin Users' Guide Version 1.2.1

LCA Stata Plugin Users' Guide Version 1.2.1 LCA Stata Plugin Users' Guide Version 1.2.1 Stephanie T. Lanza John J. Dziak Liying Huang Aaron T. Wagner Linda M. Collins Penn State 2018, The Pennsylvania State University Please send questions and comments

More information

Chapter 15 Mixed Models. Chapter Table of Contents. Introduction Split Plot Experiment Clustered Data References...

Chapter 15 Mixed Models. Chapter Table of Contents. Introduction Split Plot Experiment Clustered Data References... Chapter 15 Mixed Models Chapter Table of Contents Introduction...309 Split Plot Experiment...311 Clustered Data...320 References...326 308 Chapter 15. Mixed Models Chapter 15 Mixed Models Introduction

More information

Didacticiel - Études de cas

Didacticiel - Études de cas Subject In some circumstances, the goal of the supervised learning is not to classify examples but rather to organize them in order to point up the most interesting individuals. For instance, in the direct

More information

Missing Data Analysis for the Employee Dataset

Missing Data Analysis for the Employee Dataset Missing Data Analysis for the Employee Dataset 67% of the observations have missing values! Modeling Setup Random Variables: Y i =(Y i1,...,y ip ) 0 =(Y i,obs, Y i,miss ) 0 R i =(R i1,...,r ip ) 0 ( 1

More information

K-Means Clustering 3/3/17

K-Means Clustering 3/3/17 K-Means Clustering 3/3/17 Unsupervised Learning We have a collection of unlabeled data points. We want to find underlying structure in the data. Examples: Identify groups of similar data points. Clustering

More information

Package LVGP. November 14, 2018

Package LVGP. November 14, 2018 Type Package Package LVGP November 14, 2018 Title Latent Variable Gaussian Process Modeling with Qualitative and Quantitative Input Variables Version 2.1.4 Author Siyu Tao, Yichi Zhang Maintainer Siyu

More information

The dblcens Package. August 7, Title Compute the NPMLE of distribution from doubly censored data. d d011ch... 4.

The dblcens Package. August 7, Title Compute the NPMLE of distribution from doubly censored data. d d011ch... 4. The dblcens Package August 7, 2005 Title Compute the NPMLE of distribution from doubly censored data Version 1.1.3 Author Mai Zhou, Li Lee, Kun Chen. Description Use EM algorithm to compute the NPMLE of

More information

IBL and clustering. Relationship of IBL with CBR

IBL and clustering. Relationship of IBL with CBR IBL and clustering Distance based methods IBL and knn Clustering Distance based and hierarchical Probability-based Expectation Maximization (EM) Relationship of IBL with CBR + uses previously processed

More information

Louis Fourrier Fabien Gaie Thomas Rolf

Louis Fourrier Fabien Gaie Thomas Rolf CS 229 Stay Alert! The Ford Challenge Louis Fourrier Fabien Gaie Thomas Rolf Louis Fourrier Fabien Gaie Thomas Rolf 1. Problem description a. Goal Our final project is a recent Kaggle competition submitted

More information

Package lda. February 15, 2013

Package lda. February 15, 2013 Package lda February 15, 2013 Type Package Title Collapsed Gibbs sampling methods for topic models. Version 1.3.2 Date 2012-05-22 Author Jonathan Chang Maintainer Jonathan Chang This

More information

Applied Bayesian Nonparametrics 5. Spatial Models via Gaussian Processes, not MRFs Tutorial at CVPR 2012 Erik Sudderth Brown University

Applied Bayesian Nonparametrics 5. Spatial Models via Gaussian Processes, not MRFs Tutorial at CVPR 2012 Erik Sudderth Brown University Applied Bayesian Nonparametrics 5. Spatial Models via Gaussian Processes, not MRFs Tutorial at CVPR 2012 Erik Sudderth Brown University NIPS 2008: E. Sudderth & M. Jordan, Shared Segmentation of Natural

More information

Package binomlogit. February 19, 2015

Package binomlogit. February 19, 2015 Type Package Title Efficient MCMC for Binomial Logit Models Version 1.2 Date 2014-03-12 Author Agnes Fussl Maintainer Agnes Fussl Package binomlogit February 19, 2015 Description The R package

More information

Discrete Choice Modeling William Greene Stern School of Business, New York University. Lab Session 3

Discrete Choice Modeling William Greene Stern School of Business, New York University. Lab Session 3 Discrete Choice Modeling William Greene Stern School of Business, New York University Lab Session 3 Part I. iate and Multivariate This exercise uses the data file panelprobit.lpj Some preliminaries after

More information

Package bdots. March 12, 2018

Package bdots. March 12, 2018 Type Package Title Bootstrapped Differences of Time Series Version 0.1.19 Date 2018-03-05 Package bdots March 12, 2018 Author Michael Seedorff, Jacob Oleson, Grant Brown, Joseph Cavanaugh, and Bob McMurray

More information

Package milr. June 8, 2017

Package milr. June 8, 2017 Type Package Package milr June 8, 2017 Title Multiple-Instance Logistic Regression with LASSO Penalty Version 0.3.0 Date 2017-06-05 The multiple instance data set consists of many independent subjects

More information

Machine Learning and Data Mining. Clustering (1): Basics. Kalev Kask

Machine Learning and Data Mining. Clustering (1): Basics. Kalev Kask Machine Learning and Data Mining Clustering (1): Basics Kalev Kask Unsupervised learning Supervised learning Predict target value ( y ) given features ( x ) Unsupervised learning Understand patterns of

More information

Analytical model A structure and process for analyzing a dataset. For example, a decision tree is a model for the classification of a dataset.

Analytical model A structure and process for analyzing a dataset. For example, a decision tree is a model for the classification of a dataset. Glossary of data mining terms: Accuracy Accuracy is an important factor in assessing the success of data mining. When applied to data, accuracy refers to the rate of correct values in the data. When applied

More information

1 Training/Validation/Testing

1 Training/Validation/Testing CPSC 340 Final (Fall 2015) Name: Student Number: Please enter your information above, turn off cellphones, space yourselves out throughout the room, and wait until the official start of the exam to begin.

More information

Package maboost. R topics documented: February 20, 2015

Package maboost. R topics documented: February 20, 2015 Version 1.0-0 Date 2014-11-01 Title Binary and Multiclass Boosting Algorithms Author Tofigh Naghibi Depends R(>= 2.10),rpart,C50 Package maboost February 20, 2015 Performs binary and multiclass boosting

More information

Pseudo-Likelihood Estimation of Log-Linear by Linear Association Models to Really Large Tables Using SAS

Pseudo-Likelihood Estimation of Log-Linear by Linear Association Models to Really Large Tables Using SAS Pseudo-Likelihood Estimation of Log-Linear by Linear Association Models to Really Large Tables Using SAS Carolyn J. Anderson University of Illinois at Urbana-Champaign March 22, 2007 Abstract This document

More information

Approximation methods and quadrature points in PROC NLMIXED: A simulation study using structured latent curve models

Approximation methods and quadrature points in PROC NLMIXED: A simulation study using structured latent curve models Approximation methods and quadrature points in PROC NLMIXED: A simulation study using structured latent curve models Nathan Smith ABSTRACT Shelley A. Blozis, Ph.D. University of California Davis Davis,

More information

The biglm Package. August 25, bigglm... 1 biglm Index 5. Bounded memory linear regression

The biglm Package. August 25, bigglm... 1 biglm Index 5. Bounded memory linear regression The biglm Package August 25, 2006 Type Package Title bounded memory linear and generalized linear models Version 0.4 Date 2005-09-24 Author Thomas Lumley Maintainer Thomas Lumley

More information

The cmprsk Package. January 1, 2007

The cmprsk Package. January 1, 2007 The cmprsk Package January 1, 2007 Version 2.1-7 Date 2006-dec-24 Title Subdistribution Analysis of Competing Risks Author Bob Gray Maintainer Bob Gray

More information

Homework #4 Programming Assignment Due: 11:59 pm, November 4, 2018

Homework #4 Programming Assignment Due: 11:59 pm, November 4, 2018 CSCI 567, Fall 18 Haipeng Luo Homework #4 Programming Assignment Due: 11:59 pm, ovember 4, 2018 General instructions Your repository will have now a directory P4/. Please do not change the name of this

More information

Recitation Supplement: Creating a Neural Network for Classification SAS EM December 2, 2002

Recitation Supplement: Creating a Neural Network for Classification SAS EM December 2, 2002 Recitation Supplement: Creating a Neural Network for Classification SAS EM December 2, 2002 Introduction Neural networks are flexible nonlinear models that can be used for regression and classification

More information

CHAPTER 5. BASIC STEPS FOR MODEL DEVELOPMENT

CHAPTER 5. BASIC STEPS FOR MODEL DEVELOPMENT CHAPTER 5. BASIC STEPS FOR MODEL DEVELOPMENT This chapter provides step by step instructions on how to define and estimate each of the three types of LC models (Cluster, DFactor or Regression) and also

More information

DS Machine Learning and Data Mining I. Alina Oprea Associate Professor, CCIS Northeastern University

DS Machine Learning and Data Mining I. Alina Oprea Associate Professor, CCIS Northeastern University DS 4400 Machine Learning and Data Mining I Alina Oprea Associate Professor, CCIS Northeastern University January 24 2019 Logistics HW 1 is due on Friday 01/25 Project proposal: due Feb 21 1 page description

More information

Pattern Recognition Winter Semester 2009/2010. Exemplary Solution

Pattern Recognition Winter Semester 2009/2010. Exemplary Solution Pattern Recognition Winter Semester 2009/2010 Exemplary Solution (bernhard.renard@iwr.uni-heidelberg.de) 4 Exercise The focus of this exercise will be neural networks. You will train and apply a multi-layer

More information

Package DRaWR. February 5, 2016

Package DRaWR. February 5, 2016 Title Discriminative Random Walk with Restart Version 1.0.1 Author Charles Blatti [aut, cre] Package DRaWR February 5, 2016 Maintainer Charles Blatti We present DRaWR, a network-based

More information

CPSC 340: Machine Learning and Data Mining. Principal Component Analysis Fall 2016

CPSC 340: Machine Learning and Data Mining. Principal Component Analysis Fall 2016 CPSC 340: Machine Learning and Data Mining Principal Component Analysis Fall 2016 A2/Midterm: Admin Grades/solutions will be posted after class. Assignment 4: Posted, due November 14. Extra office hours:

More information

Package robustreg. R topics documented: April 27, Version Date Title Robust Regression Functions

Package robustreg. R topics documented: April 27, Version Date Title Robust Regression Functions Version 0.1-10 Date 2017-04-25 Title Robust Regression Functions Package robustreg April 27, 2017 Author Ian M. Johnson Maintainer Ian M. Johnson Depends

More information

Exponential Random Graph Models for Social Networks

Exponential Random Graph Models for Social Networks Exponential Random Graph Models for Social Networks ERGM Introduction Martina Morris Departments of Sociology, Statistics University of Washington Departments of Sociology, Statistics, and EECS, and Institute

More information