最小二乘法

在数据库中发现频繁模式和关联规则是数据挖掘领域的最基本、最重要的问题。大多数早期的研究采用了类似Apriori算法的产生候选级并测试迭代的途径代价是昂贵的，尤其是挖掘富模式和长模式时，Jiawei Han提出了一种新颖的数据结构FP_tree,及基于其上的FP_growth算法，主要用于有效的进行长模式与富模式的挖掘.本文在讨论了FP_growth算法的基础上，提出了用Visual C++实现该算法的方法，并编写了算法的程序。-found in the database model and the frequent association rules is the area of data mining the most fundamental and important issues. Most of the early studies used a similar Apriori algorithm for the selection of candidates and test-iterative way was costly, particularly mining the rich patterns and long model, Jiawei Han proposed a novel data structure FP_tree and on the basis of their FP_growth algorithm used effectively the model for long and rich patterns of excavation. This paper discussed the FP_growth algorithm on the basis of the Visual C of the algorithm, and the preparation procedure of the algorithm.

线性规划模型与整数规划 线性规划模型与整数规划-Linear programming model with integer programming linear programming model with integer programming

Extended Kalman Filter-a toolkit

求取a+b*i的相位角的程序，用于相位谱成图显示，问题关键在于根据a,b的值判断相位角所在的象限-Strike a+ B* i of the phase angle of the procedures for phase spectrum into a graph shows, the problem lies in the basis of a, b values to determine where the phase angle quadrant

由均匀分布的随机变量生成正态分布的随机变量的算法。-by uniform distribution of random variables generate normal random variable algorithm.

SystemC语言编写的随机数产生器,SystemC是C++语言的一个超集-SystemC language random number generator, SystemC is C++ A superset of the language

题目：n阶方阵求逆的实现总体需求：编写一个实现求矩阵逆矩阵的程序。功能需求：1) 输入一个n（n

求矩阵奇异分解svd算法，共计4种实现方式，-for SVD matrix decomposition algorithm, for a total of four kinds of achievement,

关于时间序列分析的matlab程序代码，对原有的工具箱的补充-on time series analysis Matlab code, the original supplementary Toolbox

二叉树的后序算法(递归)-after the sequence of binary tree algorithm (recursive)