Sparse Multicategory Generalized Distance Weighted Discrimination in Ultra-High Dimensions

Distance weighted discrimination (DWD) is an appealing classification method that is capable of overcoming data piling problems in high-dimensional settings. Especially when various sparsity structures are assumed in these settings, variable selection in multicategory classification poses great challenges. In this paper, we propose a multicategory generalized DWD (MgDWD) method that maintains intrinsic variable group structures during selection using a sparse group lasso penalty. Theoretically, we derive minimizer uniqueness for the penalized MgDWD loss function and consistency properties for the proposed classifier. We further develop an efficient algorithm based on the proximal operator to solve the optimization problem. The performance of MgDWD is evaluated using finite sample simulations and miRNA data from an HIV study.     

A combined approach of Kullback–Leibler divergence and background subtraction for moving object detection in thermal video

In this work, a robust method for moving object detection in thermal video frames has been proposed by including Kullback–Leibler divergence (KLD) based threshold and background subtraction (BGS) technique. A trimmed-mean based background model has been developed that is capable enough to reduce noise or dynamic component of the background. This work assumed that each pixel has normally distributed. The KLD has computed between background pixel and a current pixel with the help of Gaussian mixture model. The proposed threshold is useful enough to classify the state of each pixel. The post-processing step uses morphological tool for edge linking, and then the flood-fill algorithm has applied for hole-filling, and finally the silhouette of targeted object has generated. The proposed methods run faster and have validated over various real-time based problematic thermal video sequences. In the experimental results, the average value of F₁-score, area under the curve, the percentage of correct classification, Matthew’s correlation coefficient show higher values whereas total error and percentage of the wrong classification show minimum values. Moreover, the proposed-1 method achieved higher accuracy and execution speed with minimum false alarm rate that has been compared with proposed-2 as well as considered peer methods in the real-time thermal video.     

ABLE: Attention based learning for enzyme classification

Classifying proteins into their respective enzyme class is an interesting question for researchers for a variety of reasons. The open source Protein Data Bank (PDB) contains more than 1,60,000 structures, with more being added everyday. This paper proposes an attention-based bidirectional-LSTM model (ABLE) trained on over sampled data generated by SMOTE to analyse and classify a protein into one of the six enzyme classes or a negative class using only the primary structure of the protein described as a string by the FASTA sequence as an input. We achieve the highest F1-score of 0.834 using our proposed model on a dataset of proteins from the PDB. We baseline our model against eighteen other machine learning and deep learning networks, including CNN, LSTM, Bi-LSTM, GRU, and the state-of-the-art DeepEC model. We conduct experiments with two different oversampling techniques, SMOTE and ADASYN. To corroborate the obtained results, we perform extensive experimentation and statistical testing.     

Recurrent and convolutional neural networks for deep terrain classification by autonomous robots

The future challenge for field robots is to increase the level of autonomy towards long distance (>1 km) and duration (>1h) applications. One of the key technologies is the ability to accurately estimate the properties of the traversed terrain to optimize onboard control strategies and energy efficient path-planning, ensuring safety and avoiding possible immobilization conditions that would lead to mission failure. Two main hypotheses are put forward in this research. The first hypothesis is that terrain can be effectively detected by relying exclusively on the measurement of quantities that pertain to the robot-ground interaction, i.e., on proprioceptive signals. Therefore, no visual or depth information is required. Then, artificial deep neural networks can provide an accurate and robust solution to the classification problem of different terrain types. Under these hypotheses, sensory signals are classified as time series directly by a Recurrent Neural Network or by a Convolutional Neural Network in the form of higher-level features or spectrograms resulting from additional processing. In both cases, results obtained from real experiments show comparable or better performance when contrasted with standard Support Vector Machine with the additional advantage of not requiring an a priori definition of the feature space.     

The global stability and pattern formations of a predator–prey system with consuming resource

The paper deals with a model that describes a predator–prey system with a common consuming resource. We use Lyapunov functions to prove the global stability of the kinetic system and the diffusive system. The existence of non-constant positive steady state solutions is shown to identify the range of parameters of spatial pattern formation for the cross-diffusion system.     

Hierarchical Model-Based Clustering for Large Datasets

In recent years, hierarchical model-based clustering has provided promising results in a variety of applications. However, its use with large datasets has been hindered by a time and memory complexity that are at least quadratic in the number of observations. To overcome this difficulty, this article proposes to start the hierarchical agglomeration from an efficient classification of the data in many classes rather than from the usual set of singleton clusters. This initial partition is derived from a subgraph of the minimum spanning tree associated with the data. To this end, we develop graphical tools that assess the presence of clusters in the data and uncover observations difficult to classify. We use this approach to analyze two large, real datasets: a multiband MRI image of the human brain and data on global precipitation climatology. We use the real datasets to discuss ways of integrating the spatial information in the clustering analysis. We focus on two-stage methods, in which a second stage of processing using established methods is applied to the output from the algorithm presented in this article, viewed as a first stage.     

Linguistic cost-sensitive learning of genetic fuzzy classifiers for imprecise data

Cost-sensitive classification is based on a set of weights defining the expected cost of misclassifying an object. In this paper, a Genetic Fuzzy Classifier, which is able to extract fuzzy rules from interval or fuzzy valued data, is extended to this type of classification. This extension consists in enclosing the estimation of the expected misclassification risk of a classifier, when assessed on low quality data, in an interval or a fuzzy number. A cooperative-competitive genetic algorithm searches for the knowledge base whose fitness is primal with respect to a precedence relation between the values of this interval or fuzzy valued risk. In addition to this, the numerical estimation of this risk depends on the entrywise product of cost and confusion matrices. These have been, in turn, generalized to vague data. The flexible assignment of values to the cost function is also tackled, owing to the fact that the use of linguistic terms in the definition of the misclassification cost is allowed.     

An improved ensemble learning machine for biological activity prediction of tyrosine kinase inhibitors

Boosting is one of the most important strategies in ensemble learning because of its ability to improve the stability and performance of weak learners. It is nonparametric, multivariate, fast and interpretable but is not robust against outliers. To enhance its prediction accuracy as well as immunize it against outliers, a modified version of a boosting algorithm (AdaBoost R2) was developed and called AdaBoost R3. In the sampling step, extremum samples were added to the boosting set. In the robustness step, a modified Huber loss function was applied to overcome the outlier problem. In the output step, a deterministic threshold was used to guarantee that bad predictions do not participate in the final output. The performance of the modified algorithm was investigated with two anticancer data sets of tyrosine kinase inhibitors, and the mechanism of inhibition was studied using the relative weighted variable importance procedure. Investigating the effect of base learner's strength reveals that boosting is only successful using the classification and regression tree method (a weak to moderate learner) and does not have a significant effect using the radial basis functions partial least square method (a strong base learners). Copyright © 2015 John Wiley & Sons, Ltd.