Improving the performance of fuzzy classifier systems for patternclassification problems with continuous attributes

In this paper, various methods are introduced for improving the ability of fuzzy classifier systems to automatically generate fuzzy if-then rules for pattern classification problems with continuous attributes. First, we describe a simple fuzzy classifier system where a randomly generated initial population of fuzzy if-then rules is evolved by typical genetic operations, such as selection, crossover, and mutation. By computer simulations on a real-world pattern classification problem with many continuous attributes, we show that the search ability of such a simple fuzzy classifier system is not high. Next, we examine the search ability of a hybrid algorithm where a learning procedure of fuzzy if-then rules is combined with the fuzzy classifier system. Then, we introduce two heuristic procedures for improving the performance of the fuzzy classifier system. One is a heuristic rule generation procedure for an initial population where initial fuzzy if-then rules are directly generated from training patterns. The other is a heuristic population update procedure where new fuzzy if-then rules are generated from misclassified and rejected training patterns, as well as from existing fuzzy if-then rules by genetic operations. By computer simulations, we demonstrate that these two heuristic procedures drastically improve the search ability of the fuzzy classifier system. We also examine a variant of the fuzzy classifier system where the population size (i.e., the number of fuzzy if-then rules) varies depending on the classification performance of fuzzy if-then rules in the current population     

Speed-up fractal image compression with a fuzzy classifier

This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system.     

适用于组合特征识别的最近邻模糊分类器

在用多种特征进行简单的串联组合识别时,不同特征具有不同的特征类型和衡量尺寸,针对串联组合特征的这种特点,提出了一种最近邻模糊分类器.该分类器首先把待识别目标的组合特征与训练模板中的组合特征样本一一进行比较,从而得到了一个特征差矩阵.提出用模糊分布函数在同类特征差之间进行处理,生成一个隶属度矩阵,然后用算术平均法对隶属度矩阵进行处理,并用最大隶属度准则来进行分类判决.识别框架表明最近邻模糊分类器对组合特征中的各种不同特征的特征类型和衡量尺寸没有一致性要求,也无需对串联组合特征矢量做任何预处理.最后,用外场实测数据进行验证,结果表明,最近邻模糊分类器能够有效地解决多种特征串联组合的雷达目标识别问题.     

Evolving intuitionistic fuzzy priority classifier with bio-inspiration based scheduling scheme for WiMAX in vehicular ad-hoc networks

With the increase in user mobility the most challenging issues are data scheduling which premises its users high quality of service in the context of the interoperability for microwave access in WiMAX for vehicular ad-hoc network (VANET). There is no complete proof of existing techniques accessible to provide better quality as there is a starvation problem due to the uncertainty in decision process with imprecise data. In VANET for the sake of interest while vehicles started increasing more and more in network traffic this paper devised a two stage Optimized priority scheduling scheme known as Evolving Intuitionistic Fuzzy Priority Classifier with Bio-inspiration Based Scheduling Scheme. This work takes into account the hesitation degree of each factor for priority and the bio-inspiration based classification. Through our simulation, it is shown that the projected proposal can work to acclimatize and make competent to improve the existing VANET approaches in terms of high spectrum effectiveness and low outage probability.     

基于模糊分类器及多层前馈神经网络混合结构的说话人辨认

提出了基于模糊超椭球聚类算法的说话人辨认新方法。该算法首先将某一类的训练数据分成若干子类, 对每一子类在其中心周围定义具有超椭球区域的模糊规则。实验表明,该系统可以较快的聚类速度取得与HMM 相当的识别效果。进一步的研究表明,基于模糊超椭球聚类算法的说话人辨认系统与传统的基于HMM的识别方法存在一个共同的缺点,即抗噪性能较差。为此,通过引入多层前馈神经网络(MLFNN)与模糊超椭球分类器构成混合模型,使系统的识别性能和抗噪能力显著提高。     

A cost-effective semisupervised classifier approach with kernels

