Search

The objective of this paper is to simulate the algorithm to detect object for Automated Guide Vehicle (AGV) guidance problem, namely to obstacle avoidance. Currently, the AGV is a transport vehicle widely used in manufacturing factories and plays an important role in the design of material handling system, moving goods to raw materials or finished product to rightful destination that work automatically. This method has been designed for use in security of internal transportation system in order to prevent a collision to the AGVs and the obstacles, which do not know the exact shape, size and color. Such real-time obstacle detection was crucial, we need to classify the obstacles that are real obstacles or fake obstacles. The computer vision with artificial neural networks (ANN) can help the AGV can see and recognize like a human by imitating the functions of the human brain. In this paper, we proposed an algorithm for detecting obstacle that work automatically with no human is required. The algorithm is divided in to two parts: First, a preliminary feature extraction stage by using the Histograms of Oriented Gradients (HOG) to extract height objects feature from the actual video images. Second, the recognition and classification of the obstacles that are real obstacles or fake obstacles such as a painting or text on the floor by a feed-forward time delay neural network (TDNN) in sequences of black and white video images taken by an on-board camera, then decide whether to hold or continue to be moved. As a result, this paper presents the simulate the algorithm to detect the obstacles for AGV, which can work to destination are defined and avoided obstacles by computer vision with TDNN as an alternative principle with high accuracy and reliability. [ABSTRACT FROM AUTHOR]

Abstract: This paper shows the determination of typical load profiles (TLPs) by using Fuzzy C-Means (FCM) clustering and Probability Neural Network (PNN) classification method. Load profiles provide useful information on electricity consumption to both consumers and suppliers. Precise knowledge on consumer''s electricity consumption becomes essential for the suppliers to design tariffs, load balancing, load planning, etc. As for consumers, such knowledge is important for them to keep track of their electricity consumption and to enable them to take part in retail market especially for those who do not have appropriate metering equipment. Hence, an effective, fast and cheap method to obtain load profile has to be developed. Objectives of this paper are to obtain groups of TLPs by using FCM clustering and to assign TLPs using PNN algorithm. One of the main issues in FCM clustering is the determination of optimal number of cluster. This paper proposes optimal number of cluster determination by using Davies-Bouldin index. PNN network is trained to directly allocate the TLPs to the representative groups of consumers. The data used in this project are obtained from Tenaga Nasional Berhad (TNB). [Copyright &y& Elsevier]

Abstract In streaming data classification, most of the existing methods assume that all arrived evolving data are completely labeled. One challenge is that some applications where only small amount of labeled examples are available for training. Incremental semi-supervised learning algorithms have been proposed for regularizing neural networks by incorporating various side information, such as pairwise constraints or user-provided labels. However, it is hard to put them into practice, especially for non-stationary environments due to the effectiveness and parameter sensitivity of such algorithms. In this paper, we propose a novel incremental semi-supervised learning framework on streaming data. Each layer of model is comprised of a generative network, a discriminant structure and the bridge. The generative network uses dynamic feature learning based on autoencoders to learn generative features from streaming data which has been demonstrated its potential in learning latent feature representations. In addition, the discriminant structure regularizes the network construction via building pairwise similarity and dissimilarity constraints. It is also used for facilitating the parameter learning of the generative network. The network and structure are integrated into a joint learning framework and bridged by enforcing the correlation of their parameters, which balances the flexible incorporation of supervision information and numerical tractability for non-stationary environments as well as explores the intrinsic data structure. Moreover, an efficient algorithm is designed to solve the proposed optimization problem and we also give an ensemble method. Particularly, when multiple layers of model are stacked, the performance is significantly boosted. Finally, to validate the effectiveness of the proposed method, extensive experiments are conducted on synthetic and real-life datasets. The experimental results demonstrate that the performance of the proposed algorithms is superior to some state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Abstract: Self-adaptation is an inherent part of any natural and intelligent system. Specifically, it is about the ability of a system to reconcile its requirements or goal of existence with the environment it is interacting with, by adopting an optimal behavior. Self-adaptation becomes crucial when the environment changes dynamically over time. In this paper, we investigate self-adaptation of classification systems at three levels: (1) natural adaptation of the base learners to change in the environment, (2) contributive adaptation when combining the base learners in an ensemble, and (3) structural adaptation of the combination as a form of dynamic ensemble. The present study focuses on neural network classification systems to handle a special facet of self-adaptation, that is, incremental learning (IL). With IL, the system self-adjusts to accommodate new and possibly non-stationary data samples arriving over time. The paper discusses various IL algorithms and shows how the three adaptation levels are inherent in the system''s architecture proposed and how this architecture is efficient in dealing with dynamic change in the presence of various types of data drift when applying these IL algorithms. [Copyright &y& Elsevier]

Abstract: This paper describes a novel binary classification method named LASCUS that can be applied to uneven datasets and sensitive problems such as malfunction detection. Such method aims at filling the gap left by traditional algorithms which have difficulties when coping with unbalanced datasets and are not able to satisfactorily recognize unfrequent patterns. The proposed method is based on the use of a self organizing map (SOM) and of a fuzzy inference system (FIS). The SOM creates a set of clusters to be associated either to frequent or unfrequent situations while the FIS determines such association on the basis of data distribution. The method has been tested on the widely used benchmarking Wisconsin breast cancer database and on two industrial applications. The obtained results, which are discussed in the paper, are encouraging and in line with expectations. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a novel soft cluster neural network technique for the classification of suspicious areas in digital mammograms. The technique introduces the concept of soft clusters within a neural network layer and combines them with least squares for optimising neural network weights. The idea of soft clusters is proposed in order to increase the generalisation ability of the neural network by providing a mechanism to more aptly depict the relationship between the input features and the subsequent classification as either a benign or malignant class. Soft clusters with least squares make the training process faster and avoid iterative processes which have many problems. The proposed neural network technique has been tested on the DDSM benchmark database. The results are analysed and discussed in this paper. [Copyright &y& Elsevier]

