搜索资源列表
bp
- 绝对自己写的JAVA程序，对BP神经网络的实现，用面向对象的思想完成。可以作为初学者使用-Absolutely wrote it myself JAVA procedures, achievement of BP neural network, with complete object-oriented thinking. Can serve as a beginner to use
neure
- 十分简单的感知器实现，自己编写，加深对神经网络的了解，面向对象，虽然简单，但对神经网络的初学者还是有参考价值的-Very simple perceptron realized, I have written to enhance understanding of the neural network, object-oriented, although simple, but for a beginner or a neural network reference value
weka-3-4-12
- weka全名是怀卡托智能分析环境（Waikato Environment for Knowledge Analysis），是一个公开的数据挖掘工作平台，集合了大量能承担数据挖掘任务的机器学习算法，包括对数据进行预处理，分类，回归、聚类、关联规则以及在新的交互式界面上的可视化-full name is weka intelligent analysis environment Waikato (Waikato Environment for Knowledge Analysis), is an o
FftLab
- FFT傅立叶频谱分析，从程序的演示可透视出频率频谱相互的换算与复数的关系！-FFT Fourier spectral analysis, from a procedural perspective of the presentation can be a frequency spectrum of the conversion of mutual relations with the plural!
Bayes8054
- 本源程序搜集整理贝叶斯算法判断垃圾邮件，有着很强的功能-Finishing the source Bayesian algorithm to determine the collection of spam, there is a strong function
Mapack_for_NET
- Mapack可用来做矩阵运算 Mapack is a .NET class library for basic linear algebra computations. It supports the following matrix operations and properties: Multiplication, Addition, Subtraction, Determinant, Norm1, Norm2, Frobenius Norm, Infinity Norm, Rank,
CAIM
- caim完善版离散化方法是一种研究数据挖掘方向的程序-caim perfect version of discretization method is a research direction for data mining procedures
RandomGenerator
- 建模与仿真试验中需要产生随机数，以简化模型的建立，降低仿真程序的复杂度，本程序即实现了随机数的产生。-Modeling and Simulation tests need to generate random numbers, to simplify the model, reducing the complexity of simulation program, the process of achieving a random number generation.
GOFuzzyv1.0
- 数据挖掘，多种聚类算法.FCM, HCM, SVM, 等各种柔性聚类方法。-Data mining, a variety of clustering algorithms. FCM, HCM, SVM, such as flexible clustering method.
queryline
- 查询公交线路情况，有转站查询，使用了遗传算法-Query bus lines, the station has a query, using the genetic algorithm
huffman
- 问题描述] 利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Descr iption of the problem] use Huffman encoding of information and communication can grea
quartz-1.6.4
- Quartz is a full-featured, open source job scheduling system that can be integrated with, or used along side virtually any J2EE or J2SE application - from the smallest stand-alone application to the largest e-commerce system. Quartz can be used to cr
TeamBots
- TeamBots 是一个可移植的多代理机器人仿真器，它可以支持动态环境中多代理控制系统的仿真，并可以提供可视化功能。-TeamBots is a portable multi-agent robot simulator, which can support a dynamic environment control system of multi-agent simulation, and can provide visualization capabilities.
ExtendingMatlabusingJava
- 为了能结合Java和 Matlab两者的优点，构造功能更加强大的科学计算环境，对使用Java语言扩展Matlab 主开发环境 自身功能的关键技术进行了研究。首先介绍了使用 Java扩展 Matlab 的基本方法，在此基础上结合项目实践中对复杂图形用 户接口的需要，提出了一种在 Java 对象中通过 Matlab 接口对象访问当前Matlab会话的方法。给出了两个短小完整实例，可 用于进一步扩展与重用。-To be able to combine both Java and Matla
gangqin
- 本程序制作模拟钢琴的实例。程序执行后，创建一个带有模拟钢琴键盘的面板，用户可以通过键盘或者鼠标来“敲击”钢琴键盘发出声音，也可以通过电脑键盘的组合键实现钢琴的高音。-This procedure produced an example of simulation of the piano. Procedures implemented, to create a simulation of the piano keyboard with a panel, the user can, through
BayesFileClassify
- 文本分类是在文档所包含的文本基础上， 把给定的文档分配到固定类别集合中某一个类别的任务。这个任务中常常用到朴素贝叶斯模型。-Text classification are contained in the document text, based on the given document category assigned to a fixed set of a certain type of mission. This task is often used Naive Bayes model
gaknn2008-12-08
- 本算法是实现基于KNN的基因遗传算法，是对KNN算法的改进，具有更好的分类效果。-gaKnn[Genetic Algorithm Optimized K Nearest Neighbor Classification framework] is a frameowork for KNN optimization with a genetic algorithm.
text_classification
- 这是一个文本分类的简单算法,基于weka的，实现文本的分类。-This is a easy classification code.
jgap_3.4.3_src
- JGAP是一种遗传算法和遗传规划的组成部分提供了一个Java框架。它提供了基本的遗传机制，可以很容易地用来申请进化原则问题的解决办法。见实例演示或观赏树的图形，可以创建JGAP找到解决办法的基因进化程序。-JGAP is a genetic algorithm and genetic programming an integral part of providing a Java framework. It provides basic genetic mechanisms, can easil
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put