In this paper, we propose a cost-effective iterative semisupervised classifier based on a kernel concept. The proposed technique incorporates unlabeled data into the design of a binary classifier by introducing and optimizing a cost function in a feature space that maximizes the Rayleigh coefficient while minimizing the total cost associated with misclassified labeled samples. The cost assigned to misclassified labeled samples accounts for the number of misclassified labeled samples as well as the amount by which they are on the wrong side of the boundary, and this counterbalances any potential adverse effect of unlabeled data on the classifier performance. Several experiments performed with remotely sensed data demonstrate that using the proposed semisupervised classifier shows considerable improvements over the supervised-only counterpart.     

A non-parameter bayesian classifier for face recognition

A non-parameter Bayesian classifier based on Kernel Density Estimation (KDE) is presented for face recognition, which can be regarded as a weighted Nearest Neighbor (NN) classifier in formation. The class conditional density is estimated by KDE and the bandwidth of the kernel function is estimated by Expectation Maximum (EM) algorithm. Two subspace analysis methods-linear Principal Component Analysis (PCA) and Kernel-based PCA (KPCA) are respectively used to extract features, and the proposed method is compared with Probabilistic Reasoning Models (PRM), Nearest Center (NC) and NN classifiers which are widely used in face recognition systems. The experiments are performed on two benchmarks an.el the experimental results show that the KDE outperforms PRM, NC and NN classifiers.     

A global optimization technique for statistical classifier design

A global optimization method is introduced that minimize the rate of misclassification. We first derive the theoretical basis for the method, on which we base the development of a novel design algorithm and demonstrate its effectiveness and superior performance in the design of practical classifiers for some of the most popular structures currently in use. The method, grounded in ideas from statistical physics and information theory, extends the deterministic annealing approach for optimization, both to incorporate structural constraints on data assignments to classes and to minimize the probability of error as the cost objective. During the design, data are assigned to classes in probability so as to minimize the expected classification error given a specified level of randomness, as measured by Shannon's entropy. The constrained optimization is equivalent to a free-energy minimization, motivating a deterministic annealing approach in which the entropy and expected misclassification cost are reduced with the temperature while enforcing the classifier's structure. In the limit, a hard classifier is obtained. This approach is applicable to a variety of classifier structures, including the widely used prototype-based, radial basis function, and multilayer perceptron classifiers. The method is compared with learning vector quantization, back propagation (BP), several radial basis function design techniques, as well as with paradigms for more directly optimizing all these structures to minimize probability of error. The annealing method achieves significant performance gains over other design methods on a number of benchmark examples from the literature, while often retaining design complexity comparable with or only moderately greater than that of strict descent methods. Substantial gains, both inside and outside the training set, are achieved for complicated examples involving high-dimensional data and large class overlap     

利用新的模糊免疫分类器的评价模型设计

随着Web服务数量的增加,根据Web服务的多维Qos属性度量Web服务质量成为研究热点之一。提出了一种利用模糊免疫网络记忆分类器的Web服务Qos评价。在该评价中首先结合SOA中Web服务描述给出了Web服务QoS评价模型。然后提出了一种新的人工免疫分类算法——FAINMC,利用该算法利用该算法对大量的Web服务实现准确、高效的分类。通过每类记忆细胞反应的特征得到相对应服务等级,最后使用模糊隶属度和百分法得到了反应Web服务质量优劣评价值。通过原型系统对模拟Web服务属性数据进行测试,表明该方法优选出QoS值尽可能大,QoS向量分量的特征分量一致性好的Web服务。     

A computer-aided diagnosis for locating abnormalities in bone scintigraphy by a fuzzy system with a three-step minimization approach

