▍1. Kmeans
通过k均值算法寻找类中心,聚类,对数据实现有效划分。(The k-means algorithm is used to find the class center, the data is clustered and the data is divided.)
通过k均值算法寻找类中心,聚类,对数据实现有效划分。(The k-means algorithm is used to find the class center, the data is clustered and the data is divided.)
An article about how in matlab of pso algorithm in the paper, so as to realize optimization to solve,,
按最大相关-最小冗余对特征排序,里面包括求特征间的互信息(Sort the features according to the maximum correlation minimum redundancy)
社区发现 GN 算法完整实现,无向图和有向图,强社团等(GN devide a huge matrix)
应用Dijkstra算法对铁路网络两站点间最短径搜索,附有我国铁路网络数据。(Application of Dijkstra algorithm rail network between the two sites on the shortest route search, with China s railway network data.)
机组负荷最优分配,动态规划,最小耗水为模型,个人编写,可以运行(Unit load optimal allocation, dynamic programming, minimum water consumption for the model, the individual is written, you can run)
利用宽度有限方法(BFS)寻找最短路径和最小树的算法和算例。(Use of finite width method (BFS) to find the shortest path and minimum tree algorithms and numerical examples.)
该代码是计算节点介数,分析网络的个体的重要性。简单地讲,一个节点的Betweenness表示所有的节点对之间通过该节点的最短路径条数。Betweenness很好地描述了一个网络中节点可能需要承载的流量。(The code is node betweenness calculation, analysis of the importance of individual network. Simply put, a node Betweenness said all of the article by the nodes of the shortest path between nodes to count. Betweenness well describes a network node may need to load flow. )
哈弗曼编码,构造哈夫曼树,构造哈夫曼树非常简单,将所有的节点放到一个队列中,用一个节点替换两个频率最低的节点,新节点的频率就是这两个节点的频率之和。这样,新节点就是两个被替换节点的父节点了。如此循环,直到队列中只剩一个节点(树根)。(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). )
哈弗曼编码,构造哈夫曼树,构造哈夫曼树非常简单,将所有的节点放到一个队列中,用一个节点替换两个频率最低的节点,新节点的频率就是这两个节点的频率之和。这样,新节点就是两个被替换节点的父节点了。如此循环,直到队列中只剩一个节点(树根)。(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). )
Shu-ChuanChu受到猫日常行为动作的启发,于2006年提出了猫群算法。猫群算法的最大特征表现为在进化过程中能够同时进行局部搜索和全局搜索,具有很好的收敛速度(Shu- ChuanChu inspired by cats everyday actions, cat swarm algorithm is proposed in 2006. Cat swarm algorithm of the biggest characteristic is in the process of evolution can carry on the global search and local search at the same time, has the very good convergence )
Shu-ChuanChu受到猫日常行为动作的启发,于2006年提出了猫群算法。猫群算法的最大特征表现为在进化过程中能够同时进行局部搜索和全局搜索,具有很好的收敛速度(Shu- ChuanChu inspired by cats everyday actions, cat swarm algorithm is proposed in 2006. Cat swarm algorithm of the biggest characteristic is in the process of evolution can carry on the global search and local search at the same time, has the very good convergence )
用matlab语言写的kdtree函数(k-d树,是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索)(failed to translate)
详细的二叉树画法,和其他的有所不同,很有特色的。(Details of the binary tree painting, and other different, very unique.)
弗洛伊德算法计算有向网络图最短路问题。可算最短路径。(Freud algorithm to calculate the shortest path problem to the network diagram. Can be considered the shortest path.)
自己开发的小程序,可以实现快速调用文件求解相干函数。(Develop their own program, you can achieve quick access to documents for solving the coherence function.)
背包问题,可以解决最短路径问题,或优化问题(Knapsack problem, the shortest path problem can be solved, or optimization problems)
统计数据的预处理源程序大全,数据的平滑处理,数据的标准化转换,数据的极差归一化变换(Daquan source of statistical data pre-processing, data smoothing, standardization of data conversion, data conversion of poor normalization)