IND 正在参加 2020 年度 OSC 中国开源项目评选,请投票支持!
IND 在 2020 年度 OSC 中国开源项目评选 中已获得 {{ projectVoteCount }} 票,请投票支持!
投票让它出道
已投票

软件简介

IND 是一个开源的系统,可以处理大部分的独立事件,而这些独立事件都是使用固定长度的向量描述的值。IND 提供了一系列的功能特征和使用风格,主要是为了方便普通用户以及高级用户或者是那些对调查研究感兴趣的人使用。IND 是由四个基础的例程组成:数据操作例程、目录生成例程、目录检测例程和目录显示例程。

IND is applicable to most data sets consisting of independent instances, each described by a fixed length vector of attribute values. An attribute value may be a number, one of a set of attribute specific symbols, or omitted. One of the attributes is delegated the "target" and IND grows trees to predict the target. Prediction can then be done on new data or the decision tree printed out for inspection.

IND provides a range of features and styles with convenience for the casual user as well as fine-tuning for the advanced user or those interested in research. IND can be operated in a Breiman/Friedman/ Olshen/Stone-like mode (but without regression trees, surrogate splits or multivariate splits), and in a mode like C4.5. Advanced features allow more extensive search, interactive control and display of tree growing, and Bayesian and MML algorithms for tree pruning and smoothing. These often produce more accurate class probability estimates at the leaves.

IND also comes with a comprehensive experimental control suite. IND consist of four basic kinds of routines; data manipulation routines, tree generation routines, tree testing routines, and tree display routines. The data manipulation routines are used to partition a single large data set into smaller training and test sets. The generation routines are used to build classifiers. The test routines are used to evaluate classifiers and to classify data using a classifier. And the display routines are used to display classifiers in various formats.

IND is written in K&R C, with controlling scripts in the "csh" shell of UNIX, and extensive UNIX man entries. It is designed to be used on any UNIX system, although it has only been thoroughly tested on SUN platforms. IND comes with a manual giving a guide to tree methods, and pointers to the literature, and several companion documents.

展开阅读全文

评论 (0)

加载中
更多评论
暂无内容
发表了博客
2018/10/19 15:47

this.refs[`tag${ind}`]&&this.refs[`tag${ind}`].clientHeight

react //强制刷新为了获取dom的高度 this.forceUpdate(); <div className={classnames("bottom grade", { auto: tableData[i][val.enName+'hide']&&tableData[i][val.enName+'hide'] == 2 })}> { (val.enName != 'resources' ? (<div ref={`tag${ind}`} className="tag-b...

0
0
发表了博客
2012/07/31 14:11

Monster beats headphones once you placed on ind...

Stay-at-homes adore Beast Is better than earphones I should not cause along with my personal roommates when they're producing sounds, simply because right now I've sound eliminating Beast is better than earphones, daily is by using absolutely no molestations in the other people sounds, simply bec...

0
0
发表了博客
2019/12/19 17:22

浮点数NaN和INF(#IND, #INF)

NaN&INF定义 在一些情况会出现无效的浮点数,例如除0,例如负数求平方根等,像这类情况,获取到的浮点数的值是无效的。 NaN 即 Not a Number 非数字 INF 即 Infinite 无穷大 通常无效浮点数的内存表示方法是: 根据IEEE 754标准: 阶码全1,尾数全0表示无穷大INF。例如1.0/0.0 阶码全1,尾数非全0的表示无效数NaN。例如:求...

0
0
发表了博客
2018/08/08 17:53

(4.5)DBCC的概念与用法(DBCC TRACEON、DBCC IND、DBCC PAGE)

转自:http://www.cnblogs.com/huangxincheng/p/4249248.html DBCC的概念与用法 一:DBCC 1:什么是DBCC   我不是教学老师,我也说不到没有任何无懈可击的定义,全名:Database Console Commands。顾名思义“数据库控制台命令”,说到“控制台“, 我第一反应就是chrome的开发者工具,不知道你的第一反应会是怎样?开发...

0
0
发表了博客
2019/01/14 14:45

MySQL 优化器

(system@127.0.0.1:3306) [trunk]> show variables like '%performance_sch%'; +----------------------------------------------------------+-------+ | Variable_name | Value | +----------------------------------------------------------+-------+ | performance_schema | ON | ###############################...

0
0
发表了博客
2014/06/16 15:49

Using dynamic table is ALV report:

Using dynamic table is ALV report:

0
0
发表了博客
2019/01/10 22:09

全局(Global) 与本地(Local)索引的区别

一、定义说明 oracle数据库中,存在多种对象,最常见的表和索引,索引的目的是为了加快查询;oracle建议一个表>2g时,就建议进行分区,分区表的好处此处省略,分区表有维护操作,但是某些维护操作对整个表的索引维护造成巨大开销,因此本地索引就是解决分区表管理的问题。 非分区索引创建方式,create index index_name...

0
0
发表了博客
2018/03/01 11:08

bzoj 1420 Discrete Root - 原根 - exgcd - BSGS

题目传送门   戳我来传送 题目大意   给定$k, p, a$,求$x^{k}\equiv a \pmod{p}$在模$p$意义下的所有根。   考虑模$p$下的某个原根$g$。   那么$x = g^{ind_{g}x}, a = g^{ind_{g}a}$。   所以原方程转化为$g^{k\cdot ind_{g}x}\equiv g^{ind_{g}a} \pmod{p}$。   所以方程等价于$k\cdot ind_{g}x \equiv i...

0
0
发表了博客
2019/04/16 08:53

python控制语句执行流程(while)

循环语句 Python提供了for循环和while循环(在Python中没有do..while循环) while语句 格式:   while 判断条件:      执行语句.... -->判断条件可以是任何表达式,任何非零、或非空(null)的值均为true while案例描述: count = 0 while (count < 9): print 'The count is:', count count = count + 1 print '结...

0
1
没有更多内容
加载失败,请刷新页面
点击加载更多
加载中
下一页
暂无内容
0 评论
1 收藏
分享
OSCHINA
登录后可查看更多优质内容
返回顶部
顶部