Search

Compared with the past questionnaire survey, this paper applies the intelligent algorithm developed rapidly in recent years to identify the tendency of customers to buy financial products in the market. In addition, for the single state customer classification indicators based on the previous demographic information and action information, it is proposed to combine the action of market activities with demographic information; that is, the static integrated customer classification index is further combined with the improved neural network model to study the classification and preference of enterprise financial customers. Firstly, the enterprise financial customer classification model based on neural network algorithm is studied. Aiming at the shortcomings of easy falling into the local optimal solution of neural network algorithm, slow convergence speed of algorithm, and difficult setting of network structure, combined with the characteristics of genetic algorithm, the concept of adaptive genetic neural network algorithm is proposed. Then, the design of adaptive genetic neural network model is studied. Secondly, combined with the customer data of a financial enterprise and the characteristics of enterprise finance, this paper analyzes the risk influencing factors of enterprise financial customers, analyzes the customer data, evaluates the enterprise financial customers through the adaptive genetic neural network model, and realizes the classification of enterprise financial customers. Through an example, it is proved that the enterprise financial customer classification and preference model based on the adaptive genetic neural network algorithm discussed in this paper has better customer classification accuracy and can provide better method support for enterprise financial customer management. [ABSTRACT FROM AUTHOR]

With the continuous improvement in production efficiency and quality of life, the requirements of electrical equipment for power quality are also increasing. Accurate detection of various power quality disturbances is an effective measure to improve power quality. However, in practical applications, the dataset is often contaminated by noise, and when the dataset is not sufficient, the computational complexity is too high. Similarly, in the recognition process of artificial neural networks, the local optimum often occurs, which ultimately leads to low recognition accuracy for the trained model. Therefore, this article proposes a power quality disturbance classification strategy based on the variational mode decomposition (VMD) and improved support vector machine (SVM) algorithms. Firstly, the VMD algorithm is used for preprocessing disturbance denoising. Next, based on the analysis of typical fault characteristics, a multi-SVM model is used for disturbance classification identification. In order to improve the recognition accuracy, the improved Grey Wolf Optimization (IGWO) algorithm is used to optimize the penalty factor and kernel function parameters of the SVM model. The results of the final case study show that the classification accuracy of the proposed method can reach over 98%, and the recognition accuracy is higher than that of the other models. [ABSTRACT FROM AUTHOR]

Even though numerous works focus on the few-shot learning issue by combining meta-learning, there are still limits to traditional graph classification problems. The antecedent algorithms directly extract features from the samples, and do not take into account the preference of the trained model to the previously "seen" targets. In order to overcome the aforementioned issues, an effective strategy with training an unbiased meta-learning algorithm was developed in this paper, which sorted out problems of target preference and few-shot under the meta-learning paradigm. First, the interactive attention extraction module as a supplement to feature extraction was employed, which improved the separability of feature vectors, reduced the preference of the model for a certain target, and remarkably improved the generalization ability of the model on the new task. Second, the graph neural network was used to fully mine the relationship between samples to constitute graph structures and complete image classification tasks at a node level, which greatly enhanced the accuracy of classification. A series of experimental studies were conducted to validate the proposed methodology, where the few-shot and semisupervised learning problem has been effectively solved. It also proved that our model has better accuracy than traditional classification methods on real-world datasets. [ABSTRACT FROM AUTHOR]

It is more than a decade since machine learning and especially its leading subtype deep learning have become one of the most interesting topics in almost all areas of science and industry. In numerous contexts, at least one of the applications of deep learning is utilized or is going to be utilized. Using deep learning for image classification is now very popular and widely used in various use cases. Many types of research in medical sciences have been focused on the advantages of deep learning for image classification problems. Some recent researches show more than 90% accuracy for breast tissue classification which is a breakthrough. A huge number of computations in deep neural networks are considered a big challenge both from software and hardware point of view. From the architectural perspective, this big amount of computing operations will result in high power consumption and computation runtime. This led to the emersion of deep learning accelerators which are designed mainly for improving performance and energy efficiency. Data reuse and localization are two great opportunities for achieving energy-efficient computations with lower runtime. Data flows are mainly designed based on these important parameters. In this paper, DLA-H and BJS, a deep learning accelerator, and its data flow for histopathologic image classification are proposed. The simulation results with the MAESTRO tool showed 756 cycles for total runtime and 3.21 × 10 6 GFLOPS roofline throughput that is an extreme performance improvement in comparison to current general-purpose deep learning accelerators and data flows. [ABSTRACT FROM AUTHOR]

In this article, two machine learning methods such as classification and clustering are used for decision tree (DT), artificial neural network (ANN), and K-nearest neighbors algorithms. The datasets were used to evaluate the effectiveness of the clustering method and the data mining tool. Weather data were used to compare algorithms and methods in the study. This study showed that the best model was DT according to accuracy and precision measures but the best model according to F-measure and receiver operating characteristic curve area measures was ANN. Waikato Environment for Knowledge Analysis, a data mining tool, is utilized in this paper to carry out the clustering. [ABSTRACT FROM AUTHOR]