Abstract: Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitable for classification of large data sets, because the training complexity of SVM is highly dependent on the size of data set. This paper presents a novel SVM classification approach for large data sets by using minimum enclosing ball clustering. After the training data are partitioned by the proposed clustering method, the centers of the clusters are used for the first time SVM classification. Then we use the clusters whose centers are support vectors or those clusters which have different classes to perform the second time SVM classification. In this stage most data are removed. Several experimental results show that the approach proposed in this paper has good classification accuracy compared with classic SVM while the training is significantly faster than several other SVM classifiers. [Copyright &y& Elsevier]

This paper investigates the construction of sparse radial basis function neural networks (RBFNNs) for classification problems. An efficient two-phase construction algorithm (which is abbreviated as TPCLR 1 for simplicity) is proposed by using L 1 regularization. In the first phase, an improved maximum data coverage (IMDC) algorithm is presented for the initialization of RBF centers and widths. Then a specialized Orthant-Wise Limited-memory Quasi-Newton (sOWL-QN) method is employed to perform simultaneous network pruning and parameter optimization in the second phase. The advantages of TPCLR 1 lie in that better generalization performance is guaranteed with higher model sparsity, and the required storage space and testing time are much reduced. Besides these, only the regularization parameter and the maximum number of function evaluations are required to be prescribed, then the entire construction procedure becomes automatic. The learning algorithm is verified by several classification benchmarks with different levels of complexity. The experimental results show that an appropriate value of the regularization parameter is easy to find without using costly cross validation, and the proposed TPCLR 1 offers an efficient procedure to construct sparse RBFNN classifiers with good generalization performance. [ABSTRACT FROM AUTHOR]

Relocation is one of the most common problems in Simultaneous Localization and Mapping (SLAM). This paper presents a novel relocation method, using unsupervised deep learning algorithm to extract the feature of Light Detection and Ranging (LiDAR) data, and narrows the scope of relocation by classifying these features to reduce the randomness of the relocation. Compared with the other methods which is based on matching the manual feature points, this method avoids some limitations of manual features. We modify the Particle Filter SLAM (PF-SLAM), and use our relocation method to replace the original method for experimentation. The experimental results demonstrate that this method can be relocation whit high success rate only use a small amount of computational resource in a short time. Training neural network will consume a lot of computing resources, we also propose a cloud computing framework to the implementation of this method for the mobile robot which computational resources are limited. [ABSTRACT FROM AUTHOR]

This paper presents a competitive co-evolutionary (ComCoE) that engages a double elimination tournament (DET) to evolve artificial neural networks (ANNs) for undertaking data classification problems. The proposed model performs a global search by a ComCoE approach to find near optimal solutions. During the global search process, two populations of different ANNs compete and fitness evaluation of each ANN is made in a subjective manner based on their participations throughout a DET which promotes competitive interactions among individual ANNs. The adaptation and fitness evaluation processes drive the global search for a more competent ANN classifier. A winning ANN is identified from the global search. Then, the Scaled Conjugate Backpropagation algorithm, which is a local search, is performed to further train the winning ANN to obtain a precise solution. The performance of the proposed classification model is evaluated rigorously; its performance is compared with the baseline ANNs of the proposed model as well as other classifiers. The results indicate that the proposed model could construct an ANN which could produce high classification accuracy rates with a compact network structure. [ABSTRACT FROM AUTHOR]

Classification of experimental datasets such as target and clutter in sonar applications is a complex and challenging problem. One of the most useful instrument to classify sonar datasets is Multi-Layer Perceptron Neural Network (MLP NN). In this paper, due to the optimally updating the weights and biases vector of the MLP NN, Biogeography-Based Optimization (BBO) is used to train the network. BBO has a fair ability to solve high-dimensional real-world problems (such as sonar dataset classification) by maintaining a suitable balance between exploration and exploitation phases. The performance of BBO is sensitive to the migration model, especially for high-dimensional problems. To improve the exploitation ability of BBO and to record the better results for classifying sonar dataset, we propose novel migration models such as exponential-logarithmic, and some improved migration models having different emigration and immigration mathematical functions. To validate the performance of the proposed classifiers, this network will classify three datasets with various sizes and complexities. The simulation results indicate that our newly proposed classifiers perform better than the other benchmark algorithms in addition to original BBO in terms of avoiding gets stuck in local minima, classification accuracy, and convergence speed. [ABSTRACT FROM AUTHOR]

It has been known that one of the important steps in training a complex-valued radial basis function neural network is to effectively determine its centers and widths of neurons in the hidden layer. In this paper, an improved maximum spread algorithm is propose to solve this issue. Its basic idea is that the choice of centers not only depends on the distances between samples from different classes, but also is heavily affected by the average distance between samples in the same class. The relationship between external and inner distances is taken into account when determining centers. The performance of this algorithm is tested on several datasets. It is shown that much better performance can be achieved by the developed algorithm than by some existing ones. [ABSTRACT FROM AUTHOR]

The accuracy of classification and regression tasks based on data driven models, such as Neural Networks or Support Vector Machines, relies to a good extent on selecting proper data for designing these models, covering the whole input range in which they will be employed. The convex hull algorithm can be applied as a method for data selection; however the use of conventional implementations of this method in high dimensions, due to its high complexity, is not feasible. In this paper, we propose a randomized approximation convex hull algorithm which can be used for high dimensions in an acceptable execution time, and with low memory requirements. Simulation results show that data selection by the proposed algorithm (coined as ApproxHull) can improve the performance of classification and regression models, in comparison with random data selection. [ABSTRACT FROM AUTHOR]

