Search

Multidomain network classification has attracted significant attention in data integration and machine learning, which can enhance network classification or prediction performance by integrating information from different sources. Despite the previous success, existing multidomain network learning methods usually assume that different views are available for the same set of instances, and thus, they seek a consistent classification result for all domains. However, in many real-world problems, each domain has its specific instance set, and one instance in one domain may correspond to multiple instances in another domain. Moreover, due to the rapid growth of data sources, different domains may not be relevant to each other, which asks for selecting domains relevant to the target/focused domain. A key challenge under this setting is how to achieve accurate prediction by integrating different data representations without losing data information. In this paper, we propose a semisupervised classification approach for a multidomain network based on label propagation, i.e., multidomain classification with domain selection (MCS), which can deal with the cross-domain information and different instance sets in domains. In particular, with sparse weight properties, the proposed MCS can automatically identify those domains relevant to our target domain by assigning them higher weights than the other irrelevant domains. This not only significantly improves a classification accuracy but also helps to obtain optimal network partition for the target domain. From the theoretical viewpoint, we equivalently decompose MCS into two simpler subproblems with analytical solutions, which can be efficiently solved by their computational procedures. Extensive experimental results on both synthetic and real-world data sets empirically demonstrate the advantages of the proposed approach in terms of both prediction performance and domain selection ability. [ABSTRACT FROM AUTHOR]

This paper addresses the robust gradient learning (RGL) problem. Gradient learning models aim at learning the gradient vector of some target functions in supervised learning problems, which can be further used to applications, such as variable selection, coordinate covariance estimation, and supervised dimension reduction. However, existing GL models are not robust to outliers or heavy-tailed noise. This paper provides an RGL framework to address this problem in both regression and classification. This is achieved by introducing a robust regression loss function and proposing a robust classification loss. Moreover, our RGL algorithm works in an instance-based kernelized dictionary instead of some fixed reproducing kernel Hilbert space, which may provide more flexibility. To solve the proposed nonconvex model, a simple computational algorithm based on gradient descent is provided and the convergence of the proposed method is also analyzed. We then apply the proposed RGL model to applications, such as nonlinear variable selection and coordinate covariance estimation. The efficiency of our proposed model is verified on both synthetic and real data sets. [ABSTRACT FROM AUTHOR]

This paper deals with the problem of existence and uniform stability analysis of fractional-order complex-valued neural networks with constant time delays. Complex-valued recurrent neural networks is an extension of real-valued recurrent neural networks that includes complex-valued states, connection weights, or activation functions. This paper explains sufficient condition for the existence and uniform stability analysis of such networks. Three numerical simulations are delineated to substantiate the effectiveness of the theoretical results. [ABSTRACT FROM AUTHOR]

Multivariate mathematical morphology (MMM) aims to extend the mathematical morphology from gray scale images to images whose pixels are high-dimensional vectors, such as remote sensing hyperspectral images and functional magnetic resonance images (fMRIs). Defining an ordering over the multidimensional image data space is a fundamental issue MMM, to ensure that ensuing morphological operators and filters are mathematically consistent. Recent approaches use the outputs of two-class classifiers to build such reduced orderings. This paper presents the applications of MMM built on reduced supervised orderings based on lattice autoassociative memories (LAAMs) recall error measured by the Chebyshev distance. Foreground supervised orderings use one set of training data from a foreground class, whereas background/foreground supervised orderings use two training data sets, one for each relevant class. The first case study refers to the realization of the thematic segmentation of the hyperspectral images using spatial–spectral information. Spectral classification is enhanced by a spatial processing consisting in the spatial correction guided by a watershed segmentation computed by the LAAM-based morphological operators. The approach improves the state-of-the-art hyperspectral spatial–spectral thematic map building approaches. The second case study is the analysis of resting state fMRI data, working on a data set of healthy controls, schizophrenia patients with and without auditory hallucinations. We perform two experiments: 1) the localization of differences in brain functional networks on population-dependent templates and 2) the classification of subjects into each possible pair of cases. In this data set, we find that the LAAM-based morphological features improve over the conventional correlation-based graph measure features often employed in fMRI data classification. [ABSTRACT FROM PUBLISHER]

This paper deals with the lag synchronization problem of memristor-based coupled neural networks with or without parameter mismatch using two different algorithms. Firstly, we consider the memristor-based neural networks with parameter mismatch, lag complete synchronization cannot be achieved due to parameter mismatch, the concept of lag quasi-synchronization is introduced. Based on the $\omega $ -measure method and generalized Halanay inequality, the error level is estimated, a new lag quasi-synchronization scheme is proposed to ensure that coupled memristor-based neural networks are in a state of lag synchronization with an error level. Secondly, by constructing Lyapunov functional and applying common Halanary inequality, several lag complete synchronization criteria for the memristor-based neural networks with parameter match are given, which are easy to verify. Finally, two examples are given to illustrate the effectiveness of the proposed lag quasi-synchronization or lag complete synchronization criteria, which well support theoretical results. [ABSTRACT FROM PUBLISHER]