ID3 ML算法

最短路径是在路网中求解从原点到终点的一条最短的路径。将角度讲肺结核给回顾和u，电弧额糊涂将覅埃尔金。额就会认购。电加热管。阿娇肌肉垃圾啊爱哦节日桶。

该算法基于贪心方法。该算法用于寻找连通无向图的最小生成树。该算法用于加权边缘。图的生成树包含图的所有顶点，如果图包含n条边，则只包含图的（n-1）条边。

计算飞船相对测站的位置矢量单位矢量在赤道坐标系中的三个分量-Calculation of the spacecraft relative position vector of the station unit vector in the equatorial coordinate system of the three subscales

Differential evolution: A simple and efficient heuristic for global optimization over continuous spaces. This code implements a basic multi-objective optimization algorithm based on Diferential Evolution (DE) algorithm. When one objective is optimized, the standard DE runs; if two or more objectives are optimized, the greedy selection step in DE algorithm is performed using a dominance relation.

完整的磁盘文件排序源程序，非常实用的vc源代码-integrity of the disk ranking source document, very useful vc source code

用复化梯形的算法思想求取某一表达式在某一点的满足精度的值-Sputum 复化 Kyung-Ju 的 near 法 steel fist 求取某 Nanjing Nanjing 表达 driving Hitomi 某 点的满 glass 精度的 Order

经典的数据挖掘培训材料,可以快速帮您掌握Clementine的基本使用方法.-Classical data mining training materials, can quickly help you master the basic use of Clementine.

Fast Algorithms for Projected Clustering - PROCLUS - a traditional subspace clustering algorithm for high dimensional data-Fast Algorithms for Projected Clustering- PROCLUS- a traditional subspace clustering algorithm for high dimensional data

运动目标位置预测-moving target location forecast

这个程序是一个用fortran编写的二维腔体对流的数值研究-This procedure is a fortran prepared using two-dimensional cavity of the numerical study of convective