rboTopics | R Documentation |
Calculates the similarity of all pairwise topic combinations using the rank-biased overlap (RBO) Similarity.
rboTopics(topics, k, p, progress = TRUE, pm.backend, ncpus)
topics |
[ |
k |
[ |
p |
[0,1] |
progress |
[ |
pm.backend |
[ |
ncpus |
[ |
The RBO Similarity for two topics \bm z_{i} and \bm z_{j} is calculated by
RBO(\bm z_{i}, \bm z_{j} \mid k, p) = 2p^k\frac{≤ft|Z_{i}^{(k)} \cap Z_{j}^{(k)}\right|}{≤ft|Z_{i}^{(k)}\right| + ≤ft|Z_{j}^{(k)}\right|} + \frac{1-p}{p} ∑_{d=1}^k 2 p^d\frac{≤ft|Z_{i}^{(d)} \cap Z_{j}^{(d)}\right|}{≤ft|Z_{i}^{(d)}\right| + ≤ft|Z_{j}^{(d)}\right|}
with Z_{i}^{(d)} is the vocabulary set of topic \bm z_{i} down to rank d. Ties in ranks are resolved by taking the minimum.
The value wordsconsidered
describes the number of words per topic
ranked at rank k or above.
[named list
] with entries
sims
[lower triangular named matrix
] with all pairwise
similarities of the given topics.
wordslimit
[integer
] = vocabulary size. See
jaccardTopics
for original purpose.
wordsconsidered
[integer
] = vocabulary size. See
jaccardTopics
for original purpose.
param
[named list
] with parameter
type
[character(1)
] = "RBO Similarity"
,
k
[integer(1)
] and p
[0,1]. See above for explanation.
Webber, William, Alistair Moffat and Justin Zobel (2010). "A similarity measure for indefinite rankings". In: ACM Transations on Information Systems 28(4), p.20:1–-20:38, DOI 10.1145/1852102.1852106, URL https://doi.acm.org/10.1145/1852102.1852106
Other TopicSimilarity functions:
cosineTopics()
,
dendTopics()
,
getSimilarity()
,
jaccardTopics()
,
jsTopics()
res = LDARep(docs = reuters_docs, vocab = reuters_vocab, n = 4, K = 10, num.iterations = 30) topics = mergeTopics(res, vocab = reuters_vocab) rbo = rboTopics(topics, k = 12, p = 0.9) rbo sim = getSimilarity(rbo) dim(sim)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.