资源列表
datamining
- 数据挖掘 介绍-Introduction of Data Mining
k_means
- this code is a faster kmeans clustering implementation
fly
- 通过实现文件ft1调用函数fseries，完成傅里叶级数实现.-realization of fourier series by implemention of the file ft1,doing the function fseries
vq
- vq算法，一个矢量量化算法，用于图像压缩，很经典的算法 -vq
recognition
- this file has codes that describes how to ccmpute the signal spectrum , the power spectrum, how to calculate the autocorrelation sequence of a signal, how to calculate the autoregressive coeffecients of a signal,and how to reduce the noisy elements i
ALG025
- 解方程，给出一个连续函数接f(x)=0的值，前提是给两个附近的值，且符号相反 - METHOD OF FALSE POSITION ALGORITHM 2.5 To find a solution to f(x) = 0 given the continuous function f on the interval [p0,p1], where f(p0) and f(p1) have opposite signs: INPUT
ALG024
- SECANT法求解一个连续方程，f(x) = 0，给两个初始值- SECANT ALGORITHM 2.4 To find a solution to the equation f(x) = 0 given initial approximations p0 and p1: INPUT: initial approximation p0, p1 tolerance TOL maximum number o
ALG023
- NEWTON-RAPHSON求解一个连续方程，f（X）=0，前提给一个初始值- NEWTON-RAPHSON ALGORITHM 2.3 To find a solution to f(x) = 0 given an initial approximation p0: INPUT: initial approximation p0 tolerance TOL maximum n
www
- 用来实现隐马尔科夫树的分类，已运行过，绝对可用-wavelet domain hidden Markov models
ALG022
- 解方程，给出一个连续函数接f(x)=0的值，前提是给一个附近的值- FIXED-POINT ALGORITHM 2.2 To find a solution to p = g(p) given an initial approximation p0 INPUT: initial approximation p0 tolerance TOL maximum number of iterations NO.
ALG021
- 解方程，具体见英文描述，给一个连续方程，解出f(x) = 0 在一定范围的解- To find a solution to f(x) = 0 given the continuous function f on the interval [a,b], where f(a) and f(b) have opposite signs: INPUT: endpoints a,b tolerance TOL maximum
WiseBoy
- 一个可自我学习的人工智能小模型，可进行训练，也可进行提问。 -A small self-learning artificial intelligence model for training, but also ask questions.