Brain tumors (BTs) are an uncommon but fatal kind of cancer. Therefore, the development of computer-aided diagnosis (CAD) systems for classifying brain tumors in magnetic resonance imaging (MRI) has been the subject of many research papers so far. However, research in this sector is still in its early stage. The ultimate goal of this research is to develop a lightweight effective implementation of the U-Net deep network for use in performing exact real-time segmentation. Moreover, a simplified deep convolutional neural network (DCNN) architecture for the BT classification is presented for automatic feature extraction and classification of the segmented regions of interest (ROIs). Five convolutional layers, rectified linear unit, normalization, and max-pooling layers make up the DCNN's proposed simplified architecture. The introduced method was verified on multimodal brain tumor segmentation (BRATS 2015) datasets. Our experimental results on BRATS 2015 acquired Dice similarity coefficient (DSC) scores, sensitivity, and classification accuracy of 88.8%, 89.4%, and 88.6% for high-grade gliomas. When it comes to segmenting BRATS 2015 BT images, the performance of our proposed CAD framework is on par with existing state-of-the-art methods. However, the accuracy achieved in this study for the classification of BT images has improved upon the accuracy reported in prior studies. Image classification accuracy for BRATS 2015 BT has been improved from 88% to 88.6%. [ABSTRACT FROM AUTHOR]

Due to lack of a central bureaucrat in mobile ad hoc networks, the security of the network becomes serious issue. During malicious attacks, according to the motivation of intruder the severity of the threat varies. It may lead to loss of data, energy or throughput. This paper proposes a lightweight Intruder Node Detection and Isolation Action mechanism (INDIA) using feature extraction, feature optimization and classification techniques. The indirect and direct trust features are extracted from each node and the total trust feature is computed by combining them. The trust features are extracted from each node of MANET and these features are optimized using Particle Swarm Optimization (PSO) algorithm as feature optimization technique. These optimized feature sets are then classified using Neural Networks (NN) classifier which identifies the intruder node. The performance of the proposed methodology is studied in terms of various parameters such as success rate in packet delivery, delay in communication and the amount of energy consumption for identifying and isolating the intruder. [ABSTRACT FROM AUTHOR]

In this paper, the modified Spider Monkey Optimization (SMO) with Multi-Layer Perceptron (MLP) is utilized to solve the classification problem on five different datasets. The MLP is a widely used Neural Network (NN) variant which requires training on specific application to tackle the slow convergence speed and local minima avoidance. The original SMO with MLP experiences the problem of finding the optimal classification result; due to that, the SMO is enhanced by other meta-heuristics algorithm to train the MLP. Based on the concept of no free lunch theorem, there is always a possibility to improve the algorithm. With the same expectation, the performance of the SMO algorithm is improved by using Differential Evolution (DE) and Grey Wolf Optimizer (GWO) algorithm to train the MLP. Likewise, the SMO-DE and SMO-GWO are two different concepts employed to improve efficiency. The results of proposed algorithms are compared with other well-known algorithms such as BBO, PSO, ES, SVM, KNN, and Logistic Regression. The results show that the proposed algorithm performs better than others or they are more competitive. [ABSTRACT FROM AUTHOR]

An intrusion detection system is a security system that aims to detect sabotage and intrusions on networks to inform experts of the attack and abuse of the network. Different classification methods have been used in the intrusion detection systems such as fuzzy, genetic algorithms, decision trees, artificial neural networks, and support vector machines. Moreover, ensemble classifiers have shown more robust and effective performance for various tasks in the field. In this paper, we adopt ensemble models in order to improve the performance of intrusion detection and, at the same time, decrease the false alarm rate. We use kNN for multi-class classification, as well as SVM to approach the classification problem in normal-based detection. In order to combine multiple outputs, we use the Dempster–Shafer method in which there is the possibility of explicit retrieval of uncertainty. Moreover, we utilize deep learning for extracting features to train the samples, selected by the sample selection algorithm based on ensemble margin. We compare our results with state-of-the-art methods on benchmarking datasets such as UNSW-NB15, CICIDS2017, and NSL-KDD. Our proposed method indicates the superiority in terms of prominent metrics Accuracy, Precision, Recall, and F-measure. [ABSTRACT FROM AUTHOR]

The paper's subject is classification with nonstationary patterns. The attribute space is finite-dimensional, while its coordinates in particular may be continuous, binary, discrete, categorical in character, or also a combination of these. The number of patterns is not methodologically limited. Use of the Bayes approach minimizes the expected value of misclassifications, allowing additionally for an influence in the proportions of probability of errors when assigning to specific classes. In turn, the statistical kernel estimators method makes the algorithm independent of patterns' shapes. The investigated procedure also eliminates elements of patterns which have insignificant or even negative influence on the results' accuracy. Appropriate modifications follow the classifier parameters, which increases the effectiveness of procedure adaptation for nonstationary patterns. The algorithm concept is based on the sensitivity method, used with artificial neural networks. [ABSTRACT FROM AUTHOR]