Bone scintigraphy is an effective method to diagnose bone diseases such as bone tumors. In the scintigraphic images, bone abnormalities are widely scattered on the whole body. Conventionally, radiologists visually check the whole-body images and find the distributed abnormalities based on their expertise. This manual process is time-consuming and it is not unusual to miss some abnormalities. In this paper, a computer-aided diagnosis (CAD) system is proposed to assist radiologists in the diagnosis of bone scintigraphy. The system will provide warning marks and abnormal scores on some locations of the images to direct radiologists' attention toward these locations. A fuzzy system called characteristic-point-based fuzzy inference system (CPFIS) is employed to implement the diagnosis system and three minimizations are used to systematically train the CPFIS. Asymmetry and brightness are chosen as the two inputs to the CPFIS according to radiologists' knowledge. The resulting CAD system is of a small-sized rule base such that the resulting fuzzy rules can be not only easily understood by radiologists, but also matched to and compared with their expert knowledge. The prototype CAD system was tested on 82 abnormal images and 27 normal images. We employed free-response receiver operating characteristics method with the mean number of false positives (FPs) and the sensitivity as performance indexes to evaluate the proposed system. The sensitivity is 91.5% (227 of 248) and the mean number of FPs is 37.3 per image. The high sensitivity and moderate numbers of FP marks per image shows that the proposed method can provide an effective second-reader information to radiologists in the diagnosis of bone scintigraphy.     

A charge-based neural Hamming classifier

A charge-based fixed-weight neural Hamming classifier with an on-chip normalization facility is described. The classifier utilizes a purely capacitive synapse matrix for quantization and a multiport sense amplifier for discrimination. The discriminator is compatible with variable-weight synapses as well. A detailed analysis of the classifier configuration is presented; design issues are addressed, and limitations are identified. It is shown that the ratio of the maximum Hamming weight to the minimum Hamming distance that can be handled by the classifier has an upper bound. As long as the exemplars comply with this upper bound, the network does not impose any limitation on the word length. A very large exemplar count, on the other hand, can impair connection density, but this problem can be averted by using multiple discriminators. A 2-μm p-well CMOS test chip containing a Hamming classifier of ten 20-b-long exemplars is described     

A two-layered fuzzy logic controller for systems with deadzones

Existing fuzzy control methods do not perform well when applied to systems containing nonlinearities arising from unknown deadzones. In particular, we show that a usual "fuzzy PD" controller applied to a system with a deadzone suffers from poor transient performance and a large steady-state error. In this paper, we propose a novel two-layered fuzzy logic controller for controlling systems with deadzones. The two-layered control structure consists of a fuzzy logic-based precompensator followed by a usual fuzzy PD controller. Our proposed controller exhibits superior transient and steady-state performance compared to usual fuzzy PD controllers. In addition, the controller is robust to variations in deadzone nonlinearities. We illustrate the effectiveness of our scheme using computer simulation examples.<>     

The ternary decision tree: A multistage classifier with reject

We present in this paper a decision tree with a reject option at each node we call a ternary decision tree; principle of its achievement is defined and a new classification rule of extension of the classical k nearest neighbor one is proposed. This method has been applied for the monitoring of the heart of a fast breeder reactor by using the neutronic signal.     

Mixing high-dimensional features for JPEG steganalysis with ensemble classifier

This paper proposes a JPEG steganalysis scheme based on the ensemble classifier and high-dimensional feature space. We first combine three current feature sets and remove the unimportant features according to the correlation between different features parts so as to form a new feature space used for steganalysis. This way, the dependencies among cover and steganographic images can be still represented by the features with a reduced dimensionality. Furthermore, we design a proportion mechanism to manage the feature selection in two subspaces for each base learner of the ensemble classifier. Experimental results show that the proposed scheme can effectively defeat the MB and nsF5 steganographic methods and its performance is better than that of existing steganalysis approaches.     

A distributed evolutionary classifier for knowledge discovery in data mining

