资源列表
gmeans
- gmeans-- Clustering with first variation and splitting 文本聚类算法Gmeans ,使用了3种相似度函数,cosine,euclidean ,KL.文本数据使用的是稀疏矩阵形式. -gmeans clustering with first variation and splitting Gmeans,a text clustering algorithm, uses 3 functions,cosine,euclidean and
S-Isomap
- Descr iption: S-ISOMAP is a manifold learning algorithm, which is a supervised variant of ISOMAP. Reference: X. Geng, D.-C. Zhan, and Z.-H. Zhou. Supervised nonlinear dimensionality reduction for visualization and classification. IEEE Transactio
FASBIR
- Descr iption: FASBIR(Filtered Attribute Subspace based Bagging with Injected Randomness) is a variant of Bagging algorithm, whose purpose is to improve accuracy of local learners, such as kNN, through multi-model perturbing ensemble. Reference:
MixtureEM.tar
- This code is to estimate the parameter of model of Mixture Gauss which is popular model used in pattern classification . JAVA 写的估计复合高斯模型中的参数 -This code is to estimate the parameter of model of Jian Gauss which is popular model used in pattern cla
n元一次方程
- 用c++语言用数值计算方法解n元一次方程组。-using numerical calculation method for n-linear equation group.
gdseepage
- 非恒定渗流计算程序（包括数值解和解析解的程序fortran语言）-unsteady flow calculation procedures (including numerical solution of the analytical solutions and procedures FORTRAN language)
computerDiag
- 计算机故障智能诊断系统 用户输入计算机的故障症状 即可由系统得出故障原因和相关的处理方法-Diagnose the system in computer s trouble intelligence Users input the trouble symptom of the computer Can be had cranky reason and relevant treatment methods systematically
FP-Growth源代码
- FP-GROWTH算法的源代码(JAVA)-FP-Growth code and algrithem
C45Rule-PANE
- 决策树 C45Rule-PANE算法 解决了决策的问题,是从QUILAN算法修改而成-Decision Tree C45Rule - PANE algorithm to solve the problem of decision-making, from QUILAN algorithm revisions
HnSRTree-2.0beta5a
- SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video a
minheap vs minleftisttree
- 这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
Genetic Algorithms and the Traveling Salesman Prob
- 遗传算法的一个例子：旅行商问题。C++源代码，适合初学者研究遗传算法与最优化等方面的知识。-a genetic algorithm examples : the traveling salesman problem. C source code, suitable for beginners and genetic algorithm optimization and other kinds of knowledge.