Subtractive clustering attribute weighting (SCAW) to discriminate the traffic accidents on Konya-Afyonkarahisar highway in Turkey with the help of GIS: A case study

A case study including the discrimination of traffic accidents as accident free and accident cases on Konya-Afyonkarahisar highway in Turkey using the proposed hybrid method based on combining of a new data preprocessing method called subtractive clustering attribute weighting (SCAW) and classifier algorithms with the help of Geographical Information System (GIS) technology has been conducted. In order to improve the discrimination of classifier algorithms including artificial neural network (ANN), adaptive network based fuzzy inference system (ANFIS), support vector machine, and decision tree, using data preprocessing need in solution of these kinds of problems (traffic accident case study). So, we have proposed a novel data preprocessing method called subtractive clustering attribute weighting (SCAW) and combined with classifier algorithms. In this study, the experimental data has been obtained by means of using GIS. The obtained GIS attributes are day, temperature, humidity, weather conditions, and month of occurred accident. To evaluate the performance of the proposed hybrid method, the classification accuracy, sensitivity and specificity values have been used. The experimental obtained results are 53.93%, 52.25%, and 38.76% classification successes using alone ANN, ANFIS, and SVM with RBF kernel type, respectively. As for the proposed hybrid method, the classification accuracies of 67.98%, 70.22%, and 61.24% have been obtained using the combination of SCAW with ANN, the combination of SCAW with SVM (radial basis function (RBF) kernel type), and the combination of SCAW with ANFIS, respectively. The proposed SCAW method with the combination of classifier algorithms has been achieved the very promising results in the discrimination of traffic accidents.     

属性重要性评分方法的改进

研究信息系统的属性重要性评分方法,通过引入敏感系数构建神经网络模型,提出属性重要性评分算法,将信息系统的各条件属性和决策属性构造一个径向基函数(RBF)神经网络。经训练和学习后,综合考虑各属性间的关系,动态调整RBF网络的拓扑结构,评分各属性的重要性。以红籽西瓜性状数据作为样本数据和测试数据进行实例分析,验证该方法的有效性。     

A linear model based on Kalman filter for improving neural network classification performance

Neural network has been applied in several classification problems such as in medical diagnosis, handwriting recognition, and product inspection, with a good classification performance. The performance of a neural network is characterized by the neural network's structure, transfer function, and learning algorithm. However, a neural network classifier tends to be weak if it uses an inappropriate structure. The neural network's structure depends on the complexity of the relationship between the input and the output. There are no exact rules that can be used to determine the neural network's structure. Therefore, studies in improving neural network classification performance without changing the neural network's structure is a challenging issue. This paper proposes a method to improve neural network classification performance by constructing a linear model based on the Kalman filter as a post processing. The linear model transforms the predicted output of the neural network to a value close to the desired output by using the linear combination of the object features and the predicted output. This simple transformation will reduce the error of neural network and improve classification performance. The Kalman filter iteration is used to estimate the parameters of the linear model. Five datasets from various domains with various characteristics, such as attribute types, the number of attributes, the number of samples, and the number of classes, were used for empirical validation. The validation results show that the linear model based on the Kalman filter can improve the performance of the original neural network.     

权值与结构双确定法的RBF神经网络分类器

为了解决径向基函数(RBF)神经网络权值与结构难以确定的问题,基于权值直接确定法,及隐层神经元中心、方差、数目与神经网络性能的关系,提出一种边增边删型的网络权值与结构双确定法。在此方法基础之上,构建一种RBF神经网络分类器并探讨其分类性能和抗噪能力。计算机数值实验结果验证所提出的边增边删型的权值与结构双确定法能够快速、有效地确定网络的中心、方差和网络最优的权值与结构,所构造的模式分类器具有优越的分类性能和抗噪能力。     

基于线性回归和属性集成的分类算法

