R - 两个data.tables的匹配值的索引

时间:2013-11-10 23:24:33

标签: r data.table apply

这是我在StackOverflow上的第一篇文章。我是编程中的新手,并试图使用R中的data.table,因为它在速度上的声誉。

我有一个非常大的data.table,名为" Actions",有5列,可能有数百万行。列名是k1,k2,i,l1和l2。我有另一个data.table,在列k1和k2中具有Actions的唯一值,命名为" States"。

对于Actions中的每一行,我想找到第4列和第5列的唯一索引,与状态匹配。可重现的代码如下:

S.disc <- c(2000,2000)
S.max  <- c(6200,2300)
S.min  <- c(700,100)

Traces.num <- 3
Class.str <- lapply(1:2,function(x) seq(S.min[x],S.max[x],S.disc[x]))
Class.inf <- seq_len(Traces.num)
Actions <- data.table(expand.grid(Class.inf, Class.str[[2]], Class.str[[1]], Class.str[[2]], Class.str[[1]])[,c(5,4,1,3,2)])
setnames(Actions,c("k1","k2","i","l1","l2"))
States <- unique(Actions[,list(k1,k2,i)])

因此,如果我使用的是data.frame,则以下行将是:

index  <- apply(Actions,1,function(x) {which((States[,1]==x[4]) & (States[,2]==x[5]))})

如何有效地使用data.table执行相同的操作?

1 个答案:

答案 0 :(得分:2)

一旦你掌握了keys以及可能在j data.table表达式中使用的特殊符号,这一点就相对简单了。试试这个......

#  First make an ID for each row for use in the `dcast`
#  because you are going to have multiple rows with the
#  same key values and you need to know where they came from
Actions[ , ID := 1:.N ]

#  Set the keys to join on
setkeyv( Actions , c("l1" , "l2" ) )
setkeyv( States , c("k1" , "k2" ) )    

#  Join States to Actions, using '.I', which
#  is the row locations in States in which the
#  key of Actions are found and within each
#  group the row number ( 1:.N - a repeating 1,2,3)
New <- States[ J(Actions) , list( ID , Ind = .I , Row = 1:.N ) ]
#    k1  k2 ID Ind Row
#1: 700 100  1   1   1
#2: 700 100  1   2   2
#3: 700 100  1   3   3
#4: 700 100  2   1   1
#5: 700 100  2   2   2
#6: 700 100  2   3   3

#  reshape using 'dcast.data.table'
dcast.data.table( Row ~ ID , data = New , value.var = "Ind" )
#   Row 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27...
#1:   1 1 1 1 4 4 4 7 7 7 10 10 10 13 13 13 16 16 16  1  1  1  4  4  4  7  7  7...
#2:   2 2 2 2 5 5 5 8 8 8 11 11 11 14 14 14 17 17 17  2  2  2  5  5  5  8  8  8...
#3:   3 3 3 3 6 6 6 9 9 9 12 12 12 15 15 15 18 18 18  3  3  3  6  6  6  9  9  9...
相关问题