In this paper, we suggest basing the development of classification methods on traditional techniques but approximating them in whole or in part with artificial neural networks (ANNs). Compared to a direct ANN approach, the underlying traditional method is often easier to analyse. Classification failures can be better understood and corrected for, while at the same time faster execution can be obtained due to the parallel ANN structure. Furthermore, such a two‐step design philosophy partly eliminates the 'guesswork' associated with the design of ANNs. The expected gain is thus that the benefits from the traditional field, and the ANN field can be obtained by combining the best features from both fields. We illustrate our approach by working through an explicit example, namely, a Nearest Neighbour classifier applied to a subset of the MNIST database of handwritten digits. Two different approaches are discussed for how to translate the traditional method into an ANN. The first approach is based on a constructive implementation which directly reflects the original algorithm. The second approach uses ANNs to approximate the whole, or part of, the original method. An important part of the approach is to show how improvements can be introduced. In line with the presented philosophy, this is done by extending the traditional method in several ways followed by ANN approximation of the modified algorithms. The extensions are based on a windowed version of the nearest neighbour algorithm. We show that the improvements carry over to the ANN implementations. We further investigate the stability of the solutions by modifying the training set. It is shown that the errors do not change significantly. This also holds true for the ANN approximations providing confidence that the two‐step strategy is robust. [ABSTRACT FROM AUTHOR]

Rule extraction from artificial neural networks remains important task in complex diseases such as diabetes and breast cancer where the rules should be accurate and comprehensible. The quality of rules is improved by the improvement of the network classification accuracy which is done by the discretization of input attributes. In this paper, we developed a rule extraction algorithm based on multiobjective genetic algorithms and association rules mining to extract highly accurate and comprehensible classification rules from ANN's that have been trained using the discretization of the continuous attributes. The data pre-processing provides very good improvement of the ANN accuracy and consequently leads to improve the performance of the classification rules in terms of fidelity and coverage. The results show that our algorithm is very suitable for medical decision making, so an excellent average accuracy of 94.73 has been achieved for the Pima dataset and 99.36 for the breast cancer dataset. [ABSTRACT FROM AUTHOR]

State-of-the-art neural network models are actively used in various fields, but it is well-known that they are vulnerable to adversarial example attacks. Throughout the efforts to make the models robust against adversarial example attacks, it has been found to be a very difficult task. While many defense approaches were shown to be not effective, adversarial training remains as one of the promising methods. In adversarial training, the training data are augmented by "adversarial" samples generated using an attack algorithm. If the attacker uses a similar attack algorithm to generate adversarial examples, the adversarially trained network can be quite robust to the attack. However, there are numerous ways of creating adversarial examples, and the defender does not know what algorithm the attacker may use. A natural question is: Can we use adversarial training to train a model robust to multiple types of attack? Previous work have shown that, when a network is trained with adversarial examples generated from multiple attack methods, the network is still vulnerable to white-box attacks where the attacker has complete access to the model parameters. In this paper, we study this question in the context of black-box attacks, which can be a more realistic assumption for practical applications. Experiments with the MNIST dataset show that adversarially training a network with an attack method helps defending against that particular attack method, but has limited effect for other attack methods. In addition, even if the defender trains a network with multiple types of adversarial examples and the attacker attacks with one of the methods, the network could lose accuracy to the attack if the attacker uses a different data augmentation strategy on the target network. These results show that it is very difficult to make a robust network using adversarial training, even for black-box settings where the attacker has restricted information on the target network. [ABSTRACT FROM AUTHOR]

Artificial neural networks (ANN) are currently an additional tool which the engineer can use for a variety of purposes. Classification and regression are the most common tasks; however, control, modeling, prediction and forecasting are common tasks as well. For over three decades, the field of ANN has been the center of intense research. As a result, one of the outcomes has been the development of a large set of software tools used to train these kinds of networks, making the selection of an adequate tool difficult for a new user. This paper aims to help the ANN user choose the most appropriate tool for its application by providing a large survey of the solutions available, as well as listing and explaining their characteristics and terms of use. The paper limits itself to focusing on the tools which were developed for ANN and the relevant characteristics of these tools, such as the operating systems, hardware requirements, license types, architectures and algorithms available. [ABSTRACT FROM AUTHOR]

A novel framework using a Bayesian approach for content-based phishing web page detection is presented. Our model takes into account textual and visual contents to measure the similarity between the protected web page and suspicious web pages. A text classifier, an image classifier, and an algorithm fusing the results from classifiers are introduced. An outstanding feature of this paper is the exploration of a Bayesian model to estimate the matching threshold. This is required in the classifier for determining the class of the web page and identifying whether the web page is phishing or not. In the text classifier, the naive Bayes rule is used to calculate the probability that a web page is phishing. In the image classifier, the earth mover's distance is employed to measure the visual similarity, and our Bayesian model is designed to determine the threshold. In the data fusion algorithm, the Bayes theory is used to synthesize the classification results from textual and visual content. The effectiveness of our proposed approach was examined in a large-scale dataset collected from real phishing cases. Experimental results demonstrated that the text classifier and the image classifier we designed deliver promising results, the fusion algorithm outperforms either of the individual classifiers, and our model can be adapted to different phishing cases. [ABSTRACT FROM AUTHOR]