There has been some improvement in the treatment of preterm infants, which has helped to increase their chance of survival. However, the rate of premature births is still globally increasing. As a result, this group of infants is most at risk of developing severe medical conditions that can affect the respiratory, gastrointestinal, immune, central nervous, auditory and visual systems. There is a strong body of evidence emerging that suggests the analysis of uterine electrical signals, from the abdominal surface (Electrohysterography – EHG), could provide a viable way of diagnosing true labour and even predict preterm deliveries. This paper explores this idea further and presents a new dynamic self-organized network immune algorithm that classifies term and preterm records, using an open dataset containing 300 records (38 preterm and 262 term ). Using the dataset, oversampling and cross validation techniques are evaluated against other similar studies. The proposed approach shows an improvement on existing studies with 89% sensitivity , 91% specificity , 90% positive predicted value , 90% negative predicted value , and an overall accuracy of 90%. [ABSTRACT FROM AUTHOR]

This article deals with classification problems involving unequal probabilities in each class and discusses metrics to systems that use multilayer perceptrons neural networks (MLP) for the task of classifying new patterns. In addition we propose three new pruning methods that were compared to other seven existing methods in the literature for MLP networks. All pruning algorithms presented in this paper have been modified by the authors to do pruning of neurons, in order to produce fully connected MLP networks but being small in its intermediary layer. Experiments were carried out involving the E. coli unbalanced classification problem and ten pruning methods. The proposed methods had obtained good results, actually, better results than another pruning methods previously defined at the MLP neural network area. [ABSTRACT FROM AUTHOR]

Abstract: Individuals from Pittsburgh rule-based classifiers represent a complete solution to the classification problem and each individual is a variable-length set of rules. Therefore, these systems usually demand a high level of computational resources and run-time, which increases as the complexity and the size of the data sets. It is known that this computational cost is mainly due to the recurring evaluation process of the rules and the individuals as rule sets. In this paper we propose a parallel evaluation model of rules and rule sets on GPUs based on the NVIDIA CUDA programming model which significantly allows reducing the run-time and speeding up the algorithm. The results obtained from the experimental study support the great efficiency and high performance of the GPU model, which is scalable to multiple GPU devices. The GPU model achieves a rule interpreter performance of up to 64 billion operations per second and the evaluation of the individuals is speeded up of up to 3.461×when compared to the CPU model. This provides a significant advantage of the GPU model, especially addressing large and complex problems within reasonable time, where the CPU run-time is not acceptable. [Copyright &y& Elsevier]

Abstract: Feature selection and classification techniques have been studied independently without considering the interaction between both procedures, which leads to a degraded performance. In this paper, we present a new neural network approach, which is called an algorithm learning based neural network (ALBNN), to improve classification accuracy by integrating feature selection and classification procedures. In general, a knowledge-based artificial neural network operates on prior knowledge from domain experience, which provides it with better starting points for the target function and leads to better classification accuracy. However, prior knowledge is usually difficult to identify. Instead of using unknown background resources, the proposed method utilizes prior knowledge that is mathematically calculated from the properties of other learning algorithms such as PCA, LARS, C4.5, and SVM. We employ the extreme learning machine in this study to help obtain better initial points faster and avoid irrelevant time-consuming work, such as determining architecture and manual tuning. ALBNN correctly approximates a target hypothesis by both considering the interaction between two procedures and minimizing individual procedure errors. The approach produces new relevant features and improves the classification accuracy. Experimental results exhibit improved performance in various classification problems. ALBNN can be applied to various fields requiring high classification accuracy. [Copyright &y& Elsevier]

Classification of breast abnormalities such as masses is a challenging task for radiologists. Computer-aided Diagnosis (CADx) technology may enhance the performance of radiologists by assisting them in classifying patterns into benign and malignant categories. Although Neural Networks (NN) such as Multilayer Perceptron (MLP) have drawbacks, namely long training times, a considerable number of CADx systems employ NN-based classifiers. The reason being that they provide high accuracy when they are appropriately trained. In this paper, we introduce three novel learning rules called Opposite Weight Back Propagation per Pattern (OWBPP), Opposite Weight Back Propagation per Epoch (OWBPE), and Opposite Weight Back Propagation per Pattern in Initialization (OWBPI) to accelerate the training procedure of an MLP classifier. We then develop CADx systems for the diagnosis of breast masses employing the traditional Back Propagation (BP), OWBPP, OWBPE and OWBPI algorithms on MLP classifiers. We quantitatively analyze the accuracy and convergence rate of each system. The results suggest that the convergence rate of the proposed OWBPE algorithm is more than 4 times faster than that of the traditional BP. Moreover, the CADx systems which use OWBPE classifier on average yield an area under Receiver Operating Characteristic (ROC), i.e. Az, of 0.928, a False Negative Rate (FNR) of 9.9% and a False Positive Rate (FPR) of 11.94%. [ABSTRACT FROM AUTHOR]

