Elaslic-finite-finite

ap算法完成ap聚类操作 需要输入参数为数据集 偏向参数 输出结果为聚类数目(The AP algorithm completes the AP clustering operation, the input parameter is the data set bias parameter, and the output result is the number of clusters)

数据挖掘中的聚合层次聚类算法,有完整的注释()

训练SVR模型做预测,可调整训练集和测试集比例及SVR参数，预测性能用MAP反映(The training SVR model can be used for prediction. The proportion of training set and test set and the parameters of SVR can be adjusted. The prediction performance can be reflected by MAP.)

说明：  用matlab 实现了kmeans算法还附有评价指标计算(Matlab to achieve kmeans algorithm also attached to the evaluation index calculation)

用matlab 实现了kmeans算法还附有评价指标计算(Matlab to achieve kmeans algorithm also attached to the evaluation index calculation)

用java实现的一种聚类方法, 应用了iris这个非常出名的数据 和glass这个非常出名的数据,很不错的,值得大家看看,()

说明：  python深度学习股票分析框架，就这么多了(python learning stock)

Softmax用于多分类问题，本例是将MNIST手写数字数据库中的数据0-9十个数字进行分类，其中训练样本有6万个，测试样本有1万个数字是0~9(Softmax for multi classification problems, the present case is the handwritten data MNIST digital 0-9, classification, training samples which have 60,000, there are 10,000 test samples digit 0 to 9)

C++经典数值算法源码, 包括线性代数方程组的求解, 数学变换与滤波等(C classical numerical algorithm source code, including the solution of linear algebraic equations, mathematical transformation and filtering, etc.)

哈弗曼编码，构造哈夫曼树，构造哈夫曼树非常简单，将所有的节点放到一个队列中，用一个节点替换两个频率最低的节点，新节点的频率就是这两个节点的频率之和。这样，新节点就是两个被替换节点的父节点了。如此循环，直到队列中只剩一个节点（树根）。(Hoffman coding, Huffman tree structure, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequency node with a node, the new node and the frequency of frequency is the two nodes. So, the new node is two replaced node parent node. So the cycle, until the queue is only one node (Shu Gen). )