KNOWLEDGE-BASED FEATURE DISCOVERY FOR EVALUATION FUNCTIONS

Since Samuel's work on checkers over thirty years ago, much effort has been devoted to learning evaluation functions. However, all such methods are sensitive to the feature set chosen to represent the examples. If the features do not capture aspects of the examples significant for problem solving, the learned evaluation function may be inaccurate or inconsistent. Typically, good feature sets are carefully handcrafted and a great deal of time and effort goes into refining and tuning them. This paper presents an automatic knowledge-based method for generating features for evaluation functions. The feature set is developed iteratively: features are generated, then evaluated, and this information is used to develop new features in turn. Both the contribution of a feature and its computational expense are considered in determining whether and how to develop it further.
This method has been applied to two problem-solving domains: the Othello board game and the domain of telecommunications network management. Empirical results show that the method is able to generate many known features and several novel features and to improve concept accuracy in both domains.     

On-Line Shape recognition with incremental training using binary synaptic weights algorithm

Recognition of hand drawn shapes is beneficial in drawing packages and automated sketch entry in handheld computers. In this paper, we propose a new approach to on-line geometric shape recognition with incremental training function, which utilizes a heuristic function to reduce noise and a neural network for classification and on-line training. Instead of recognizing segments of a drawing and then performing syntactical analysis to match with a predefined shape, which is weak in terms of generalization and dealing with noise, we examine the shape as a whole. The main concept of the recognition method is derived from the fact that internal angles are very important in the perceived shape of outlines. Our application's aim is to recognize elliptic, rectangular, and triangular shapes in a way similar to human cognition of these shapes. Human beings recognize such basic shapes regardless of the variations in size, noise on the shape border, rotation and in the case of triangles, regardless of the type of the triangle. The key concept is that the neural network learns the relationships between the internal angles of a shape and its classification, therefore only a few training samples which represent the class of the shape are sufficient. Fast meremental training, which is performed on-line, is accomplished by the use of the Binary Synaptic Weights algorithm, a one pass, feedforward neural network training algorithm. Incremental training offers the advantage of adjusting the recognition capability of the system to the user's drawings. the results are very successful, such that the neural network correctly classified shapes that did not have any resemblance to the shapes in the initial training set.     

用熔融还原的方法从浸钒渣中提镓——碳饱和情况下的熔融还原过程

用通用旋转组合设计的方法得到了浸钒渣在饱和碳的熔融还原过程中镓的还原提取率与温度,时间及CaO的加入量关系的非线性数学模型。用非线性优化的方法并综合考虑Fe,Mn的回收,得到了最优的工艺条件及结果;用Langmuir—Knudsen方程推算了镓在铁液中的理论挥发量与时间的关系,与由本模型得到的关系式是一致的。     

小波变换在手写体汉字识别中的应用

汉字识别中的结构类特征具有抗变形的优点，合适做为手写体识别过程使用，但其中笔划特征的提取非常困难。本文用小波变换这一图象分析中有力工具对汉字图象分析处理之后，再进行笔划的提取，其过程简洁、明晰。     

基于类间分散度和类内集中度的文本特征选择。

特征选择是文本分类的关键步骤之一,所选特征子集的优劣直接影响文本分类的结果。论文首先定义了两种特征分类能力：一种是特征对类间文档的分散程度,该分散度越大越好;另一种是特征对类内文档的聚集程度,该集中度越大越好。然后把这两种特征影响度有机地结合起来设计了一个新的特征选择方法,该方法能够对所选特征进行综合考虑,从而使获得的特征集具有较好的代表性。仿真实验表明所提特征选择方法在一定程度上能够提高文本分类性能。     

基于神经网络的特征分析在烟叶分级中的应用。

通过数字图像技术可以自动提取烟叶的颜色和形状特征,而不同特征值对分部位、颜色和等级的决定程度不同,文章结合广义回归神经网络定性分析各种不同特征对部位或颜色分级的影响,分别得到对分部位、颜色和等级有决定影响的特征量,通过建立不同神经网络得到最终等级。     

基于整体特征的快速英文字母识别方法

文章提出了一种基于整体特征的小写英文字母识别方法.首先根据字母图像的赋值背景提取其整体特征,然后构建7个模板进行模板匹配.该方法不需要对图像作复杂的细化处理、轮廓提取等,减少了可能带来的误识和拒识,也不需要现有神经网络方法的长期训练,因而简单快速.同时,不同字体的字母图像其整体特性基本相同,因此识别率较高.     

基于特征选择的集成分类器抗噪性能分析

特征选择有助于增强集成分类器成员间的随机差异性,从而提高泛化精度。研究了随机子空间法（RandomSub-space）和旋转森林法（RotationForest）两种基于特征选择的集成分类器构造算法,分析讨论了两算法特征选择的方式与随机差异程度之间的关系。通过对UCI数据集引入噪声,比较两者在噪声环境下的分类精度。实验结果表明：当噪声增加及特征关联度下降时,基本学习算法及噪声程度对集成效果均有影响,当噪声增强到一定程度后。集成效果和单分类器的性能趋于一致。     

基于启发式规则优化的网页元素提取方法

网页信息提取方法中的启发式规则,是识别网页标签信息、利用网页节点分析结果、针对网页不同内容、完成信息提取的重要手段。本研究在对现有启发式规则进行研究分析的基础上,提出了几种优化的启发式规则,实现对网页标题、发布时间、来源以及正文内容等元素信息的精准提取。本研究进一步提出了运用编辑距离算法实现正文内容提取准确率的判定,并提出阙值优化方法,克服了正文提取中噪声节点多、内容识别不完全的缺陷,大大提高了提取的准确度。