Abstract: This paper explores the use of ALOS (Advanced Land Observing Satellite) PALSARL-band (Phased Array type L-band Synthetic Aperture Radar) and RADARSAT-2 C-band data for land-cover classification in a tropical moist region. Transformed divergence was used to identify potential textural images which were calculated with the gray-level co-occurrence matrix method. The standard deviation of selected textural images and correlation coefficients between them were then used to determine the best combination of texture images for land-cover classification. Classification results based on different scenarios with maximum likelihood classifier were compared. Based on the identified best scenarios, different classification algorithms – maximum likelihood classifier, classification tree analysis, Fuzzy ARTMAP (a neural-network method), k-nearest neighbor, object-based classification, and support vector machine were compared for examining which algorithm was suitable for land-cover classification in the tropical moist region. This research indicates that the combination of radiometric images and their textures provided considerably better classification accuracies than individual datasets. The L-band data provided much better land-cover classification than C-band data but neither L-band nor C-band was suitable for fine land-cover classification system, no matter which classification algorithm was used. L-band data provided reasonably good classification accuracies for coarse land-cover classification system such as forest, succession, agropasture, water, wetland, and urban with an overall classification accuracy of 72.2%, but C-band data provided only 54.7%. Compared to the maximum likelihood classifier, both classification tree analysis and Fuzzy ARTMAP provided better performances, object-based classification and support vector machine had similar performances, and k-nearest neighbor performed poorly. More research should address the use of multitemporal radar data and the integration of radar and optical sensor data for improving land-cover classification. [Copyright &y& Elsevier]

Abstract: This paper presents a rule-based approach for the classification of power quality disturbances. The disturbed signal is first characterized using the multi-resolution S-transform, which acts as a feature extraction tool. Then, a simple but robust rule-based classification algorithm is used to identify disturbances. This algorithm uses linear and parabolic rules as pattern classifiers where decision boundaries are established by a heuristic search. The classification algorithm has a modular structure where each module works separately to detect specific disturbances. The most common types of disturbances, including sags, interruptions, swells, harmonics and oscillatory transients, were analyzed. Moreover, complex disturbances consisting of combinations of two simple events (simultaneous or consecutive in the same interval) were also analyzed. In both cases, noise, ranging from 40 to 20dB, was also considered. The tested data set contains power quality signals obtained using mathematical models, power quality events obtained from power network''s simulations using PSCAD/EMTDC and measured signals at electrical installations. Finally, evaluation results verifying the accuracy of the proposed method are presented and compared to those obtained from a classification system based on an artificial neural network. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a sequential learning algorithm for a neural network classifier based on human meta-cognitive learning principles. The network, referred to as Meta-cognitive Neural Network (McNN). McNN has two components, namely the cognitive component and the meta-cognitive component. A radial basis function network is the fundamental building block of the cognitive component. The meta-cognitive component controls the learning process in the cognitive component by deciding what-to-learn, when-to-learn and how-to-learn. When a sample is presented at the cognitive component of McNN, the meta-cognitive component chooses the best learning strategy for the sample using estimated class label, maximum hinge error, confidence of classifier and class-wise significance. Also sample overlapping conditions are considered in growth strategy for proper initialization of new hidden neurons. The performance of McNN classifier is evaluated using a set of benchmark classification problems from the UCI machine learning repository and two practical problems, viz., the acoustic emission for signal classification and a mammogram data set for cancer classification. The statistical comparison clearly indicates the superior performance of McNN over reported results in the literature. [Copyright &y& Elsevier]

Abstract: Ensemble approaches to classification have attracted a great deal of interest recently. This paper presents a novel method for designing the neural network ensemble using coevolutionary algorithm. The bootstrap resampling procedure is employed to obtain different training subsets that are used to estimate different component networks of the ensemble. Then the cooperative coevolutionary algorithm is developed to optimize the ensemble model via the divide-and-cooperative mechanism. All component networks are coevolved in parallel in the scheme of interacting co-adapted subpopulations. The fitness of an individual from a particular subpopulation is assessed by associating it with the representatives from other subpopulations. In order to promote the cooperation of all component networks, the proposed method considers both the accuracy and the diversity among the component networks that are evaluated using the multi-objective Pareto optimality measure. A hybrid output-combination method is designed to determine the final ensemble output. Experimental results illustrate that the proposed method is able to obtain neural network ensemble models with better classification accuracy in comparison with currently popular ensemble algorithms. [Copyright &y& Elsevier]

Abstract: In this paper, we investigate the decision making ability of a fully complex-valued radial basis function (FC-RBF) network in solving real-valued classification problems. The FC-RBF classifier is a single hidden layer fully complex-valued neural network with a nonlinear input layer, a nonlinear hidden layer, and a linear output layer. The neurons in the input layer of the classifier employ the phase encoded transformation to map the input features from the Real domain to the Complex domain. The neurons in the hidden layer employ a fully complex-valued Gaussian-like activation function of the type of hyperbolic secant (sech). The classification ability of the classifier is first studied analytically and it is shown that the decision boundaries of the FC-RBF classifier are orthogonal to each other. Then, the performance of the FC-RBF classifier is studied experimentally using a set of real-valued benchmark problems and also a real-world problem. The study clearly indicates the superior classification ability of the FC-RBF classifier. [Copyright &y& Elsevier]

Abstract: In this paper we propose a new static, global, supervised, incremental and bottom-up discretization algorithm based on coefficient of dispersion and skewness of data range. It automates the discretization process by introducing the number of intervals and stopping criterion. The results obtained using this discretization algorithm show that the discretization scheme generated by the algorithm almost has minimum number of intervals and requires smallest discretization time. The feedforward neural network with conjugate gradient training algorithm is used to compute the accuracy of classification from the data discretized by this algorithm. The efficiency of the proposed algorithm is shown in terms of better discretization scheme and better accuracy of classification by implementing it on six different real data sets. [Copyright &y& Elsevier]

Abstract: This paper proposes a radial basis function neural network (RBFNN), called the -Gaussian RBFNN, that reproduces different radial basis functions (RBFs) by means of a real parameter . The architecture, weights and node topology are learnt through a hybrid algorithm (HA). In order to test the overall performance, an experimental study with sixteen data sets taken from the UCI repository is presented. The -Gaussian RBFNN was compared to RBFNNs with Gaussian, Cauchy and inverse multiquadratic RBFs in the hidden layer and to other probabilistic classifiers, including different RBFNN design methods, support vector machines (SVMs), a sparse classifier (sparse multinomial logistic regression, SMLR) and a non-sparse classifier (regularized multinomial logistic regression, RMLR). The results show that the -Gaussian model can be considered very competitive with the other classification methods. [Copyright &y& Elsevier]

