VC prepared by the method of least squares algorithms for three

在数据库中发现频繁模式和关联规则是数据挖掘领域的最基本、最重要的问题。大多数早期的研究采用了类似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.

这是匿名论坛小陀毕业设计的源代码。程序参考了匿名和圆点博士的不凡驱动和核心算法！非常棒的参考资料！

资源描述大家互相学习，共同进步！fpga也是比较好的！

这是一个使用同伦算法来解决非线性方程的matlab源程序，可以嵌入任何非线性方程组，从而对非线性方程组进行求解，减少使用者的很多繁琐步骤

糊涂先生给他的五个朋友写信，他写了五封信，但是当他的朋友收到信后，都告诉他：“你的信寄错了”。那么请你计算一下：出现这种情况的概率有多少？（假设糊涂先生是随机地往信封里装信的），你能不能把所有的情况都列出来呢-Mr. foolish to write him five friends, he wrote five letters, but when his friend received a letter, told him:

一个时间显示，并且在按键的同时显示按键的扫描码的程序。-a time, and the keys at the same time show the button code scanning procedures.

基于混合基算法的快速傅立叶变换和反变换在VDSL2中的应用与实现-Mixed-radix FFT-based fast Fourier transform and inverse transform in the application and implementation of VDSL2

svm实现的例子-SVM realize examples

韩家炜近几年的研究成果，是很好的数据挖掘研究者的参考资料-Han Wei, the research results in recent years is a very good reference for data mining researchers

货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration