搜索资源列表
C4_5.m
- his algorithm was proposed by Quinlan (1993). The C4.5 algorithm generates a classification-decision tree for the given data-set by recursive partitioning of data. The decision is grown using Depth-first strategy. The algorithm considers all the poss
PrimAlgorithm
- 最小生成树prim算法，Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and
ESTIMATING-THE-ERGODIC-CAPACITY
- Data aggregation is essential that exploits correlated sensing data and aggregates at intermediate nodes to reduce the number of messages and to improve the energy efficiency in wireless sensor networks. This project considers the problem of construc
discrim_rf
- 斯坦福大学的姚邦鹏开发的一个图像分类算法，使用random forest实现了图像的精细区域描述，赢得了PASCAL VOC2011图像分类竞赛中的winner prize.经测试，程序完全可运行，且提供了MAC和Windows下的两种程序。-Image Classification: An Integration of Randomization and Discrimination in A Dense Feature Representation The goal of our m
815b
- prim算法 kruskal算法用matlab实现 输入标准：x邻接矩阵 p节点集 输出：生成树边集 G-the prim algorithm kruskal algorithm using matlab input standard: x adjacency matrix p node set output: spanning tree edge set of G
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法。Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可。-Prim minimum spanning tree algorithm. The file of Dandn up and down two rows of numbers corresponding node connected to the name and format of the input parameter
M
- 字典树的基本功能是用来查询某个单词（前缀）在所有单词中出现次数的一种数据结构，它的插入和查询复杂度都为O(len),Len为单词（前缀）长度，但是它的空间复杂度却非常高，如果字符集是26个字母，那每个节点的度就有26个，典型的以空间换时间结构。-The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the
ID3
- MATLAB下的决策树ID3算法，应用信息增益来划分节点-ID3 decision tree algorithm under MATLAB application information gain to divide the node