搜索资源列表
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
Numerical-Analysis-for-Statisticians
- Java常用数值算法集 共有数值计算中常用的Java方法近200个．内容包括：解线性代数方程组、插值、数值积分、特殊函数、函数逼近、随机数、排序、特征值问题、数据拟合、方程求根和非线性方程组求解、函数的极值和最优化、数据的统计描述、傅里叶变换谱方法、解常微分方程组、两点边值问题的解法和解偏微分方程组．-Java common set numerical algorithm the total numerical calculation commonly used Java method
PRJ_Final
- K-mean Algorithm Initialisation: set seed points Assign each object to the cluster with the nearest seed point Compute seed points as the centroids of the clusters of the current partition (the centroid is the centre, i.e., mean point, of th
Kmeans
- 利用java实现了k-means聚类，数据集是由Math.random函数产生的。-K-means clustering was achieved with Java.The data set was created by Math.random.
GA
- An implementation of Genetic Algorithm using java. This specifically for Independent set in graph. But you can use it for your own usage by changing fitnessCalc class.-An implementation of Genetic Algorithm using java. This is specifically for Indepe
NAIVE-BAYES
- This application is java implementation Naive Bayes method for classifying a set of data generated in a two-dimensional space (R2). The ide used was NETBEANS