Selecting the appropriate scheduling algorithm in distributed heterogeneous systems is a difficult problem. In order to avoid an exhaustive search it is possible to design an automatic selection procedure based on a classification model trained using various characteristics of the tasks to be scheduled. This paper presents a comparative study on the effectiveness of several classification models used to select an effective algorithm for a given scheduling problem. The main contribution of the paper is the hybrid classifier based on non-nested generalized exemplars and an evolutionary selection of attributes and exemplars. The experiments show the ability of the proposed hybrid classifier to identify the appropriate scheduling algorithm when new configurations arrive to the grid scheduler. [ABSTRACT FROM AUTHOR]

This paper presents automatic tumor detection and classification approaches for brain magnetic resonance images (MRI). These approaches are based on hybrid-optimized classification techniques and classify brain MRI to healthy, benign or malignant. The proposed system implements three-optimization techniques combined with Artificial Neural Network (ANN). Multi-Verse Optimizer (MVO), Moth-Flame Optimizer (MFO) and Salp Swarm Algorithm (SSA) are used and compared to examine how these techniques could be successfully employed to enhance the classification accuracy via selecting the optimal parameters of ANN. The proposed techniques are applied to the Harvard database and BRATS challenge dataset to evaluate the performance via Receiver Operation Characteristics (ROC) analysis. The approaches are tested against geometric transformations such as scaling, rotation and warping to show how much the proposed system resists these transformations. Experimentally, the proposed algorithms achieve the highest classification accuracy as compared to the other published ones. Also, the MVO-ANN algorithm outperforms the other proposed algorithms. [ABSTRACT FROM AUTHOR]

Classification is needed in disaster investigation, traffic control, and land-use resource management. How to quickly and accurately classify such remote sensing imagery has become a popular research topic. However, the application of large, deep neural network models for the training of classifiers in the hope of obtaining good classification results is often very time-consuming. In this study, a new CNN (convolutional neutral networks) architecture, i.e., RSSCNet (remote sensing scene classification network), with high generalization capability was designed. Moreover, a two-stage cyclical learning rate policy and the no-freezing transfer learning method were developed to speed up model training and enhance accuracy. In addition, the manifold learning t-SNE (t-distributed stochastic neighbor embedding) algorithm was used to verify the effectiveness of the proposed model, and the LIME (local interpretable model, agnostic explanation) algorithm was applied to improve the results in cases where the model made wrong predictions. Comparing the results of three publicly available datasets in this study with those obtained in previous studies, the experimental results show that the model and method proposed in this paper can achieve better scene classification more quickly and more efficiently. [ABSTRACT FROM AUTHOR]

It is well known that data mining has been implemented by statistical regressions, induction decision tree, neural networks, rough set, fuzzy set and etc. This paper promotes a multiple criteria linear programming (MCLP) approach to data mining based on linear discriminant analysis. This paper first describes the fundamental connections between MCLP and data mining, including several general models of MCLP approaches. Given the general models, it focuses on a designing architecture of MCLP-data mining algorithms in terms of a process of real-life business intelligence. This architecture consists of finding MCLP solutions, preparing mining scores, and interpreting the knowledge patterns. Secondly, this paper elaborates the software development of the MCLP-data mining algorithms. Based on a pseudo coding, two versions of software (SAS- and Linux-platform) will be discussed. Finally, the software performance analysis over business and experimental databases is reported to show its mining and prediction power. As a part of the performance analysis, a series of data testing comparisons between the MCLP and induction decision tree approaches are demonstrated. These findings suggest that the MCLP-data mining techniques have a great potential in discovering knowledge patterns from a large-scale real-life database or data warehouse. [ABSTRACT FROM AUTHOR]

Dermoscopy is a technique used to capture the images of skin, and these images are useful to analyze the different types of skin diseases. Malignant melanoma is a kind of skin cancer whose severity even leads to death. Earlier detection of melanoma prevents death and the clinicians can treat the patients to increase the chances of survival. Only few machine learning algorithms are developed to detect the melanoma using its features. This paper proposes a Computer Aided Diagnosis (CAD) system which equips efficient algorithms to classify and predict the melanoma. Enhancement of the images are done using Contrast Limited Adaptive Histogram Equalization technique (CLAHE) and median filter. A new segmentation algorithm called Normalized Otsu's Segmentation (NOS) is implemented to segment the affected skin lesion from the normal skin, which overcomes the problem of variable illumination. Fifteen features are derived and extracted from the segmented images are fed into the proposed classification techniques like Deep Learning based Neural Networks and Hybrid Adaboost-Support Vector Machine (SVM) algorithms. The proposed system is tested and validated with nearly 992 images (malignant & benign lesions) and it provides a high classification accuracy of 93 %. The proposed CAD system can assist the dermatologists to confirm the decision of the diagnosis and to avoid excisional biopsies. [ABSTRACT FROM AUTHOR]