对于高维度小样本数据的分类问题,高维属性的复杂性限制了分类模型预测的准确率。为了进一步提高准确率,提出了基于线性回归和属性集成的分类算法。首先,采用线性回归为每一个属性构建属性线性分类器(Attri-bute Linear Classifier,ALC);其次,为了避免因ALC数量过多而导致准确率下降,利用经验风险最小化策略中的经验损失值作为评估标准来优选ALC;最后,应用多数投票法来集成被筛选的ALC。采用高维度小样本的基因表达数据集进行实验,结果显示该算法具有比逻辑回归、支持向量机和随机森林算法更高的准确率。     

基于信息增益和粗糙集的入侵检测方法

传统的随机森林在网络入侵检测中收敛速度慢,并且学习性能不够完善。为消除原始入侵检测数据中的冗余信息,提出一种基于信息增益和粗糙集的随机森林入侵检测方法。使用信息增益对数据的各个属性进行相关分析,删除冗余属性,减小属性简约的时间复杂度;利用粗糙集理论从数据中提取分明函数,求得属性简约;使用随机森林分类器进行分类。实验结果表明,该方法收敛速度较快,在召回率和精度方面都要高于传统的随机森林方法,尤其是在训练样本充足的网络环境下,效果更加明显。     

Attribute weighted Naive Bayes classifier using a local optimization

The Naive Bayes classifier is a popular classification technique for data mining and machine learning. It has been shown to be very effective on a variety of data classification problems. However, the strong assumption that all attributes are conditionally independent given the class is often violated in real-world applications. Numerous methods have been proposed in order to improve the performance of the Naive Bayes classifier by alleviating the attribute independence assumption. However, violation of the independence assumption can increase the expected error. Another alternative is assigning the weights for attributes. In this paper, we propose a novel attribute weighted Naive Bayes classifier by considering weights to the conditional probabilities. An objective function is modeled and taken into account, which is based on the structure of the Naive Bayes classifier and the attribute weights. The optimal weights are determined by a local optimization method using the quasisecant method. In the proposed approach, the Naive Bayes classifier is taken as a starting point. We report the results of numerical experiments on several real-world data sets in binary classification, which show the efficiency of the proposed method.     

Attribute bagging: improving accuracy of classifier ensembles by using random feature subsets

We present attribute bagging (AB), a technique for improving the accuracy and stability of classifier ensembles induced using random subsets of features. AB is a wrapper method that can be used with any learning algorithm. It establishes an appropriate attribute subset size and then randomly selects subsets of features, creating projections of the training set on which the ensemble classifiers are built. The induced classifiers are then used for voting. This article compares the performance of our AB method with bagging and other algorithms on a hand-pose recognition dataset. It is shown that AB gives consistently better results than bagging, both in accuracy and stability. The performance of ensemble voting in bagging and the AB method as a function of the attribute subset size and the number of voters for both weighted and unweighted voting is tested and discussed. We also demonstrate that ranking the attribute subsets by their classification accuracy and voting using only the best subsets further improves the resulting performance of the ensemble.     

Editorial

This study investigates the potential of applying the radial basis function (RBF) neural network architecture for the classification of multispectral very high spatial resolution satellite images into 13 classes of various scales. For the development of the RBF classifiers, the innovative fuzzy means training algorithm is utilized, which is based on a fuzzy partition of the input space. The method requires only a short amount of time to select both the structure and the parameters of the RBF classifier. The new technique was applied to the area of Lake Kerkini, which is a wetland of great ecological value, located in northern Greece. Eleven experiments were carried out in total in order to investigate the performance of the classifier using different input parameters (spectral and textural) as well as different window sizes and neural network complexities. For comparison purposes the same satellite scene was classified using the maximum likelihood (MLH) classification with the same set of training samples. Overall, the neural network classifiers outperformed the MLH classification by 10–17%, reaching a maximum overall accuracy of 78%. Analysis showed that the selection of input parameters is vital for the success of the classifiers. On the other hand, the incorporation of textural analysis and/or modification of the window size do not affect the performance substantially.     

