【问题标题】:R: Frequency of all column combinationsR:所有列组合的频率
【发布时间】:2018-09-17 14:42:03
【问题描述】:

问题描述

我有一个大小相同的字符串列表,如下所示:

example.list <- c('BBCD','ABBC','ADDB','ACBB')

然后我想获取特定字母在特定位置的出现频率。 首先,我将其转换为矩阵:

     A1 B1 C1 D1 A2 B2 C2 D2 A3 B3 C3 D3 A4 B4 C4 D4
[1,]  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  1
[2,]  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0
[3,]  1  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0
[4,]  1  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0
[5,]  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1

现在我想获取每个列组合的频率。一些例子:

A1 : B2 = 2
A1 : B3 = 3
B1 : B2 = 1
.. etc

【问题讨论】:

  • 我认为显示的矩阵中应该有 4 行,而不是 5。
  • 另外,根据你的example.list 我认为A1 : B3 = 2 不是吗?
  • 是的,你是对的! @G.Grothendieck

标签: r frequency find-occurrences frequency-analysis


【解决方案1】:

假设你的矩阵被命名为mat

# get all vars present in each row
present <- lapply(seq(nrow(mat)), function(i) names(which(mat[i,] == 1)))
# get all pairs
all.pairs <- gtools::combinations(n = ncol(mat), r = 2, colnames(mat))
# count times pairs appear
count <- apply(all.pairs, 1, function(x){
  there <- lapply(x, function(y) sapply(present, `%in%`, x = y))
  sum(Reduce(`&`, there))
})

cbind(all.pairs, count)[count > 0,]

#                 count
#  [1,] "A1" "B2" "2"  
#  [2,] "A1" "B3" "3"  
#  [3,] "A1" "B4" "2"  
#  [4,] "A1" "C2" "1"  
#  [5,] "A1" "C4" "1"  
#  [6,] "A1" "D2" "1"  
#  [7,] "A1" "D3" "1"  
#  [8,] "A1" "D4" "1"  
#  [9,] "B1" "B2" "1"  
# [10,] "B1" "C3" "1"  
# [11,] "B1" "D4" "1"  
# [12,] "B2" "B3" "2"  
# [13,] "B2" "C3" "1"  
# [14,] "B2" "C4" "1"  
# [15,] "B2" "D4" "2"  
# [16,] "B3" "B4" "1"  
# [17,] "B3" "C2" "1"  
# [18,] "B3" "C4" "1"  
# [19,] "B3" "D4" "1"  
# [20,] "B4" "C2" "1"  
# [21,] "B4" "D2" "1"  
# [22,] "B4" "D3" "1"  
# [23,] "C3" "D4" "1"  
# [24,] "D2" "D3" "1" 

编辑:包括反向对,例如A1:B2 和 B2:A1 都定义 all.pairs 如下

all.pairs <- expand.grid(colnames(mat), colnames(mat))

【讨论】:

  • 谢谢瑞恩!我有一个问题。我想用 x 轴和 y 轴 A1、A2...D4 为这些数据创建一个热图。但是,当我将计数过滤器更改为count &gt; -1(也包括零)时,我发现它没有选择所有组合:第一列不包含D4,第二列不包含A1。如果它们为零或它们已经(反转)存在,是否可以对其进行修改以包括所有组合。
  • 查看我的编辑以包含反向对。要包含零,您可以从最后一步中删除 [count &gt; 0,]
【解决方案2】:

将字符串拆分为单个字符向量的列表s。将n 设置为它们的共同长度,并从s 创建一个矩阵v,其列包含B1 等元素。然后使用xtabs 创建计数,给出m1combn 以获取计数m2 中的对数。

s <- strsplit(example.list, "")
n <- lengths(s)[1]
v <- sapply(s, paste0, 1:n)
m1 <- xtabs(~., data.frame(colv = c(col(v)), v = c(v)))
m2 <- combn(1:ncol(m1), 2, function(ix) sum(m1[, ix[1]] * m1[, ix[2]]))
names(m2) <- combn(colnames(m1), 2, paste, collapse = "")

给予:

> m1
    v
colv A1 B1 B2 B3 B4 C2 C3 C4 D2 D3 D4
   1  0  1  1  0  0  0  1  0  0  0  1
   2  1  0  1  1  0  0  0  1  0  0  0
   3  1  0  0  0  1  0  0  0  1  1  0
   4  1  0  0  1  1  1  0  0  0  0  0

> m2
A1B1 A1B2 A1B3 A1B4 A1C2 A1C3 A1C4 A1D2 A1D3 A1D4 B1B2 B1B3 B1B4 B1C2 B1C3 B1C4 
   0    1    2    2    1    0    1    1    1    0    1    0    0    0    1    0 
B1D2 B1D3 B1D4 B2B3 B2B4 B2C2 B2C3 B2C4 B2D2 B2D3 B2D4 B3B4 B3C2 B3C3 B3C4 B3D2 
   0    0    1    1    0    0    1    1    0    0    1    1    1    0    1    0 
B3D3 B3D4 B4C2 B4C3 B4C4 B4D2 B4D3 B4D4 C2C3 C2C4 C2D2 C2D3 C2D4 C3C4 C3D2 C3D3 
   0    0    1    0    0    1    1    0    0    0    0    0    0    0    0    0 
C3D4 C4D2 C4D3 C4D4 D2D3 D2D4 D3D4 
   1    0    0    0    1    0    0 

【讨论】:

  • 你没有在m2 &lt;- combn(1:ncol(m), 2, function(ix) sum(m1[, ix[1]] * m1[, ix[2]]))中定义m,应该是m1吗?
  • 是的,它最初是 m,我将其更改为 m1,但错过了一个实例。现在应该没问题了。
【解决方案3】:

这应该为您提供每个 colum_A x colum_B 组合的表格列表(A 和 B 蜂号从 1 到 length(nchar(your_Strings)))

rm(list = ls())

example.list <- c('ABCD','ABBC','ADDB','ACBB', "BCBB", "BASD")

example.matrix = matrix(unlist(strsplit(example.list, "")), ncol = nchar(example.list[1]), nrow = length(example.list), byrow = T)

table(example.matrix[,1], example.matrix[,2])

results = list()

for(i in 1:NCOL(example.matrix))
{
  for(j in 1:NCOL(example.matrix))
  {
   temp = as.matrix(table(example.matrix[,i], example.matrix[,j])) 
   rownames(temp) = paste0("pos_",i,"_", rownames(temp))
   colnames(temp) = paste0("pos_",j,"_", colnames(temp))
   print(temp)
   results[[paste0(i,"_",j)]] = temp
  }
}

results

这样的?

编辑: 最好使用 Ryan 的解决方案。它更优雅。

【讨论】:

    猜你喜欢
    • 1970-01-01
    • 1970-01-01
    • 1970-01-01
    • 1970-01-01
    • 1970-01-01
    • 1970-01-01
    • 1970-01-01
    • 2023-03-12
    • 1970-01-01
    相关资源
    最近更新 更多