Description Usage Arguments Details Examples
This function matches pairs of names based on similarity to create a set of trials. Names are matched, such that each name is only used once and the sum of the distances over all names in total is minimized.
1 | match.pairs(n1, n2, ...)
|
n1 |
First subset of the names used in pairing |
n2 |
Second subset of the names used in pairing |
... |
Arguments passed on to
|
Normally the principal components are used for matching names, but other ratings can also be added and emphasized to create sets of names which are more similar along a special set of ratings.
Note: This function takes the two groups of names as separate arguments,
1 2 3 4 5 6 7 8 9 10 11 12 | # Split the names according to intelligence
s <- partition.names(Intelligence)
# Further split the names randomly
low <- partition.names.random(subset=s[1], prop=c(1,1,1,1))
high <- partition.names.random(subset=s[1], prop=c(1,1,1,1))
# Create sets with matching high/low intelligence names
low_low <- match.pairs(low[1], low[2])
low_high <- match.pairs(low[3], high[1])
high_low <- match.pairs(high[2], low[4])
high_high <- match.pairs(high[3], high[4])
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.