搜索资源列表
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
JFDTD
- JFDTD , a good FDTD oprocdure with programs to analyse and visualize the EM phenomena
plot_cv_predict
- cross_val_predict算法主要应用于可视化预测-use cross_val_predict to visualize prediction errors.
ASE-FSE文档
- 软件缺陷预测的文档，包括fse tse顶会的文章(visualize software defect prediction of fse and tse, you can learn this paper)
kMeans
- 用python实现k-means算法。随机生成二位可视化数据集 然后进行可视化聚类(The k-means algorithm is implemented with Python. Randomly generate two bit visual data set and visualize clustering.)