The shortage of training samples remains one of the main obstacles in applying the neural networks to the hyperspectral images classification. To fuse the spatial and spectral information, pixel patches are often utilized to train a model, which may further aggregate this problem. In the existing works, an artificial neural network (ANN) model supervised by centerloss (ANNC) was introduced. Training merely with spectral information, the ANNC yields discriminative spectral features suitable for the subsequent classification tasks. In this paper, we propose a novel convolutional neural network (CNN)-based spatial feature fusion (CSFF) algorithm, which allows a smart integration of spatial information to the spectral features extracted by ANNC. As a critical part of CSFF, a CNN-based discriminant model is introduced to estimate whether two pixels belong to the same class. At the testing stage, by applying the discriminant model to the pixel pairs generated by a test pixel and each of its neighbors, the local structure is estimated and represented as a customized convolutional kernel. The spectral–spatial feature is generated by a convolutional operation between the estimated kernel and the corresponding spectral features within a local region. The final label is determined by classifying the resulting spectral–spatial feature. Without increasing the number of training samples or involving pixel patches at the training stage, the CSFF framework achieves the state of the art by declining 20%–50% classification failures in experiments on three well-known hyperspectral images. [ABSTRACT FROM AUTHOR]

Cardiovascular Disease (CVD) is one of the most catastrophic and life threatening health issue nowadays. Early detection of CVD is an important solution to reduce its devastating effects on health. In this paper, an efficient CVD detection algorithm is identified. The algorithm uses patient demographic data as inputs, along with several ECG signal features extracted automatically through signal processing techniques. Cross-validation results show a 98.29 % accuracy for the decision tree classification algorithm. The algorithm has been integrated into a web based system that can be used at anytime by patients to check their heart health status. At one end of the system is the ECG sensor attached to the patient's body, while at the other end is the detection algorithm. Communication between the two ends is done through an Android application. [ABSTRACT FROM AUTHOR]

One expanding area of bioinformatics is medical diagnosis through the categorization of biomedical characteristics. Automatic medical strategies to boost the diagnostic through machine learning (ML) methods are challenging. They require a formal examination of their performance to identify the best conditions that enhance the ML method. This work proposes variants of the Voting and Stacking (VC and SC) ensemble strategies based on diverse auto-tuning supervised machine learning techniques to increase the efficacy of traditional baseline classifiers for the automatic diagnosis of vertebral column orthopedic illnesses. The ensemble strategies are created by first combining a complete set of auto-tuned baseline classifiers based on different processes, such as geometric, probabilistic, logic, and optimization. Next, the three most promising classifiers are selected among k-Nearest Neighbors (kNN), Naïve Bayes (NB), Logistic Regression (LR), Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Support Vector Machine (SVM), Artificial Neural Networks (ANN), and Decision Tree (DT). The grid-search K-Fold cross-validation strategy is applied to auto-tune the baseline classifier hyperparameters. The performances of the proposed ensemble strategies are independently compared with the auto-tuned baseline classifiers. A concise analysis evaluates accuracy, precision, recall, F1-score, and ROC-ACU metrics. The analysis also examines the misclassified disease elements to find the most and least reliable classifiers for this specific medical problem. The results show that the VC ensemble strategy provides an improvement comparable to that of the best baseline classifier (the kNN). Meanwhile, when all baseline classifiers are included in the SC ensemble, this strategy surpasses 95% in all the evaluated metrics, standing out as the most suitable option for classifying vertebral column diseases. [ABSTRACT FROM AUTHOR]

In this paper, a new detection and classification system of faulty bearings is presented. This system is based on artificial intelligent techniques and vibration signals in the frequency domain produced by the faulty bearings. The system consists of several neuro-fuzzy systems in cascade, along with measurement equipment for the vibration spectral data. These neuro-fuzzy systems have been used as bi-classifiers. That is, each neuro-fuzzy system is specialized in the classification between two different types of rolling bearing status. A careful selection process for rules has been included in the learning algorithm. Moreover, the demodulated vibration signal has been used as input to the neuro-fuzzy systems based on the Sugeno approach. Several trials were carried out, taking into account the vibration spectral data collected by the measurement equipment for each bearing. Different results with three types of faulty bearings using the proposed approach are shown, where satisfactory results have been achieved. [ABSTRACT FROM PUBLISHER]

