clementine8.1中文手册经典的数据挖掘软件说明

 1、有9个工件图像，要求从本章讲授的特征提取方法中，选择3~5种提取工件特征并给出数字结果；链码为必选方法，给出数字结果和图形显示，做到链码和原图像的双向变换显示。（实验报告中应描述相应的特征提取方法并略述实现过程）  2、设计的界面中要具备功能：任选1个工件作为目标，以上述实现的特征提取方法识别该目标的工件类型（即序号），并显示该判别基准特征的数据。  3、有可能的话试用聚类、训练或其他方法对这些工件进行分类。 -err

一个很好用的自适应人工神经网络模型库，包括ADALINE/RBF/多层前向等，另外内含Demo，更易上手-A good use of adaptive artificial neural network model library, including the ADALINE/RBF/Multi-layer and so on, the other containing the Demo, even易上手

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W・2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.

portal门户开发，jetspeed的应用及理论讲解-portal development portal, jetspeed application and theory to explain

关于多目标规划的算法，是个好东西，快来下载吧-On the multi-objective programming algorithms, is a good thing, Come to download it

自组织神经网络用于图像分割matlab实现-self-organizing neural networks for image segmentation achieve Matlab

一个使用Java实现的人工智能的图搜索策略程序――酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Search Strategy-- Liquor JiuGongTu problems of artificial intelligence-map search strategy- Demonstration Program-use guide in the field of artificial intelligence, the implicit search of the plan to solve the problem is one of the basic methods, the procedures through the use of multiple map search strategy, the rearrangement JiuGongTu problem solving, presentation of the "breadth- first search," "depth-first search", "bounded depth-first search", "best-first search" and "partial selection of the best search" five basic map search strategy. The whole process of using animation, interface design aesthetic friendly, easy to use.

Visual C++编写的粒子群优化算法！-Visual C++ Prepared particle swarm optimization algorithm!

自已写的Adaboost使用Haalike feature，去Detection-Adaboost use their own written Haalike feature, to Detection

遗传算法的文章- Heredity algorithm article