资源列表
Klinjin
- 近邻法的基本思想是在测试样本x的k个近邻中，按出现的样本类别来作为x的类别，即先对x的k个近邻一找出它们的类别，然后对x类别进行判别，即在N个训练样本中，找出x的k个近邻。-The basic idea is that neighbors in a test sample x, k-nearest neighbor in categories according to the sample appears as a type of x, ie the first k nearest neighb
relize
- 离散数学关系性质判断,可判断自反，传递，对称等-Discrete Mathematics nature of the relationship to judge, to determine reflexive, transfer, symmetry, etc.
03-021
- 基于向量机的次优化浮动顺序算法FFSM的应用-Efficient Mining of Frequent Subgraph in the Presence of Isomorphism
ICDM03_2
- 基于向量机的次优化浮动顺序算法向量机的FFSM运用-Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
icpc2010cdproblems
- acm2010年成都赛区网络赛的比赛题目-acm2010 network in Chengdu Division tournament title game
fenzhi
- 算法，用c++实现分治法算法的众数问题（在VS2008平台上）-Algorithm, using c++ implementation of divide and conquer algorithm mode problem (in VS2008 platform)
jiyuguangdianchuanganqizhenliedekongzhisuanfa
- 基于光电传感阵列和摄像头的寻线控制算法，使用两种传感器检测黑线，进行道路循迹-Based on the photoelectric sensor array and Hunt camera control algorithm, using two sensors detect black line, tracking the road
ex2
- 爱因斯坦台阶问题：有人走一台阶，若每步走两级则最后剩一级；若每步走三 (66号) 级则最后剩两级；若每步走四级则最后剩三级；若每步走五级则最后剩四级；若每步走六级则最后剩五级；若每步走七级则刚好不剩，问台阶共有几级 -Einstein step problem: Some people take a step, if each step taking two of the last remaining one if each step had to walk three (66) le
RAGA
- 实数编码遗传算法，采用自适应性变异，有范例，效果良好。-GA base on float,which use the auto-fitness mutation.
ADPCMcodec
- 自适应差分脉码调制算法，源码很好，已经调试过，可以用-Adaptive differential pulse code modulation algorithm, very good source, has been debugged, you can use
SourceCode-Numerical-Recipes-In-C-Version2.10
- C数值算法第二版，书籍附件的源代码。推荐下载-C Numerical Algorithms Second Edition, books annex the source code. Recommended downloads
knn
- 详细的写出了KNN算法的代码，供需要的朋友学习指导-KNN algorithm is a detailed write the code, study guide for a friend in need