Since the amount of information is rapidly growing, there is an overwhelming interest in efficient network computing. In this article, we take a detailed look at the problem of modelling and optimization of aforementioned systems for k-nearest neighbour classifier. First, we present a comprehensive discussion on considered classification methods with a special focus on improving classification accuracy or response time through the use of partitions of original data set for the nearest neighbour rule. Next, we propose a generic optimization model of a network computing system that can be used for distributed implementation of aforementioned recognition methods. The objective is to minimize the response time of the computing system applied for tasks related to k-nearest neighbours classifiers. We solve the problem using traditional branch and cut method and original algorithm GReTiMA based on a genetic approach as well. To illustrate our work, we provide results of numerical experiments showing the performance of the evolutionary approach compared against optimal results. Moreover, we show that the distributed approach enables significant improvement of the system response time. [ABSTRACT FROM PUBLISHER]

Occlusion handling is an old but important problem for the computer vision and pattern recognition community. Features from different objects may twist with each other, and any matched feature points may belong to different objects for many traditional object recognition algorithms. To recognize occlusions, we should not only match objects from different view points but also match features extracted from the same object. In this paper, we propose a method to consider these two perspectives simultaneously by encoding various types of features, such as geometry, color and texture relationships among feature points into a matrix and find the best quadratic feature correlation model to fit them. Experiments on our own built dataset and the publicly available PASCAL VOC dataset shows that, our method can robustly classify objects and handle occluded objects under large occlusions, and the performance is among the state-of-the-art. [ABSTRACT FROM AUTHOR]

In this paper, we consider a new periodic activation function for the multivalued neuron (MVN). The MVN is a neuron with complex-valued weights and inputs/output, which are located on the unit circle. Although the MVN outperforms many other neurons and MVN-based neural networks have shown their high potential, the MVN still has a limited capability of learning highly nonlinear functions. A periodic activation function, which is introduced in this paper, makes it possible to learn nonlinearly separable problems and non-threshold multiple-valued functions using a single multivalued neuron. We call this neuron a multivalued neuron with a periodic activation function (MVN-P). The MVN-Ps functionality is much higher than that of the regular MVN. The MVN-P is more efficient in solving various classification problems. A learning algorithm based on the error-correction rule for the MVN-P is also presented. It is shown that a single MVN-P can easily learn and solve those benchmark classification problems that were considered unsolvable using a single neuron. It is also shown that a universal binary neuron, which can learn nonlinearly separable Boolean functions, and a regular MVN are particular cases of the MVN-P. [ABSTRACT FROM AUTHOR]

Multihop connectivity-based algorithms have been receiving increased attention in recent times for localization in wireless sensor networks (WSNs). This paper proposes the development of a Fletcher-Reeves update-based conjugate gradient (CG) multilayered feedforward neural network for multihop connectivity-based localization of a large number of sensor nodes in a 2-D sensor network on the basis of information gathered from beacon nodes. The neural-network-based system employs a classification scheme where the location of a sensor is simultaneously estimated in both the x- and y-directions. The usefulness of the proposed scheme is demonstrated by employing the scheme for three case studies, with varied environments, where it could consistently show better performance than two popular recently proposed schemes. [ABSTRACT FROM AUTHOR]

In this paper, a novel heuristic structure optimization methodology for radial basis probabilistic neural networks (RBPNNs) is proposed. First, a minimum volume covering hyperspheres (MVCH) algorithm is proposed to select the initial hidden-layer centers of the RBPNN, and then the recursive orthogonal least square algorithm (ROLSA) combined with the particle swarm optimization (PSO) algorithm is adopted to further optimize the initial structure of the RBPNN. The proposed algorithms are evaluated through eight benchmark classification problems and two real-world application problems, a plant species identification task involving 50 plant species and a palmprint recognition task. Experimental results show that our proposed algorithm is feasible and efficient for the structure optimization of the RBPNN. The RBPNN achieves higher recognition rates and better classification efficiency than multilayer perceptron networks (MLPNs) and radial basis function neural networks (RBFNNs) in both tasks. Moreover, the experimental results illustrated that the generalization performance of the optimized RBPNN in the plant species identification task was markedly better than that of the optimized RBFNN. [ABSTRACT FROM AUTHOR]

This paper introduces a evolutionary computation method that applies Bayesian classifiers to optimization problems. This approach is based on Estimation of Distribution Algorithms (EDAs) in which Bayesian or Gaussian networks are applied to the evolution of a population of individuals (i.e. potential solutions to the optimization problem) in order to improve the quality of the individuals of the next generation. Our new approach, called Evolutionary Bayesian Classifier-based Optimization Algorithm (EBCOA), employs Bayesian classifiers instead of Bayesian or Gaussian networks in order to evolve individuals to a fitter population. In brief, EBCOAs are characterized by applying Bayesian classification techniques - usually applied to supervised classification problems - to optimization in continuous domains. We propose and review in this paper different Bayesian classifiers for implementing our EBCOA method, focusing particularly on EBCOAs applying naïve Bayes, semi-na¨ive Bayes, and tree augmented na¨ive Bayes classifiers. This work presents a deep study on the behavior of these algorithms with classical optimiztion problems in continuous domains. The different parameters used for tuning the performance of the algorithms are discussed, and a comprehensive overview of their influence is provided. We also present experimental results to compare this new method with other state of the art approaches of the evolutionary computation field for continuous domains such as Evolutionary Strategies (ES) and Estimation of Distribution Algorithms (EDAs). [ABSTRACT FROM AUTHOR]