Abstract: The management of atmospheric pollution using video is not yet widespread. However it is an efficient way to evaluate the polluting rejects coming from large industrial facilities when traditional captors are not usable. This paper presents a comparison of different classifiers for a monitoring system of polluting smokes. The data used in this work are stemming from a system of video analysis and signal processing. The database includes the pollution level of puffs of smoke defined by an expert. Six machine learning techniques are tested and compared to classify the puffs of smoke: k-nearest neighbour, naïve Bayes classifier, artificial neural network, decision tree, support vector machine and a fuzzy model. The parameters of each type of classifier are split into three categories: learned parameters, parameters determined by a first step of the experimentation, and parameters set by the programmer. We compare the results of the best classifier of each type depending on the size of the learning set. A part of the discussion concerns the robustness of the classifier facing the case where classes of interest are under-represented, as the high level of pollution in our data. [Copyright &y& Elsevier]

Abstract: This paper proposes image processing algorithms to recognize five types of white blood cells in peripheral blood automatically. First, a method based on Gram–Schmidt orthogonalization is proposed along with a snake algorithm to segment nucleus and cytoplasm of the cells. Then, a variety of features are extracted from the segmented regions. Next, most discriminative features are selected using a Sequential Forward Selection (SFS) algorithm and performances of two classifiers, Artificial Neural Network (ANN) and Support Vector Machine (SVM), are compared. The results demonstrate that the proposed methods are accurate and sufficiently fast to be used in hematological laboratories. [Copyright &y& Elsevier]

Abstract: Purpose: Extracting comprehensible classification rules is the most emphasized concept in data mining researches. In order to obtain accurate and comprehensible classification rules from databases, a new approach is proposed by combining advantages of artificial neural networks (ANN) and swarm intelligence. Method: Artificial neural networks (ANNs) are a group of very powerful tools applied to prediction, classification and clustering in different domains. The main disadvantage of this general purpose tool is the difficulties in its interpretability and comprehensibility. In order to eliminate these disadvantages, a novel approach is developed to uncover and decode the information hidden in the black-box structure of ANNs. Therefore, in this paper a study on knowledge extraction from trained ANNs for classification problems is carried out. The proposed approach makes use of particle swarm optimization (PSO) algorithm to transform the behaviors of trained ANNs into accurate and comprehensible classification rules. Particle swarm optimization with time varying inertia weight and acceleration coefficients is designed to explore the best attribute-value combination via optimizing ANN output function. Results: The weights hidden in trained ANNs turned into comprehensible classification rule set with higher testing accuracy rates compared to traditional rule based classifiers. [Copyright &y& Elsevier]

Abstract: A novel condensed polynomial neural network using particle swarm optimization (PSO) technique is proposed for the task of classification in this paper. In solving classification task classical algorithms such as polynomial neural network (PNN) and its variants need more computational time as the partial descriptions (PDs) grow over the training period layer-by-layer and make the network very complex. Unlike PNN the proposed network needs to generate the partial description for a single layer. The discrete PSO (DPSO) is used to select a relevant set of PDs as well as features with a hope to get better accuracy, which are in turn fed to the output neuron. The weights associated with the links from hidden to output neuron is optimized by PSO for continuous domain (CPSO). Performance of this model is compared with the results obtained from PNN. Simulation result shows that the performance of this model both in processing time and accuracy, is encouraging for harnessing its power in domain with large and complex data particularly in data mining area. [Copyright &y& Elsevier]

Abstract: This paper presents a procedure to add broader diversity at the beginning of the evolutionary process. It consists of creating two initial populations with different parameter settings, evolving them for a small number of generations, selecting the best individuals from each population in the same proportion and combining them to constitute a new initial population. At this point the main loop of an evolutionary algorithm is applied to the new population. The results show that our proposal considerably improves both the efficiency of previous methodologies and also, significantly, their efficacy in most of the data sets. We have carried out our experimentation on twelve data sets from the UCI repository and two complex real-world problems which differ in their number of instances, features and classes. [Copyright &y& Elsevier]

Abstract: In this paper, a Feature-Extraction Neuron-Fuzzy Classification Model (FENFCM) is proposed that enables the extraction of feature variables and provides the classification results. The proposed classification model synergistically integrates a standard fuzzy inference system and a neural network with supervised learning. The FENFCM automatically generates the fuzzy rules from the numerical data and triangular functions that are used as membership functions both in the feature extraction unit and in the inference unit. To adapt the proposed FENFCM, two modificatory algorithms are applied. First, we utilize Evolutionary Programming (EP) to determine the distribution of fuzzy sets for each feature variable of the feature extraction unit. Second, the Weight Revised Algorithm (WRA) is used to regulate the weight grade of the principal output node of the inference unit. Finally, the proposed FENFCM is validated using two benchmark data sets: the Wine database and the Iris database. Computer simulation results demonstrate that the proposed classification model can provide a sufficiently high classification rate in comparison with that of other models proposed in the literature. [Copyright &y& Elsevier]

Abstract: In this paper, a new hierarchical classification method based on the use of various types of AdaBoost classification algorithms is proposed for automatic classification of marble slab images according to their quality. At first, features are extracted using the sum and difference histograms method and, at the second stage, different versions of the AdaBoost algorithms are used as classifiers together with those extracted features in a proposed hierarchical fashion. Performance of the proposed method is compared against performances of different types of neural network classifiers and a support vector machine (SVM) classifier. Computational results show that the proposed hierarchical structure employing AdaBoost algorithms performs superior to neural networks and the SVM classifier for classifying marble slab images in our large and diversified data set. [ABSTRACT FROM AUTHOR]

