R 实现朴素贝叶斯算法

摘要: 朴素贝叶斯分类算法是一种常用的分类方法,应用非常广泛,譬如垃圾邮件判断,电子商务反作弊(作弊卖家等等)。 # 数据集来自Tom Mitchell's book "Machine Learning". #定义数据矩阵matrix,matrix(vector, nro ...

朴素贝叶斯分类算法是一种常用的分类方法,应用非常广泛,譬如垃圾邮件判断,电子商务反作弊(作弊卖家等等)。

# 数据集来自Tom Mitchell's book "Machine Learning".

#定义数据矩阵matrix,matrix(vector, nrow=r, ncol=c, byrow=logical_value,  dimnames=list(char_vector_rownames, char_vector_colnames))

#nrow表示行数

#ncol表示列数

#byrow表示矩阵组织方式,按行或者按列

#dimnames表示行标识,列标识
data <- matrix(c("sunny","hot","high","weak","no",
                 "sunny","hot","high","strong","no",
                 "overcast","hot","high","weak","yes",
                 "rain","mild","high","weak","yes",
                 "rain","cool","normal","weak","yes",
                 "rain","cool","normal","strong","no",
                 "overcast","cool","normal","strong","yes",
                 "sunny","mild","high","weak","no",
                 "sunny","cool","normal","weak","yes",
                 "rain","mild","normal","weak","yes",
                 "sunny","mild","normal","strong","yes",
                 "overcast","mild","high","strong","yes",
                 "overcast","hot","normal","weak","yes",
                 "rain","mild","high","strong","no"), byrow = TRUE,
               dimnames = list(day = c(),
                 condition = c("outlook","temperature",
                   "humidity","wind","playtennis")), nrow=14, ncol=5);
 

#统计yes,no出现的概率                 
prior.yes = sum(data[,5] == "yes") / length(data[,5]);
prior.no = sum(data[,5] == "no") / length(data[,5]);

#输入条件向量

###################################################
naive.bayes.prediction <- function(condition.vec) {
###################################################
  # Calculate unnormlized posterior probability for playtennis = yes.
  playtennis.yes <-
    sum((data[,1] == condition.vec[1]) & (data[,5] == "yes")) / sum(data[,5] == "yes") * # P(outlook = f_1 | playtennis = yes)
    sum((data[,2] == condition.vec[2]) & (data[,5] == "yes")) / sum(data[,5] == "yes") * # P(temperature = f_2 | playtennis = yes)
    sum((data[,3] == condition.vec[3]) & (data[,5] == "yes")) / sum(data[,5] == "yes") * # P(humidity = f_3 | playtennis = yes)
    sum((data[,4] == condition.vec[4]) & (data[,5] == "yes")) / sum(data[,5] == "yes") * # P(wind = f_4 | playtennis = yes)
      prior.yes; # P(playtennis = yes)

  # Calculate unnormlized posterior probability for playtennis = no.



  playtennis.no <-
    sum((data[,1] == condition.vec[1]) & (data[,5] == "no")) / sum(data[,5] == "no") * # P(outlook = f_1 | playtennis = no)
    sum((data[,2] == condition.vec[2]) & (data[,5] == "no")) / sum(data[,5] == "no") * # P(temperature = f_2 | playtennis = no)
    sum((data[,3] == condition.vec[3]) & (data[,5] == "no")) / sum(data[,5] == "no") * # P(humidity = f_3 | playtennis = no)
    sum((data[,4] == condition.vec[4]) & (data[,5] == "no")) / sum(data[,5] == "no") * # P(wind = f_4 | playtennis = no)
      prior.no; # P(playtennis = no)



  return(list(post.pr.yes = playtennis.yes,
              post.pr.no = playtennis.no,
              prediction = ifelse(playtennis.yes >=
                playtennis.no, "yes", "no")));
}

naive.bayes.prediction(c("rain","hot","high","strong"));
naive.bayes.prediction(c("sunny","mild","normal","weak"));
naive.bayes.prediction(c("overcast","mild","normal","weak"));

 

执行后,输出结果:

> naive.bayes.prediction(c("rain","hot","high","strong"));
$post.pr.yes
[1] 0.005291005

$post.pr.no
[1] 0.02742857

$prediction
[1] "no"

> naive.bayes.prediction(c("sunny","mild","normal","weak"));
$post.pr.yes
[1] 0.02821869

$post.pr.no
[1] 0.006857143

$prediction
[1] "yes"

> naive.bayes.prediction(c("overcast","mild","normal","weak"));
$post.pr.yes
[1] 0.05643739

$post.pr.no
[1] 0

$prediction
[1] "yes"
  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值