一种粗糙小波网络分类器及应用

提出了一种粗糙小波网络分类器的模型。其过程为:利用粗糙集理论获取分类知识,根据训练样本属性值离散化、属性约简和值约简来构造粗糙小波网络分类器。该分类器可以有效地克服粗糙集规则匹配方法抗噪声能力和规则泛化能力差的缺点;同时可简化小波网络的结构,加快网络的训练速度。并详细介绍了该分类器用于入侵数据识别的步骤和仿真实验结果。     

基于可分性判据排序的RBF神经网络属性选择方法

提出一种基于数据属性重要性排序的神经网络属性选择方法，该方法只需对部分属性进行洲练，即可进行降维，它克服了现有的神经网络降维方法必须对全部属性进行训练的弊端，大大提高了属性选择的效率。该方法先用本文提出的一种简单的可分性判据方法对数据属性进行重要性排序，然后按重要次序用RBF神经网络进行属性选择。仿真实例表明，该方法具有良好的效果。     

约束高斯分类网研究

针对基于一元高斯函数估计属性边缘密度的朴素贝叶斯分类器不能有效利 用属性之间的依赖信息和使用多元高斯函数估计属性联合密度的完全贝叶斯分类器 易于导致对数据的过度拟合而且高阶协方差矩阵的计算也非常困难等情况,在建立 属性联合密度分解与组合定理和属性条件密度计算定理的基础上,将朴素贝叶斯分类 器的属性选择、分类准确性标准和属性父结点的贪婪选择相结合,进行约束高斯 分类网学习与优化,并依据贝叶斯网络理论,对贝叶斯衍生分类器中属性为类提供 的信息构成进行分析.使用UCI数据库中连续属性分类数据进行实验,结果显示,经过 优化的约束高斯分类网具有良好的分类准确性.     

基于属性加权的朴素贝叶斯分类算法改进

朴素贝叶斯分类是一种简单而高效的方法,但是它的属性独立性假设,影响了它的分类性能。针对这种问题,本文提出一种基于属性加权的朴素贝叶斯分类算法。通过分析研究属性之间的相关性,求出条件属性与决策属性的相关系数,同时结合信息论中所涉及的互信息概念,获得新的权重,对不同的条件属性给予不同的权值,从而在保持简单性的基础上有效地提高了朴素贝叶斯算法的分类性能。实验结果表明,该方法可行而且有效。     

一种限定性的双层贝叶斯分类模型

朴素贝叶斯分类模型是一种简单而有效的分类方法,但它的属性独立性假设使其无法表达属性变量间存在的依赖关系,影响了它的分类性能.通过分析贝叶斯分类模型的分类原则以及贝叶斯定理的变异形式,提出了一种基于贝叶斯定理的新的分类模型DLBAN(double-level Bayesian network augmented naive Bayes).该模型通过选择关键属性建立属性之间的依赖关系.将该分类方法与朴素贝叶斯分类器和TAN(tree augmented naive Bayes)分类器进行实验比较.实验结果表明,在大多数数据集上,DLBAN分类方法具有较高的分类正确率.     

An enhanced swarm intelligence clustering-based RBFNN classifier and its application in deep Web sources classification

The central problem in training a radial basis function neural network (RBFNN) is the selection of hidden layer neurons, which includes the selection of the center and width of those neurons. In this paper, we propose an enhanced swarm intelligence clustering (ESIC) method to select hidden layer neurons, and then, train a cosine RBFNN based on the gradient descent learning process. Also, we apply this new method for classification of deep Web sources. Experimental results show that the average Precision, Recall and F of our ESIC-based RBFNN classifier achieve higher performance than BP, Support Vector Machines (SVM) and OLS RBF for our deep Web sources classification problems.     

