IEEE Transactions on Neural Networks and Learning Systems

An enhanced fuzzy min-max (EFMM) network is proposed for pattern classification in this paper. The aim is to overcome a number of limitations of the original fuzzy min-max (FMM) network and improve its classification performance. The key contributions are three heuristic rules to enhance the learning algorithm of FMM. First, a new hyperbox expansion rule to eliminate the overlapping problem during... View full abstract»

Multilabel learning aims to predict labels of unseen instances by learning from training samples that are associated with a set of known labels. In this paper, we propose to use a hierarchical tree model for multilabel learning, and to develop the ML-Tree algorithm for finding the tree structure. ML-Tree considers a tree as a hierarchy of data and constructs the tree using the induction of one-aga... View full abstract»

When the amount of labeled data are limited, semisupervised learning can improve the learner's performance by also using the often easily available unlabeled data. In particular, a popular approach requires the learned function to be smooth on the underlying data manifold. By approximating this manifold as a weighted graph, such graph-based techniques can often achieve state-of-the-art performance... View full abstract»

Subspace clustering is the task of identifying clusters in subspaces of the input dimensions of a given dataset. Noisy data in certain attributes cause difficulties for traditional clustering algorithms, because the high discrepancies within them can make objects appear too different to be grouped in the same cluster. This requires methods specially designed for subspace clustering. This paper pre... View full abstract»

The stochastic optimal control of nonlinear networked control systems (NNCSs) using neuro-dynamic programming (NDP) over a finite time horizon is a challenging problem due to terminal constraints, system uncertainties, and unknown network imperfections, such as network-induced delays and packet losses. Since the traditional iteration or time-based infinite horizon NDP schemes are unsuitable for NN... View full abstract»

In this paper, the finite-horizon optimal control design for nonlinear discrete-time systems in affine form is presented. In contrast with the traditional approximate dynamic programming methodology, which requires at least partial knowledge of the system dynamics, in this paper, the complete system dynamics are relaxed utilizing a neural network (NN)-based identifier to learn the control coeffici... View full abstract»

The correlation preserving transform (CPT) is introduced to perform bivariate component analysis via decorrelating matrix decompositions, while at the same time preserving the integrity of original bivariate sources. Specifically, unlike existing bivariate uncorrelating matrix decomposition techniques, CPT is designed to preserve both the order of the data channels within every bivariate source an... View full abstract»

A unified approach to the analysis of synchronization for complex dynamical networks, i.e., networks of partial-state coupled linear systems and networks of full-state coupled nonlinear oscillators, is introduced. It is shown that the developed analysis can be used to describe the difference between the state of each node and the weighted sum of the states of those nodes playing the role of leader... View full abstract»

Successful biological systems adapt to change. In this paper, we are principally concerned with adaptive systems that operate in environments where data arrives sequentially and is multivariate in nature, for example, sensory streams in robotic systems. We contribute two reservoir inspired methods: 1) the online echostate Gaussian process (OESGP) and 2) its infinite variant, the online infinite ec... View full abstract»

Most current model reference adaptive control (MRAC) methods rely on parametric adaptive elements, in which the number of parameters of the adaptive element are fixed a priori, often through expert judgment. An example of such an adaptive element is radial basis function networks (RBFNs), with RBF centers preallocated based on the expected operating domain. If the system operates outside of the ex... View full abstract»

This paper studies the generalization performance of radial basis function (RBF) networks using local Rademacher complexities. We propose a general result on controlling local Rademacher complexities with the L1-metric capacity. We then apply this result to estimate the RBF networks' complexities, based on which a novel estimation error bound is obtained. An effective approximation erro... View full abstract»

In this paper, we consider the second-order globally nonlinear consensus in a multiagent network with general directed topology and random interconnection failure by characterizing the behavior of stochastic dynamical system with the corresponding time-averaged system. A criterion for the second-order consensus is derived by constructing a Lyapunov function for the time-averaged network. By associ... View full abstract»

This paper presents a level set boundary description (LSBD) approach for novelty detection that treats the nonlinear boundary directly in the input space. The proposed approach consists of level set function (LSF) construction, boundary evolution, and termination of the training process. It employs kernel density estimation to construct the LSF of the initial boundary for the training data set. Th... View full abstract»

In this paper, the problem of deriving a continuous, state-feedback controller for a class of multiinput multioutput feedback linearizable systems is considered with special emphasis on controller simplification and reduction of the overall design complexity with respect to the current state of the art. The proposed scheme achieves prescribed bounds on the transient and steady-state performance of... View full abstract»

Focal Underdetermined System Solver (FOCUSS) is a powerful and easy to implement tool for basis selection and inverse problems. One of the fundamental problems regarding this method is its convergence, which remains unsolved until now. We investigate the convergence of the FOCUSS algorithm in this paper. We first give a rigorous derivation for the FOCUSS algorithm by exploiting the auxiliary funct... View full abstract»

A general utility function representation is proposed to provide the required derivable and adjustable utility function for the dual heuristic dynamic programming (DHP) design. Goal representation DHP (GrDHP) is presented with a goal network being on top of the traditional DHP design. This goal network provides a general mapping between the system states and the derivatives of the utility function... View full abstract»

In this paper, we consider online support vector machine (SVM) classification learning algorithms with uniformly ergodic Markov chain (u.e.M.c.) samples. We establish the bound on the misclassification error of an online SVM classification algorithm with u.e.M.c. samples based on reproducing kernel Hilbert spaces and obtain a satisfactory convergence rate. We also introduce a novel online SVM clas... View full abstract»

This brief considers the problem of neural networks (NNs)-based adaptive dynamic surface control (DSC) for permanent magnet synchronous motors (PMSMs) with parameter uncertainties and load torque disturbance. First, NNs are used to approximate the unknown and nonlinear functions of PMSM drive system and a novel adaptive DSC is constructed to avoid the explosion of complexity in the backstepping de... View full abstract»

We study sequential prediction of real-valued, arbitrary, and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by recent results from computational learning theory, we refrain from any statistical assumptions and define the performance with respect to the class of general parametric predictors. In parti... View full abstract»