具体的例子是想象x是0到10之间的一些连续变量,红线是"货物"的分布而蓝色是"坏",我想看看将这个变量合并到检查中是否有价值为了'善良',但我想首先量化蓝色>红色区域的东西数量
因为这是一个分布图,尺度看起来相同,但实际上我的样本中有98倍的好处使事情复杂化,因为它实际上并不只是测量曲线下面积,而是测量不良样本的分布情况沿着比红色更大的线.
我一直在努力学习R,但我甚至不确定如何处理这个,任何帮助赞赏. 
编辑样本数据:http: //pastebin.com/7L3Xc2KU < - 基本上是几百万行.
图表是用.创建的
graph <- qplot(sample_x, bad_is_1, data=sample_data, geom="density", color=bid_is_1)
Run Code Online (Sandbox Code Playgroud)
MrF*_*ick 10
我能想到的唯一方法是使用简单的梯形计算曲线之间的面积.首先,我们手动计算密度
d0 <- density(sample$sample_x[sample$bad_is_1==0])
d1 <- density(sample$sample_x[sample$bad_is_1==1])
Run Code Online (Sandbox Code Playgroud)
现在我们创建将在我们观察到的密度点之间插值的函数
f0 <- approxfun(d0$x, d0$y)
f1 <- approxfun(d1$x, d1$y)
Run Code Online (Sandbox Code Playgroud)
接下来我们找到密度重叠的x范围
ovrng <- c(max(min(d0$x), min(d1$x)), min(max(d0$x), max(d1$x)))
Run Code Online (Sandbox Code Playgroud)
并将其分为500个部分
i <- seq(min(ovrng), max(ovrng), length.out=500)
Run Code Online (Sandbox Code Playgroud)
现在我们计算密度曲线之间的距离
h <- f0(i)-f1(i)
Run Code Online (Sandbox Code Playgroud)
并且使用梯形区域的公式,我们将d1> d0的区域加起来
area<-sum( (h[-1]+h[-length(h)]) /2 *diff(i) *(h[-1]>=0+0))
# [1] 0.1957627
Run Code Online (Sandbox Code Playgroud)
我们可以使用绘制区域
plot(d0, main="d0=black, d1=green")
lines(d1, col="green")
jj<-which(h>0 & seq_along(h) %% 5==0); j<-i[jj];
segments(j, f1(j), j, f1(j)+h[jj])
Run Code Online (Sandbox Code Playgroud)

这是一种对两个密度图之间的区域进行阴影处理并计算该区域大小的方法。
# Create some fake data
set.seed(10)
dat = data.frame(x=c(rnorm(1000, 0, 5), rnorm(2000, 0, 1)),
group=c(rep("Bad", 1000), rep("Good", 2000)))
# Plot densities
# Use y=..count.. to get counts on the vertical axis
p1 = ggplot(dat) +
geom_density(aes(x=x, y=..count.., colour=group), lwd=1)
Run Code Online (Sandbox Code Playgroud)
一些额外的计算来遮蔽两个密度图之间的区域(改编自这个 SO question):
pp1 = ggplot_build(p1)
# Create a new data frame with densities for the two groups ("Bad" and "Good")
dat2 = data.frame(x = pp1$data[[1]]$x[pp1$data[[1]]$group==1],
ymin=pp1$data[[1]]$y[pp1$data[[1]]$group==1],
ymax=pp1$data[[1]]$y[pp1$data[[1]]$group==2])
# We want ymax and ymin to differ only when the density of "Good"
# is greater than the density of "Bad"
dat2$ymax[dat2$ymax < dat2$ymin] = dat2$ymin[dat2$ymax < dat2$ymin]
# Shade the area between "Good" and "Bad"
p1a = p1 +
geom_ribbon(data=dat2, aes(x=x, ymin=ymin, ymax=ymax), fill='yellow', alpha=0.5)
Run Code Online (Sandbox Code Playgroud)
这是两个情节:

为了获得在特定范围内的区域(值的数量)Good,并Bad使用该density功能对每个组(或者你可以继续从拉数据工作ggplot如上,但这样一来你在密度分布是如何更直接的控制生成):
## Calculate densities for Bad and Good.
# Use same number of points and same x-range for each group, so that the density
# values will line up. Use a higher value for n to get a finer x-grid for the density
# values. Use a power of 2 for n, because the density function rounds up to the nearest
# power of 2 anyway.
bad = density(dat$x[dat$group=="Bad"],
n=1024, from=min(dat$x), to=max(dat$x))
good = density(dat$x[dat$group=="Good"],
n=1024, from=min(dat$x), to=max(dat$x))
## Normalize so that densities sum to number of rows in each group
# Number of rows in each group
counts = tapply(dat$x, dat$group, length)
bad$y = counts[1]/sum(bad$y) * bad$y
good$y = counts[2]/sum(good$y) * good$y
## Results
# Number of "Good" in region where "Good" exceeds "Bad"
sum(good$y[good$y > bad$y])
[1] 1931.495 # Out of 2000 total in the data frame
# Number of "Bad" in region where "Good" exceeds "Bad"
sum(bad$y[good$y > bad$y])
[1] 317.7315 # Out of 1000 total in the data frame
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
2006 次 |
| 最近记录: |