This paper presents a distributed coevolutionary classifier (DCC) for extracting comprehensible rules in data mining. It allows different species to be evolved cooperatively and simultaneously, while the computational workload is shared among multiple computers over the Internet. Through the intercommunications among different species of rules and rule sets in a distributed manner, the concurrent processing and computational speed of the coevolutionary classifiers are enhanced. The advantage and performance of the proposed DCC are validated upon various datasets obtained from the UCI machine learning repository. It is shown that the predicting accuracy of DCC is robust and the computation time is reduced as the number of remote engines increases. Comparison results illustrate that the DCC produces good classification rules for the datasets, which are competitive as compared to existing classifiers in literature.     

A new diagnosis approach for handling tolerance in analog and mixed-signal circuits by using fuzzy math

A novel analysis method for analog circuits test and diagnosis is described in this paper. Diagnosis hypotheses are represented and fuzzy math is used to express the diagnosis hypotheses and strategy. Based on it, new equivalent fault model is presented and used for test node selection and design for test. Especially, parametric fault test for linear analog circuits with tolerance analysis is presented using both sensitivity method and fuzzy analysis method.     

Pitch detection with a neural-net classifier

Pitch detection based on neural-net classifiers is investigated. To this end, the extent of generalization attainable with neural nets is examined, and the choice of features is discussed. For pitch detection, two feature sets, one based on waveform samples and the other based on properties of waveform peaks, are introduced. Experiments with neural classifiers demonstrate that the latter feature set, which has better invariance properties, performs more successfully. It is found that the best neural-net pitch tracker approaches the level of agreement of human labellers on the same data set, and performs competitively in comparison to a sophisticated feature-based tracker. An analysis of the errors committed by the neural net (relative to the hand labels used for training) reveals that they are mostly due to inconsistent hand labeling of ambiguous waveform peaks     

Multiple classifier systems for supervised remote sensing imageclassification based on dynamic classifier selection

In the literature, multiple classifier systems (MCSs) have proved to be a valuable approach to combining classifiers, and under some conditions MCSs are able to mimic ideal Bayesian labeling. This paper focuses on the family of MCSs based on dynamic classifier selection (DCS) and proposes a modification to dynamic classifier selection by local accuracy (DCS-LA). Experiments show that the proposed method outperform MCS strategies based on belief functions and the DCS-LA in terms of minimum and maximum class accuracies and kappa coefficient of agreement and is a valid alternative to majority voting. Moreover, the experiments show that MCSs based on the classification results of classifiers characterized by a low design complexity like maximum likelihood and nearest mean classifiers can yield accuracies that are quite comparable to those of highly optimized classifiers     

A shape- and texture-based enhanced Fisher classifier for face recognition.

This paper introduces a new face coding and recognition method, the enhanced Fisher classifier (EFC), which employs the enhanced Fisher linear discriminant model (EFM) on integrated shape and texture features. Shape encodes the feature geometry of a face while texture provides a normalized shape-free image. The dimensionalities of the shape and the texture spaces are first reduced using principal component analysis, constrained by the EFM for enhanced generalization. The corresponding reduced shape and texture features are then combined through a normalization procedure to form the integrated features that are processed by the EFM for face recognition. Experimental results, using 600 face images corresponding to 200 subjects of varying illumination and facial expressions, show that (1) the integrated shape and texture features carry the most discriminating information followed in order by textures, masked images, and shape images, and (2) the new coding and face recognition method, EFC, performs the best among the eigenfaces method using L(1) or L(2) distance measure, and the Mahalanobis distance classifiers using a common covariance matrix for all classes or a pooled within-class covariance matrix. In particular, EFC achieves 98.5% recognition accuracy using only 25 features.     

基于模糊分类器的能量可变噪声环境下的词边界检测

词边界检测误差是语音识别中产生错误的主要原因之一，常规的检测算法在低信噪比尤其在背景噪声能量可变的环境下不能有效工作。文中用语音信号的精确时频参数和过零率来训练模糊神经分类器，进行词边界检测。在不同背景噪声下的实验结果表明，该方法可适应背景噪声能量的变化，得到高正确率的词边界检测。