搜索资源列表
一种基于最小张树的属性聚类算法
- 一种基于最小生成数的聚类算法，是一个可以的选择。-generated based on the smallest number of clustering algorithm, it is a choice.
ID3_java.rar
- 基于决策树的数据挖掘算法，是很不错的Java版的ID3算法，大家可以看看。, The ID3 decision tree algorithm for Data Mining .
sequence-aligment
- 基于关键字树的序列比对算法，用于比对多个相似程度很高的DNA序列，此为复杂度较低的星比对算法。-Keyword-based tree sequence alignment algorithm for more than a high degree of similarity of DNA sequences, this is the low complexity of the star alignment algorithm.
Othello
- 使用java编写的GUI的黑白棋游戏，搜索算法采用经典的博弈树，并在此基础上做了大量优化，我的评估函数采用了Simon M. Lucas 和 Thomas P. Runarsson 在其合作发表的 Temporal Difference Learning Versus Co-Evolution for Acquiring Othello Position Evaluation 中通过对比即时差分学习（TDL，Temporal Difference Learning）和协同进化（CEL，Co-
binaryTreeaMST
- 用java语言实现的基于图的Prim算法，实现最小生成树的生成。以及一些二叉树算法的实现，比如哈弗曼编码-Using java language of Prim' s algorithm is based plans to achieve the minimum spanning tree generation. And some of the binary tree algorithm, such as Ha Fuman coding
Prototype
- java编写的基于BANKS算法简单实现数据库中最小Steiner树查询-Keyword Searching and Browsing in Databases Using BANKS
WordRecoverTool
- 一种基于二叉树数据库模型的分词算法，很好用 -A segmentation algorithm based on binary tree database model, well used
ID3
- 基于ID3的决策树分类算法，是数据挖掘中常用的一种算法。代码压缩包中包含所有java程序，但需要用户自己建立数据库的表。-ID3-based decision tree classification algorithm, is a commonly used data mining algorithms. Code archive contains all java program, but requires the user to create their own database table
RandomForest
- 基于决策树实现的随机森林算法，是数据挖掘中一个经典的分类算法，对初学者具有很好的学习参考意义。-Based on Decision Tree achieved random forests algorithm is a classical data mining classification algorithm, for beginners to learn with a good reference value.
mcts-java-1
- 蒙特卡洛树搜索算法，基于Java实现，有需要的下载- Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in game play
SUFFIX
- 基于UKKOKEN算法的单词后缀树构建算法- U57FA u4E8EUKKOKEN u7B97 u6CD5 u7684 u5355 u8BCD u540E u7F00 u6811 u6784 u5EFA u7B97 u6CD5