parcels(x, size = 3, max = TRUE, flip=TRUE,congruence = FALSE)
keysort(keys)
link{parcels}
facilitates the finding of parcels by forming a keys matrix suitable for using in score.items
. These keys represent the n/2 most similar pairs or the n/3 most similar triplets.The algorithm is straightforward: For size = 2, the correlation matrix is searched for the highest correlation. These two items form the first parcel and are dropped from the matrix. The procedure is repeated until there are no more pairs to form.
For size=3, the three items with the greatest sum of variances and covariances with each other is found. This triplet is the first parcel. All three items are removed and the procedure then identifies the next most similar triplet. The procedure repeats until n/3 parcels are identified.
score.items
to score the parcels or iclust
for an alternative way of forming item clusters.parcels(Thurstone)
keys <- parcels(bfi)
keys <- keysort(keys)
score.items(keys,bfi)
Run the code above in your browser using DataCamp Workspace