A new algorithm based on wavelet packet transform and singular value decomposition is proposed in this paper for classification of textures in the presence of noise. Lower singular values are affected more by noise than higher singular values, and hence only higher singular values are used to classify textures in the presence of noise. The probability density function of the selected singular values is then modeled as an exponential distribution, and the model parameter for the distribution is estimated using the maximum likelihood estimation technique. The model parameter, one for each subband is used as features for the classification. The classification is carried out using Weighted Probabilistic Neural Networks (WPNN). Compared to conventional probabilistic neural networks, WPNN includes weighting factors between pattern layer and summation layer of the conventional PNN. Performance of the algorithm is compared with `wavelet domain generalized Gaussian density based model' in terms of signal to noise ratio and classification rate. Experimental results prove that the proposed algorithm achieves better classification rate under noisy environment. [ABSTRACT FROM AUTHOR]

This paper presents evolvable block-based neural networks (BbNNs) for personalized ECG heartbeat pattern classification. A BbNN consists of a 2-D array of modular component NNs with flexible structures and internal configurations that can be implemented using reconfigurable digital hardware such as field-programmable gate arrays (FPGAs). Signal flow between the blocks determines the internal configuration of a block as well as the overall structure of the BbNN. Network structure and the weights are optimized using local gradient-based search and evolutionary operators with the rates changing adaptively according to their effectiveness in the previous evolution period. Such adaptive operator rate update scheme ensures higher fitness on average compared to predetermined fixed operator rates. The Hermite transform coefficients and the time interval between two neighboring R-peaks of ECG signals are used as inputs to the BbNN. A BbNN optimized with the proposed evolutionary algorithm (EA) makes a personalized heartbeat pattern classifier that copes with changing operating environments caused by individual difference and time-varying characteristics of ECG signals. Simulation results using the Massachusetts Institute of Technology/Beth Israel Hospital (MIT-BIH) arrhythmia database demonstrate high average detection accuracies of ventricular ectopic beats (98.1%) and supraventricular ectopic beats (96.6%) patterns for heartbeat monitoring, being a significant improvement over previously reported electrocardiogram (ECG) classification results. [ABSTRACT FROM AUTHOR]

This paper presents a comparative analysis of novel supervised fuzzy adaptive resonance theory (SF-ART), multilayer perceptron (MLP) and Multi Layer Perceptrons (MLP) neural networks over Ballistocardiogram (BCG) signal recognition. To extract essential features of the BCG signal, we applied Biorthogonal wavelets. SF-ART performs classification on two levels. At first level, pre-classifier which is self-organized fuzzy ART tuned for fast learning classifies the input data roughly to arbitrary (M) classes. At the second level, post-classification level, a special array called Affine Look-up Table (ALT) with M elements stores the labels of corresponding input samples in the address equal to the index of fuzzy ART winner. However, in running (testing) mode, the content of an ALT cell with address equal to the index of fuzzy ART winner output will be read. The read value declares the final class that input data belongs to. In this paper, we used two well-known patterns (IRIS and Vowel data) and a medical application (Ballistocardiogram data) to evaluate and check SF-ART stability, reliability, learning speed and computational load. Initial tests with BCG from six subjects (both healthy and unhealthy people) indicate that the SF-ART is capable to perform with a high classification performance, high learning speed (elapsed time for learning around half second), and very low computational load compared to the well-known neural networks such as MLP which needs minutes to learn the training material. Moreover, to extract essential features of the BCG signal, we applied Biorthogonal wavelets. The applied wavelet transform requires no prior knowledge of the statistical distribution of data samples. [ABSTRACT FROM AUTHOR]

There are numerous combinations of neural networks (NNs) and evolutionary algorithms (EAs) used in classification problems. EAs have been used to train the networks, design their architecture, and select feature subsets. However, most of these combinations have been tested on only a few data sets and many comparisons are done inappropriately measuring the performance on training data or without using proper statistical tests to support the conclusions. This paper presents an empirical evaluation of eight combinations of EAs and NNs on 15 public-domain and artificial data sets. Our objective is to identify the methods that consistently produce accurate classifiers that generalize well. In most cases, the combinations of EAs and NNs perform equally well on the data sets we tried and were not more accurate than hand-designed neural networks trained with simple backpropagation. [ABSTRACT FROM AUTHOR]

Feedforward neural networks are receiving growing attention as a data modelling tool in economic classification problems. It is well known that controlling the design ora neural network can be cumbersome. Inaccuracies may lead to numerous problems in the application, such as higher errors due to local optima, overfitting and ill-conditioning of the network, especially when the number of observations is small. In this paper we provide a method to overcome these difficulties by regulating the flexibility of the network, and by rendering measures for validating the final network. In particular, a method is proposed to equilibrate the number of hidden neurons based on 5-fold cross-validation. In the validation process, the performance of the neural network is compared with a linear model using 5-fold cross-validation. In both case studies, the degree of monotonicity of the output of the neural network, with respect to each input variable, is calculated by numerical differentiation. The outcomes of this analysis are compared to what is expected from economic theory. Furthermore, a special class of monotonic neural networks and a corresponding training algorithm are developed. It is shown in the second case study that networks in this class have less tendency to overfitting than ordinary neural networks. The methods are illustrated in two case studies: predicting the price of housing in the Dutch city of Den Bosch; and the classification of bond ratings. [ABSTRACT FROM AUTHOR]

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]

Background: The algorithmic classification of infected and healthy individuals by gene expression has been a topic of interest to researchers in numerous domains, including cancer. Several studies have presented numerous solutions, such as neural networks and support vector machines (SVMs), to classify a diverse range of cancer cases. Such classifications have provided some degrees of accuracy, which highly depend on optimization approaches and suitable kernels. Objectives: This study aimed at proposing a method to classify cancer-prone and healthy cases under breast cancer and colorectal cancer (CRC), using machine learning methods efficiently, increasing the accuracy of the classification process. Methods: This study presented an algorithm to diagnose individuals prone to breast cancer and CRC. The novelty of this algorithm lies in its suitable kernel and the feature extraction approach. By the application of this algorithm, this study first identified the genes closely associated with these types of cancers and, then, tried to find individuals susceptible to the concerned cancers using SVM. The present study highlighted the indirect gene expressions associated with these cancers, which might show health status complications for the patients. To this end, the algorithm consists of SVMs in conjunction with the k-fold method for validation. Results: The results confirmed the superior performance of this approach, compared to the common neural networks. The algorithm's identification accuracy values were 98.077% and 99.806% for breast cancer and CRC, respectively. The graphic representation of the cause-effect relationships was also provided to help researchers better understand the trend of cancer or other types of diseases. Conclusions: The feature extraction method highly affects the accuracy of the classification. In addition, relying on indirect disease-triggering genes' expressions highlights a cause-effect relationship between genes and diseases. Such relationships can form Markov models in the clinical domain leading to treatment paths and prediction of patient outcomes. [ABSTRACT FROM AUTHOR]

Copyright of Arabian Journal for Science & Engineering (Springer Science & Business Media B.V. ) is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Accurate cotton maps are crucial for monitoring cotton growth and precision management. The paper proposed a county-scale cotton mapping method by using random forest (RF) feature selection algorithm and classifier based on selecting multi-features, including spectral, vegetation indices, and texture features. The contribution of texture features to cotton classification accuracy was also explored in addition to spectral features and vegetation index. In addition, the optimal classification time, feature importance, and the best classifier on the cotton extraction accuracy were evaluated. The results showed that the texture feature named the gray level co-occurrence matrix (GLCM) is effective for improving classification accuracy, ranking second in contribution among all studied spectral, VI, and texture features. Among the three classifiers, the RF showed higher accuracy and better stability than support vector machines (SVM) and artificial neural networks (ANN). The average overall accuracy (OA) of the classification combining multiple features was 93.36%, 7.33% higher than the average OA of the single-time spectrum, and 2.05% higher than the average OA of the multi-time spectrum. The classification accuracy after feature selection by RF can still reach 92.12%, showing high accuracy and efficiency. Combining multiple features and random forest methods may be a promising county-scale cotton classification method. [ABSTRACT FROM AUTHOR]

The objective of this paper is to study the performance of classifiers developed under the umbrella of radial basis function neural networks. Based on the study, a comprehensive statistical review report is presented. This report can be a road map for other interested researchers. [ABSTRACT FROM AUTHOR]

Ensemble learning has gained considerable attention in different learning tasks including regression, classification, and clustering problems. One of the drawbacks of the ensemble is the high computational cost of training stages. Resampling local negative correlation (RLNC) is a technique that combines two well-known methods to generate ensemble diversity-resampling and error negative correlation-and a fine-grain parallel approach that allows us to achieve a satisfactory balance between accuracy and efficiency. In this paper, we introduce a structure of the virtual machine aimed to test diverse selection strategies of parameters in neural ensemble designs, such as RLNC. We assess the parallel performance of this approach on a virtual machine cluster based on the full virtualization paradigm, using speedup and efficiency as performance metrics, for different numbers of processors and training data sizes. [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]

This paper proposes an optimal feature selection approach, namely, probabilistic neural network-based feature selection (PFS), for power-quality disturbances classification. The PFS combines a global optimization algorithm with an adaptive probabilistic neural network (APNN) to gradually remove redundant and irrelevant features in noisy environments. To validate the practicability of the features selected by the proposed PFS approach, we employed three common classifiers: multilayer perceptron, k-nearest neighbor and APNN. The results indicate that this PFS approach is capable of efficiently eliminating nonessential features to improve the performance of classifiers, even in environments with noise interference. [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]