Abstract: There are irrelevant features that are redundant or significantly degrade the learning accuracy in the real-world complex classification tasks. This paper presents a new hybrid learning algorithm based on a cooperative coevolutionary algorithm (Co-CEA) with dual populations for designing the radial basis function neural network (RBFNN) models with an explicit feature selection. This approach attempts to complete both the RBFNN construction and the feature selection simultaneously. The proposed algorithm utilizes the Co-CEA’s divide-and-cooperative mechanism, which utilizes the evolutionary algorithms executing in parallel to coevolve subpopulations, corresponding to the hidden layer structure and the dominate features respectively. The algorithm adopts the binary encoding to represent the feature subset and the matrix-form mixed encoding to represent the RBFNN hidden layer structure, and a complete solution is formed via collaborations among the two subpopulations. Experimental results illustrate that the proposed algorithm outperforms other algorithms in references in terms of the classification accuracy, and it is able to obtain both prominent features and good RBFNN structure with higher prediction capability. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a new local–global pattern classification scheme that combines supervised and unsupervised approaches, taking advantage of both, local and global environments. We understand as global methods the ones concerned with the aim of constructing a model for the whole problem space using the totality of the available observations. Local methods focus into sub regions of the space, possibly using an appropriately selected subset of the sample. In the proposed method, the sample is first divided in local cells by using a Vector Quantization unsupervised algorithm, the LBG (Linde–Buzo–Gray). In a second stage, the generated assemblage of much easier problems is locally solved with a scheme inspired by Bayes’ rule. Four classification methods were implemented for comparison purposes with the proposed scheme: Learning Vector Quantization (LVQ); Feedforward Neural Networks; Support Vector Machine (SVM) and -Nearest Neighbors. These four methods and the proposed scheme were implemented in eleven datasets, two controlled experiments, plus nine public available datasets from the UCI repository. The proposed method has shown a quite competitive performance when compared to these classical and largely used classifiers. Our method is simple concerning understanding and implementation and is based on very intuitive concepts. [Copyright &y& Elsevier]

Abstract: Automatic classification of electrocardiogram (ECG) signals is vital for clinical diagnosis of heart disease. This paper investigates the design of an efficient system for recognition of the premature ventricular contraction from the normal beats and other heart diseases. This system includes three main modules: denoising module, feature extraction module and classifier module. In the denoising module, it is proposed the stationary wavelet transform for noise reduction of the electrocardiogram signals. In the feature extraction module a proper combination of the morphological-based features and timing interval-based features are proposed. As the classifier, several supervised classifiers are investigated; they are: a number of multi-layer perceptron neural networks with different number of layers and training algorithms, support vector machines with different kernel types, radial basis function and probabilistic neural networks. Also, for comparison the proposed features, we have considered the wavelet-based features. It has done comprehensive simulations in order to achieve a high efficient system for ECG beat classification from 12 files obtained from the MIT–BIH arrhythmia database. Simulation results show that best results are achieved about 97.14% for classification of ECG beats. [Copyright &y& Elsevier]

Abstract: Support vector machines are state-of-the-art pattern recognition algorithms that are well founded in optimization and generalization theory but not obviously applicable to the brain. This paper presents Bio-SVM, a biologically feasible support vector machine. An unstable associative memory oscillates between support vectors and interacts with a feed-forward classification pathway. Kernel neurons blend support vectors and sensory input. Downstream temporal integration generates the classification. Instant learning of surprising events and off-line tuning of support vector weights trains the system. Emotion-based learning, forgetting trivia, sleep and brain oscillations are phenomena that agree with the Bio-SVM model. A mapping to the olfactory system is suggested. [Copyright &y& Elsevier]

Abstract: Nowadays, ellipsometry is a widely used technique for thin-film analyses among the existing methods. It offers a rapid, accurate and non-destructive control. The main task in this technique remains in the inverse problem which goal is to extract the interesting characteristics of the sample from the ellipsometric measurement. This is a purely mathematical step and the common algorithms used to achieve it are based on the gradient method. These latter proceed iteratively and hence require a well-chosen initial solution in order to converge towards a global minimum corresponding to the real physical solution. The main limitation of these algorithms is the risk to slip into a local minimum, leading to an erroneous solution. In this paper, we propose an original method based on neural classification in order to give a first estimation about the location of the solution in the multi-parameter space. This operation generally takes place before the characterization step itself. In this work, the method is implemented experimentally to estimate the thickness range of photoresist thin films deposited on a glass substrate. [Copyright &y& Elsevier]

Abstract: Classification is the process of assigning an object to one of a set of classes based on its attributes. Classification problems have been examined in fields as diverse as biology, medicine, business, image recognition, and forensics. Developing more accurate and widely applicable classification methods has significant implications in these and many other fields. This paper presents a dynamic artificial neural network (DAN2) as an alternate approach for solving classification problems. We show DAN2 to be an effective approach and compare its performance with linear discriminant analysis, quadratic discriminant analysis, k-nearest neighbor algorithms, support vector machines, and traditional artificial neural networks using benchmark and real-world application data sets. These data sets vary in the number of classes (two vs. multiple) and the source of the data (synthetic vs. real-world). We found DAN2 to be a very effective classification method for two-class data sets with accuracy improvements as high as 37.2% when compared to the other methods. We also introduce a hierarchical DAN2 model for multiple class data sets that shows marked improvements (up to 89%) over all other methods, and offers better accuracy in all cases. [Copyright &y& Elsevier]

