资源列表
Apriori
- Apriori算法是一种最有影响的挖掘布尔关联规则频繁项集的算法。其核心是基于两阶段频集思想的递推算法。该关联规则在分类上属于单维、单层、布尔关联规则。在这里，所有支持度大于最小支持度的项集称为频繁项集，简称频集。 - （1） L1 = find_frequent_1-itemsets(D) （2） for (k=2 Lk-1 ≠Φ k++) { （3） Ck = apriori_gen(Lk-1 ,min_sup) （4） for each transaction t ∈ D
Deconvolution
- 运用此程序可以帮您完成信号反褶积的算法，分析问题-Using this program can help you complete the signal deconvolution algorithms, analyze problems
Least-squares-deconvolution
- 用最小平方反褶积算法来用c语言编程完成算法，解决反褶积问题-Deconvolution using least-squares algorithm to complete the algorithm with c language programming to address the problem of deconvolution
algorithm
- 超松弛迭代法、最小二乘法、拉格朗日插值法、牛顿插值法、牛顿迭代法、雅克比迭代-Over relaxation method, least squares, Lagrange interpolation, Newton interpolation, Newton' s iterative method, Jacobi iteration
EffectiveSTL
- 关于c++ STL的最经典书籍了，希望对大家有用-the book about C++ STL
online-submission-
- 基于web的在线投稿系统，帮你轻松的解决问题-Web-based online submission system to help you easily solve the problem
matlab
- matlab讲义资料，教你如何简单的掌握matlab的使用方法-matlab lecture materials, teaching you how to master the simple use of matlab
SMOSVM
- 用于svc分类， 用SMO实现SVC，并在UCI数据集Iris上进行实验,2. 可借鉴现成SVM软件包，实现回归分析。 -For svc classification, using SMO to achieve SVC, and in the UCI Iris data set on the experiment, 2. SVM can learn ready-made packages, to achieve regression analysis.
hash
- Hash table，也叫哈希表，是根据关键码值(Key value)而直接进行访问的数据结构。-Hash table, also called the hash table is based on the key code value (Key value) and direct access to the data structure.
sharebookfree.com_1162780149
- Digital system design with VHDL Roth
optimaztion
- Chapter 8. Numerical Optimization Algorithm 8.1 Golden Search for a Minimum Algorithm 8.2 Nelder-Mead s Minimization Method Algorithm 8.3 Local Minimum Search Using Quadratic Interpolation Algorithm 8.4 Steepest Descent or Gradie
root
- Chapter 2. The Solution of Nonlinear Equations f(x) = 0 Algorithm 2.1 Fixed Point Iteration Algorithm 2.2 Bisection Method Algorithm 2.3 False position or Regula Falsi Method Algorithm 2.4 Approximate Location of Roots Algorithm 2.5