An enhanced swarm intelligence clustering-based RBFNN classifier and its application in deep Web sources classification

The central problem in training a radial basis function neural network (RBFNN) is the selection of hidden layer neurons, which includes the selection of the center and width of those neurons. In this paper, we propose an enhanced swarm intelligence clustering (ESIC) method to select hidden layer neurons, and then, train a cosine RBFNN based on the gradient descent learning process. Also, we apply this new method for classification of deep Web sources. Experimental results show that the average Precision, Recall and F of our ESIC-based RBFNN classifier achieve higher performance than BP, Support Vector Machines (SVM) and OLS RBF for our deep Web sources classification problems.     

基于径向基函数神经网络的网络流量识别模型

提出了一种基于径向基函数神经网络的网络流量识别方法。根据实际网络中的流量数据,建立了一个基于RBF神经网络的流量识别模型。先介绍了RBF神经网络的结构设计及学习算法,针对RBF神经网络在隐节点过多的情况下算法过于复杂的缺点,采用了优化的算法计算隐含层节点。仿真实验证明,该模型具有较好的准确率、低复杂度、高识别效果和良好的自适应性。     

Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking

This paper deals with the problem of supervised wrapper-based feature subset selection in datasets with a very large number of attributes. Recently the literature has contained numerous references to the use of hybrid selection algorithms: based on a filter ranking, they perform an incremental wrapper selection over that ranking. Though working fine, these methods still have their problems: (1) depending on the complexity of the wrapper search method, the number of wrapper evaluations can still be too large; and (2) they rely on a univariate ranking that does not take into account interaction between the variables already included in the selected subset and the remaining ones.Here we propose a new approach whose main goal is to drastically reduce the number of wrapper evaluations while maintaining good performance (e.g. accuracy and size of the obtained subset). To do this we propose an algorithm that iteratively alternates between filter ranking construction and wrapper feature subset selection (FSS). Thus, the FSS only uses the first block of ranked attributes and the ranking method uses the current selected subset in order to build a new ranking where this knowledge is considered. The algorithm terminates when no new attribute is selected in the last call to the FSS algorithm. The main advantage of this approach is that only a few blocks of variables are analyzed, and so the number of wrapper evaluations decreases drastically.The proposed method is tested over eleven high-dimensional datasets (2400-46,000 variables) using different classifiers. The results show an impressive reduction in the number of wrapper evaluations without degrading the quality of the obtained subset.     

Cloud basis function neural network: A modified RBF network architecture for holistic facial expression recognition

The paper presents novel modifications to radial basis functions (RBFs) and a neural network based classifier for holistic recognition of the six universal facial expressions from static images. The new basis functions, called cloud basis functions (CBFs) use a different feature weighting, derived to emphasize features relevant to class discrimination. Further, these basis functions are designed to have multiple boundary segments, rather than a single boundary as for RBFs. These new enhancements to the basis functions along with a suitable training algorithm allow the neural network to better learn the specific properties of the problem domain. The proposed classifiers have demonstrated superior performance compared to conventional RBF neural networks as well as several other types of holistic techniques used in conjunction with RBF neural networks. The CBF neural network based classifier yielded an accuracy of 96.1%, compared to 86.6%, the best accuracy obtained from all other conventional RBF neural network based classification schemes tested using the same database.     

具有多峰正态分布属性的视频语义分类研究

视频语义分类中常遇到多峰正态分布属性,如采用单峰值正态分布设计的贝叶斯分类模型会造成较大分类误差。本文采用定步长组合划分算（FLCPA）对多峰分布属性值域按类进行划分,以留一校验法（LOOCV）估算分类错误,找出给定步长下属性的多峰分布边界点,并用监督参数估计推断出每个分段区间上的概率分布函数,从而得到整个值域上的总体分布。此外,文中给出了涉及多峰分布属性的视频语义分类器设计步骤。实验数据表明,该方法能明显降低分类错误,有效提高分类性能。