Abstract: In this paper, a novel use of Kernel–Adatron (K–A) learning algorithm to aid SVM (Support Vector Machine) for ECG arrhythmias classification is proposed. The proposed pattern classifier is compared with MLP (multi-layered perceptron) using back propagation (BP) learning algorithm. The ECG signals taken from MIT-BIH arrhythmia database are used in training to classify 6 different arrhythmia, plus normal ECG. The MLP and SVM training and testing stages were carried out twice. They were first trained only with one ECG lead signal and then a second ECG lead signal was added to the training and testing datasets. The aim was to investigate its influence on training and testing performance (generalization ability) plus time of training for both classifiers. Implementation of these three criteria for evaluation of ECG signals classification will ease the problem of structural comparisons, which has not been given attention in previous research works. The results indicate that SVM in comparison to MLP is much faster in training stage and nearly seven times higher in performance, but MLP generalization ability in terms of mean square error is more than three times less. The proposed SVM method shows considerable improvement in comparison to recently reported results obtained by . [Copyright &y& Elsevier]

This paper presents a method for computing a thesaurus from a text corpus, and combined with a revised back-propagation neural network (BPNN) learning algorithm for document categorization. Automatically constructed thesaurus is a data structure that accomplished by extracting the relatedness between words. Neural network is one of the efficient approaches for document categorization. However the conventional BPNN has the problems of slow learning and easy to involve into the local minimum. We use a revised algorithm to improve the conventional BPNN that can overcome these problems. A well constructed thesaurus has been recognized as valuable tool in the effective operation of document categorization, it overcome some problem for the document categorization based on bag of words which ignored the relationship between words. To investigate the effectiveness of our method, we conducted the experiments on the standard Reuter-21578. The experimental results show that the proposed model was able to achieve higher categorization effectiveness as measured by the precision, recall and F-measure. [Copyright &y& Elsevier]

Abstract: This paper proposes a hybrid neural network model using a possible combination of different transfer projection functions (sigmoidal unit, SU, product unit, PU) and kernel functions (radial basis function, RBF) in the hidden layer of a feed-forward neural network. An evolutionary algorithm is adapted to this model and applied for learning the architecture, weights and node typology. Three different combined basis function models are proposed with all the different pairs that can be obtained with SU, PU and RBF nodes: product–sigmoidal unit (PSU) neural networks, product–radial basis function (PRBF) neural networks, and sigmoidal–radial basis function (SRBF) neural networks; and these are compared to the corresponding pure models: product unit neural network (PUNN), multilayer perceptron (MLP) and the RBF neural network. The proposals are tested using ten benchmark classification problems from well known machine learning problems. Combined functions using projection and kernel functions are found to be better than pure basis functions for the task of classification in several datasets. [Copyright &y& Elsevier]

In this paper, we focus on the experimental analysis on the performance in artificial neural networks with the use of statistical tests on the classification task. Particularly, we have studied whether the sample of results from multiple trials obtained by conventional artificial neural networks and support vector machines checks the necessary conditions for being analyzed through parametrical tests. The study is conducted by considering three possibilities on classification experiments: random variation in the selection of test data, the selection of training data and internal randomness in the learning algorithm. The results obtained state that the fulfillment of these conditions are problem-dependent and indefinite, which justifies the need of using non-parametric statistics in the experimental analysis. [Copyright &y& Elsevier]

• Deep learning algorithm for identification of type and flight mode of detected drones. • Novel deep learning algorithm for detection of multiple drones in radio frequency domain. • Results of three indoor experiments concerning collecting and analyzing radio signals from drones. • Public available database with radio signals of drones from two different radio frequency bands. Unmanned aerial systems, especially drones have gone through remarkable improvement and expansion in recent years. Drones have been widely utilized in many applications and scenarios, due to their low price and ease of use. However, in some applications drones can pose a malicious threat. To diminish risks to public security and personal privacy, it is necessary to deploy an effective and affordable anti-drone system in sensitive areas to detect, localize, identify, and defend against intruding malicious drones. This research article presents a new publicly available radio frequency drone dataset and investigates detection and identification methodologies to detect single or multiple drones and identify a single detected drone's type. Moreover, special attention in this paper has been underlined to examine the possibility of using deep learning algorithms, particularly fully connected deep neural networks as an anti-drone solution within two different radio frequency bands. We proposed a supervised deep learning algorithm with fully-connected deep neural network models that use raw drone signals rather than features. Regarding the research results, the proposed algorithm shows a lot of potentials. The probability of detecting a single drone is 99.8%, and the probability of type identification is 96.1%. Moreover, the results of multiple drones detection demonstrate an average accuracy of 97.3%. There have not been such comprehensive publications, to this time, in the open literature that have presented and enlightened the problem of multiple drones detection in the radio frequency domain. [ABSTRACT FROM AUTHOR]

Recently, artificial neural networks have been widely used for classification. It is important to optimize the weight parameters and topological structure of the neural network simultaneously. These two tasks are interdependent and should be solved at the same time to achieve a better result. However, existing works cannot balance the accuracy and diversity of neural networks very well. In this paper, a cooperative co-evolutionary algorithm is proposed to simultaneously evolve artificial neural network topology, neuron attributes, and connection weights. In the proposed algorithm, two effective strategies are proposed. First, the niche-based strategy is used in the evolutionary and cooperative process to refine the local search ability. In this way, a set of candidate networks with a higher level of output diversity is obtained. Second, a two-step comparison scheme is designed to acquire a compact ensemble network. Moreover, a fully connected weights matrix crossover scheme is used to avoid destroying the network structure. The proposed algorithm is tested on the benchmark classification problems in the UCI machine learning repository and compared with other state-of-the-art methods. The experimental results show that the proposed niche-based cooperative co-evolutionary ensemble neural network has a higher capability of generalization compared with other methods in six of nine kinds of classification problems. Furthermore, the proposed ensemble neural network has relatively low complexity. • A niche-based cooperative co-evolutionary algorithm is developed to evolve ANN. • A fully connected matrix crossover strategy is used to protect the network structure. • A set of networks with different structures can improve the performance of ensemble. [ABSTRACT FROM AUTHOR]

