搜索资源列表
bintytrees
- 二进制查找树实现代码 BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h-Binary Search Tree code BinaryTree.c BinaryTree.h bst.dsp TreeClient.c item.h
三态树:一个树控件的派生控件
- 三态树:一个树控件的派生控件,完成item的三种状态,Tri-state tree: A tree control derivative controls, the three states to complete item
FP_growth_1221
- FP-growth 算法,包括了建树和挖掘部分。 代码风格良好,可读性强,运算速度快, accident.dat, 340000条数据,50 支持度,建树和挖掘时间100秒左右,mushroom.dat, 8000条记录,建树和挖掘不超过8秒-FP-growth algorithm, written with c++,(ide is visual c++ 2008). The program is very fast and robust,for data of accide
apriori
- A program to find association rules and frequent item sets (also closed and maximal) with the apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of itemsets by subset tes
FPTreeGrowthC
- FPTree增长算法C语言实现 有详尽的注释和中间结果测试代码 包括:FP树, 频繁项集,条件FP树测试-FPTree Growth algorithm C implementation.It consists of detailed commnet and test code of intermediate result such as FP-Tree, frequent item set, conditional FP-Tree
fp_growth
- fp-growth的c实现算法fp-growth将发现所有的频繁项目集的过程分为以下两步:构造频繁模式树fp-tree;调用fp-growth(挖掘出所有的频繁项目集。-fp-growth of the c fp-growth algorithm will find all the frequent item sets is divided into the following two-step process: frequent pattern tree structure fp-tree
binaryTree
- 求二叉树中从根结点到叶子节点的路径 //实现功能: //2. 求二叉树中从根结点到叶子节点的路径 //需求分析: //对于二叉树,分别用递归和非递归的方法编写程序完成如下功能: //1. 输出所有的叶子结点的数据项值。 //2. 输出所有从叶子节点到根结点的路径 //3. 输出(2)中的第一条最长的路径 //程序存在的问题:数值只能输入0~9,其他基本满足要求 //测试数据先序输入:124 7 35 68 9-Find a binary tree from r
FP-Growth
- FP增长树算法C++实现,用于挖掘频繁项,产生关联规则。-FP growth tree the algorithm C++ achieve, for mining frequent item and associated rules.
12-01bag
- 01背包问题 问题陈述:给定n种物品和一背包,物品i的重量是wi,其价值为vi,背包的容量为C。合理选择物品装入背包,使得装入背包中物品的总价值最大。在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。 问题分析:0 1背包问题是一个子集选取问题,适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时,只要其左儿子结点是一个可行结点,搜索就进入左子树,在右子树中有可能包含最优解时才进入右子树搜索;否则将右子树
Apriori
- 这个特殊的Apriori是基于前缀树表示所需的计数器和使用双递归计划,算上交易查找频繁项集和关联规则。-This special Apriori is based on a prefi x tree representation of the needed counters and uses a doubly recursive scheme to count the transactions to Find Frequent Item Sets and Association Rul
lab2
- 1) Given a knapsack with the capacity M and some items with its weight and profit, to solve it using Greedy method and Search tree method. 2) Then compare this results with ones of 0/1 Knapsack problem based on the capacity of M. 3) These items