Volume 22 Issue 12 Part 1 • Dec. 2011
This issue contains several parts.Go to: Part 2
Filter Results
-
Table of contents
Publication Year: 2011, Page(s): C1|
PDF (114 KB)
-
IEEE Transactions on Neural Networks publication information
Publication Year: 2011, Page(s): C2|
PDF (39 KB)
-
Editorial: The Blossoming of the IEEE Transactions on Neural Networks
Publication Year: 2011, Page(s): 1850
Cited by: Papers (2) -
Optimal Tracking Control for a Class of Nonlinear Discrete-Time Systems With Time Delays Based on Heuristic Dynamic Programming
Publication Year: 2011, Page(s):1851 - 1862
Cited by: Papers (81)In this paper, a novel heuristic dynamic programming (HDP) iteration algorithm is proposed to solve the optimal tracking control problem for a class of nonlinear discrete-time systems with time delays. The novel algorithm contains state updating, control policy iteration, and performance index iteration. To get the optimal states, the states are also updated. Furthermore, the “backward iter... View full abstract»
-
Hierarchical Approximate Policy Iteration With Binary-Tree State Space Decomposition
Publication Year: 2011, Page(s):1863 - 1877
Cited by: Papers (22)In recent years, approximate policy iteration (API) has attracted increasing attention in reinforcement learning (RL), e.g., least-squares policy iteration (LSPI) and its kernelized version, the kernel-based LSPI algorithm. However, it remains difficult for API algorithms to obtain near-optimal policies for Markov decision processes (MDPs) with large or continuous state spaces. To address this pro... View full abstract»
-
Unified Development of Multiplicative Algorithms for Linear and Quadratic Nonnegative Matrix Factorization
Publication Year: 2011, Page(s):1878 - 1891
Cited by: Papers (22)Multiplicative updates have been widely used in approximative nonnegative matrix factorization (NMF) optimization because they are convenient to deploy. Their convergence proof is usually based on the minimization of an auxiliary upper-bounding function, the construction of which however remains specific and only available for limited types of dissimilarity measures. Here we make significant progr... View full abstract»
-
A One-Layer Recurrent Neural Network for Pseudoconvex Optimization Subject to Linear Equality Constraints
Publication Year: 2011, Page(s):1892 - 1900
Cited by: Papers (47)In this paper, a one-layer recurrent neural network is presented for solving pseudoconvex optimization problems subject to linear equality constraints. The global convergence of the neural network can be guaranteed even though the objective function is pseudoconvex. The finite-time state convergence to the feasible region defined by the equality constraints is also proved. In addition, global expo... View full abstract»
-
Incremental Learning From Stream Data
Publication Year: 2011, Page(s):1901 - 1914
Cited by: Papers (37) | Patents (3)Recent years have witnessed an incredibly increasing interest in the topic of incremental learning. Unlike conventional machine learning situations, data flow targeted by incremental learning becomes available continuously over time. Accordingly, it is desirable to be able to abandon the traditional assumption of the availability of representative training data during the training period to develo... View full abstract»
-
Silicon Modeling of the Mihalaş–Niebur Neuron
Publication Year: 2011, Page(s):1915 - 1927
Cited by: Papers (3)There are a number of spiking and bursting neuron models with varying levels of complexity, ranging from the simple integrate-and-fire model to the more complex Hodgkin-Huxley model. The simpler models tend to be easily implemented in silicon but yet not biologically plausible. Conversely, the more complex models tend to occupy a large area although they are more biologically plausible. In this pa... View full abstract»
-
SaFIN: A Self-Adaptive Fuzzy Inference Network
Publication Year: 2011, Page(s):1928 - 1940
Cited by: Papers (22)There are generally two approaches to the design of a neural fuzzy system: (1) design by human experts, and (2) design through a self-organization of the numerical training data. While the former approach is highly subjective, the latter is commonly plagued by one or more of the following major problems: (1) an inconsistent rulebase; (2) the need for prior knowledge such as the number of clusters ... View full abstract»
-
Nonlinear System Identification by Gustafson–Kessel Fuzzy Clustering and Supervised Local Model Network Learning for the Drug Absorption Spectra Process
Publication Year: 2011, Page(s):1941 - 1951
Cited by: Papers (20)This paper deals with the problem of fuzzy nonlinear model identification in the framework of a local model network (LMN). A new iterative identification approach is proposed, where supervised and unsupervised learning are combined to optimize the structure of the LMN. For the purpose of fitting the cluster-centers to the process nonlinearity, the Gustafsson-Kessel (GK) fuzzy clustering, i.e., uns... View full abstract»
-
Modeling Activity-Dependent Plasticity in BCM Spiking Neural Networks With Application to Human Behavior Recognition
Publication Year: 2011, Page(s):1952 - 1966
Cited by: Papers (7)Spiking neural networks (SNNs) are considered to be computationally more powerful than conventional NNs. However, the capability of SNNs in solving complex real-world problems remains to be demonstrated. In this paper, we propose a substantial extension of the Bienenstock, Cooper, and Munro (BCM) SNN model, in which the plasticity parameters are regulated by a gene regulatory network (GRN). Meanwh... View full abstract»
-
Fast Independent Component Analysis Algorithm for Quaternion Valued Signals
Publication Year: 2011, Page(s):1967 - 1978
Cited by: Papers (24)An extension of the fast independent component analysis algorithm is proposed for the blind separation of both BBQ-proper and BBQ-improper quaternion-valued signals. This is achieved by maximizing a negentropy-based cost function, and is derived rigorously using the recently developed mbiBBHBBR calculus in order to implement Newton optimization in the augmented quaternion statistics framework. It ... View full abstract»
-
Synchronization of Continuous Dynamical Networks With Discrete-Time Communications
Publication Year: 2011, Page(s):1979 - 1986
Cited by: Papers (37)In this paper, synchronization of continuous dynamical networks with discrete-time communications is studied. Though the dynamical behavior of each node is continuous-time, the communications between every two different nodes are discrete-time, i.e., they are active only at some discrete time instants. Moreover, the communication intervals between every two communication instants can be uncertain ... View full abstract»
-
Quantitative Analysis of Nonlinear Embedding
Publication Year: 2011, Page(s):1987 - 1998
Cited by: Papers (7)A lot of nonlinear embedding techniques have been developed to recover the intrinsic low-dimensional manifolds embedded in the high-dimensional space. However, the quantitative evaluation criteria are less studied in literature. The embedding quality is usually evaluated by visualization which is subjective and qualitative. The few existing evaluation methods to estimate the embedding quality, nei... View full abstract»
-
Exponential Synchronization of Complex Networks With Finite Distributed Delays Coupling
Publication Year: 2011, Page(s):1999 - 2010
Cited by: Papers (24)In this paper, the exponential synchronization for a class of complex networks with finite distributed delays coupling is studied via periodically intermittent control. Some novel and useful criteria are derived by utilizing a different technique compared with some correspondingly previous results. As a special case, some sufficient conditions ensuring the exponential synchronization for a class o... View full abstract»
-
Bayesian Multitask Classification With Gaussian Process Priors
Publication Year: 2011, Page(s):2011 - 2021
Cited by: Papers (21)We present a novel approach to multitask learning in classification problems based on Gaussian process (GP) classification. The method extends previous work on multitask GP regression, constraining the overall covariance (across tasks and data points) to factorize as a Kronecker product. Fully Bayesian inference is possible but time consuming using sampling techniques. We propose approximations ba... View full abstract»
-
Data Mining Based Full Ceramic Bearing Fault Diagnostic System Using AE Sensors
Publication Year: 2011, Page(s):2022 - 2031
Cited by: Papers (12)Full ceramic bearings are considered the first step toward full ceramic, oil-free engines in the future. No research on full ceramic bearing fault diagnostics using acoustic emission (AE) sensors has been reported. Unlike their steel counterparts, signal processing methods to extract effective AE fault characteristic features and fault diagnostic systems for full ceramic bearings have not been dev... View full abstract»
-
Mobility Timing for Agent Communities, a Cue for Advanced Connectionist Systems
Publication Year: 2011, Page(s):2032 - 2049We introduce a wait-and-chase scheme that models the contact times between moving agents within a connectionist construct. The idea that elementary processors move within a network to get a proper position is borne out both by biological neurons in the brain morphogenesis and by agents within social networks. From the former, we take inspiration to devise a medium-term project for new artificial n... View full abstract»
-
Classifiability-Based Discriminatory Projection Pursuit
Publication Year: 2011, Page(s):2050 - 2061
Cited by: Papers (6)Fisher's linear discriminant (FLD) is one of the most widely used linear feature extraction method, especially in many visual computation tasks. Based on the analysis on several limitations of the traditional FLD, this paper attempts to propose a new computational paradigm for discriminative linear feature extraction, named “classifiability-based discriminatory projection pursuit” (C... View full abstract»
-
Bioinspired Neural Network for Real-Time Cooperative Hunting by Multirobots in Unknown Environments
Publication Year: 2011, Page(s):2062 - 2077
Cited by: Papers (26)Multiple robot cooperation is a challenging and critical issue in robotics. To conduct the cooperative hunting by multirobots in unknown and dynamic environments, the robots not only need to take into account basic problems (such as searching, path planning, and collision avoidance), but also need to cooperate in order to pursue and catch the evaders efficiently. In this paper, a novel approach ba... View full abstract»
-
Auto-Regressive Processes Explained by Self-Organized Maps. Application to the Detection of Abnormal Behavior in Industrial Processes
Publication Year: 2011, Page(s):2078 - 2090
Cited by: Papers (13)This paper analyzes the expected time evolution of an auto-regressive (AR) process using self-organized maps (SOM). It investigates how a SOM captures the time information given by the AR input process and how the transitions from one neuron to another one can be understood under a probabilistic perspective. In particular, regions of the map into which the AR process is expected to move are identi... View full abstract»
-
Parallel Programmable Asynchronous Neighborhood Mechanism for Kohonen SOM Implemented in CMOS Technology
Publication Year: 2011, Page(s):2091 - 2104
Cited by: Papers (15)We present a new programmable neighborhood mechanism for hardware implemented Kohonen self-organizing maps (SOMs) with three different map topologies realized on a single chip. The proposed circuit comes as a fully parallel and asynchronous architecture. The mechanism is very fast. In a medium sized map with several hundreds neurons implemented in the complementary metal-oxide semiconductor 0.18 &... View full abstract»
-
Passivity and Stability Analysis of Reaction-Diffusion Neural Networks With Dirichlet Boundary Conditions
Publication Year: 2011, Page(s):2105 - 2116
Cited by: Papers (43)This paper is concerned with the passivity and stability problems of reaction-diffusion neural networks (RDNNs) in which the input and output variables are varied with the time and space variables. By utilizing the Lyapunov functional method combined with the inequality techniques, some sufficient conditions ensuring the passivity and global exponential stability are derived. Furthermore, when the... View full abstract»
-
Symmetric Nonnegative Matrix Factorization: Algorithms and Applications to Probabilistic Clustering
Publication Year: 2011, Page(s):2117 - 2131
Cited by: Papers (42)Nonnegative matrix factorization (NMF) is an unsupervised learning method useful in various applications including image processing and semantic analysis of documents. This paper focuses on symmetric NMF (SNMF), which is a special case of NMF decomposition. Three parallel multiplicative update algorithms using level 3 basic linear algebra subprograms directly are developed for this problem. First,... View full abstract»
Aims & Scope
IEEE Transactions on Neural Networks is devoted to the science and technology of neural networks, which disclose significant technical knowledge, exploratory developments, and applications of neural networks from biology to software to hardware.
This Transactions ceased production in 2011. The current retitled publication is IEEE Transactions on Neural Networks and Learning Systems.