Abstract: In this paper we propose a boosting approach to random subspace method (RSM) to achieve an improved performance and avoid some of the major drawbacks of RSM. RSM is a successful method for classification. However, the random selection of inputs, its source of success, can also be a major problem. For several problems some of the selected subspaces may lack the discriminant ability to separate the different classes. These subspaces produce poor classifiers that harm the performance of the ensemble. Additionally, boosting RSM would also be an interesting approach for improving its performance. Nevertheless, the application of the two methods together, boosting and RSM, achieves poor results, worse than the results of each method separately. In this work, we propose a new approach for combining RSM and boosting. Instead of obtaining random subspaces, we search subspaces that optimize the weighted classification error given by the boosting algorithm, and then the new classifier added to the ensemble is trained using the obtained subspace. An additional advantage of the proposed methodology is that it can be used with any classifier, including those, such as nearest neighbor classifiers, that cannot use boosting methods easily. The proposed approach is compared with standard AdaBoost and RSM showing an improved performance on a large set of 45 problems from the UCI Machine Learning Repository. An additional study of the effect of noise on the labels of the training instances shows that the less aggressive versions of the proposed methodology are more robust than AdaBoost in the presence of noise. [Copyright &y& Elsevier]

Abstract: In this paper, a novel evolutionary algorithm (EA) based on a newly formulated parameter, i.e., growth probability is used to evolve the near optimal weights and the number of hidden neurons in neural networks (NNs). Training NNs with growth probability based evolution (NN-GP) initializes networks with only one hidden neuron and the networks are allowed to grow until a suitable size. Growing of neurons is not restricted to one hidden neuron at a time as the optimal number of hidden neurons for the NNs might be a few neurons more than what it represents now. If this solution in the search space is far, networks have to add several number of hidden neurons. Growth rate is based on Gaussian distribution thus providing a way to escape local optima. A self-adaptive version (NN-SAGP) with the aim of evolving the growth probability in parallel with NNs during each generation is also proposed. The evolved networks are applied to widely used real-world benchmark problems. Simulation results show that the proposed approach is effective for evolving NNs with good classification accuracy and low complexity. [Copyright &y& Elsevier]

Abstract: Almost all current training algorithms for neural networks are based on gradient descending technique, which causes long training time. In this paper, we propose a novel fast training algorithm called Fast Constructive-Covering Algorithm (FCCA) for neural network construction based on geometrical expansion. Parameters are updated according to the geometrical location of the training samples in the input space, and each sample in the training set is learned only once. By doing this, FCCA is able to avoid iterative computing and much faster than traditional training algorithms. Given an input sequence in an arbitrary order, FCCA learns “easy” samples first and “confusing” samples are easily learned after these “easy” samples. This sample reordering process is done on the fly based on geometrical concept. In addition, FCCA begins with an empty hidden layer, and adds new hidden neurons when necessary. This constructive learning avoids blind selection of neural network structure. The experimental work for classification problems illustrates the advantages of FCCA, especially in learning speed. [Copyright &y& Elsevier]

Abstract: In this paper, a neural network based online analog modulation recognition of communication signals is presented. The proposed system can discriminate between amplitude modulation (AM), frequency modulation (FM), double sideband (DSB), upper sideband (USB), lower sideband (LSB) and continuous wave (CW) modulations. A matlab graphical user interface (GUI) is designed to see the intercepted signal, its power spectral density, frequency and modulation type on the screen of the personnel computer. To achieve correct classification, extensive simulations have been done for training the neural network. Theoretical simulations and experimental results indicate good performance even at signal-to-noise ratios as low as 5dB. [Copyright &y& Elsevier]

Abstract: Quantitative characterisation of carotid atherosclerosis and classification into symptomatic or asymptomatic is crucial in planning optimal treatment of atheromatous plaque. The computer-aided diagnosis (CAD) system described in this paper can analyse ultrasound (US) images of carotid artery and classify them into symptomatic or asymptomatic based on their echogenicity characteristics. The CAD system consists of three modules: a) the feature extraction module, where first-order statistical (FOS) features and Laws’ texture energy can be estimated, b) the dimensionality reduction module, where the number of features can be reduced using analysis of variance (ANOVA), and c) the classifier module consisting of a neural network (NN) trained by a novel hybrid method based on genetic algorithms (GAs) along with the back propagation algorithm. The hybrid method is able to select the most robust features, to adjust automatically the NN architecture and to optimise the classification performance. The performance is measured by the accuracy, sensitivity, specificity and the area under the receiver-operating characteristic (ROC) curve. The CAD design and development is based on images from 54 symptomatic and 54 asymptomatic plaques. This study demonstrates the ability of a CAD system based on US image analysis and a hybrid trained NN to identify atheromatous plaques at high risk of stroke. (E-mail: knikita@cc.ece.ntua.gr) [Copyright &y& Elsevier]

Aggregating outputs of multiple classifiers into a committee decision is one of the most important techniques for improving classification accuracy. The issue of selecting an optimal subset of relevant features plays also an important role in successful design of a pattern recognition system. In this paper, we present a neural network based approach for identifying salient features for classification in neural network committees. Feature selection is based on two criteria, namely the reaction of the cross-validation data set classification error due to the removal of the individual features and the diversity of neural networks comprising the committee. The algorithm developed removed a large number of features from the original data sets without reducing the classification accuracy of the committees. The accuracy of the committees utilizing the reduced feature sets was higher than those exploiting all the original features. [Copyright &y& Elsevier]