BBYR Achieve
返回信息流
这是一条镜像帖。来源:北邮人论坛 / ml-dm / #10656同步于 2013/6/2
该镜像源已超过 30 天没有更新,可能在源站已被删除。
ML_DM机器人发帖

[问题]opencv中开源示例使用的是C4.5还是ID3

t01
2013/6/2镜像同步13 回复
rt 具体开源代码sample/c/mushroom.cpp 具体链接 http://www.oschina.net/code/explore/OpenCV-2.2.0/samples/c/mushroom.cpp
订阅后,新回复会通过你的通知中心匿名送达。
9 条回复
t01机器人#1 · 2013/6/2
再问一下,一般选择使用c4.5进行分类,是需要自己编写算法逻辑实现c4.5,还是opencv的库中有已经编好的函数,直接调用就行了?
chentingpc机器人#2 · 2013/6/2
贴个比较供吧: ID3 (Iterative Dichotomiser 3) was developed in 1986 by Ross Quinlan. The algorithm creates a multiway tree, finding for each node (i.e. in a greedy manner) the categorical feature that will yield the largest information gain for categorical targets. Trees are grown to their maximum size and then a pruning step is usually applied to improve the ability of the tree to generalise to unseen data. C4.5 is the successor to ID3 and removed the restriction that features must be categorical by dynamically defining a discrete attribute (based on numerical variables) that partitions the continuous attribute value into a discrete set of intervals. C4.5 converts the trained trees (i.e. the output of the ID3 algorithm) into sets of if-then rules. These accuracy of each rule is then evaluated to determine the order in which they should be applied. Pruning is done by removing a rule’s precondition if the accuracy of the rule improves without it. C5.0 is Quinlan’s latest version release under a proprietary license. It uses less memory and builds smaller rulesets than C4.5 while being more accurate. CART (Classification and Regression Trees) is very similar to C4.5, but it differs in that it supports numerical target variables (regression) and does not compute rule sets. CART constructs binary trees using the feature and threshold that yield the largest information gain at each node.
amazingguoHa机器人#3 · 2013/6/2
感觉楼主不像是opencv入门级菜鸟啊,不带这么玩的吧
t01机器人#4 · 2013/6/3
【 在 amazingguoHa 的大作中提到: 】 : 感觉楼主不像是opencv入门级菜鸟啊,不带这么玩的吧 真是入门级菜鸟。。。因为课设才第一次接触到这个opencv的,老师极力推荐分类用决策树的…… 但不知道一般opencv中直接有决策树这个数据结构,还是需要自己编。。。
buptwangzhe机器人#5 · 2013/6/4
学长,有什么图像处理的相关好的论坛或者资源也发到这个版面上呗? 【 在 chentingpc (chentingpc) 的大作中提到: 】 : 贴个比较供吧: : ID3 (Iterative Dichotomiser 3) was developed in 1986 by Ross Quinlan. The algorithm creates a multiway tree, finding for each node (i.e. in a greedy manner) the categorical feature that will yield the largest information gain for categorical targets. : C4.5 is the successor to ID3 and removed the restriction that features must be categorical by dynamically defining a discrete attribute (based on numerical variables) that partitions the continuous attribute value into a discrete set of intervals. C4 : ...................
chentingpc机器人#6 · 2013/6/4
嗯,希望大家都来贡献些资源,目前我不做CV所以这方面资源可能会少些。有资源会发上来分享的~ 【 在 buptwangzhe 的大作中提到: 】 : 学长,有什么图像处理的相关好的论坛或者资源也发到这个版面上呗?
buptwangzhe机器人#7 · 2013/6/4
好嘞 【 在 chentingpc (chentingpc) 的大作中提到: 】 : 嗯,希望大家都来贡献些资源,目前我不做CV所以这方面资源可能会少些。有资源会发上来分享的~
amazingguoHa机器人#8 · 2013/6/4
我没有见过opencv的决策树,但直觉是应该有,不用自己编 【 在 t01 的大作中提到: 】 : 真是入门级菜鸟。。。因为课设才第一次接触到这个opencv的,老师极力推荐分类用决策树的…… : 但不知道一般opencv中直接有决策树这个数据结构,还是需要自己编。。。
FaceBasin机器人#9 · 2013/6/4
看训练函数的样子应该是实现了C4.5算法。