Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on - new TOC

Feb. 2010

IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics publication information

Feb. 2010

Editorial

Feb. 2010

Adaptive and Learning Systems

Feb. 2010

Solving Multiconstraint Assignment Problems Using Learning Automata

Feb. 2010

This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are “similar” to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have su- perior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the pioneering LA solutions to this problem, unequivocally demonstrates that LA can play an important role in solving complex combinatorial and integer optimization problems.

A Team of Continuous-Action Learning Automata for Noise-Tolerant Learning of Half-Spaces

Feb. 2010

Learning automata are adaptive decision making devices that are found useful in a variety of machine learning and pattern recognition applications. Although most learning automata methods deal with the case of finitely many actions for the automaton, there are also models of continuous-action-set learning automata (CALA). A team of such CALA can be useful in stochastic optimization problems where one has access only to noise-corrupted values of the objective function. In this paper, we present a novel formulation for noise-tolerant learning of linear classifiers using a CALA team. We consider the general case of nonuniform noise, where the probability that the class label of an example is wrong may be a function of the feature vector of the example. The objective is to learn the underlying separating hyperplane given only such noisy examples. We present an algorithm employing a team of CALA and prove, under some conditions on the class conditional densities, that the algorithm achieves noise-tolerant learning as long as the probability of wrong label for any example is less than 0.5. We also present some empirical results to illustrate the effectiveness of the algorithm.

Modeling a Student–Classroom Interaction in a Tutorial-Like System Using Learning Automata

Feb. 2010

Almost all of the learning paradigms used in machine learning, learning automata (LA), and learning theory, in general, use the philosophy of a student (learning mechanism) attempting to learn from a teacher. This paradigm has been generalized in a myriad of ways, including the scenario when there are multiple teachers or a hierarchy of mechanisms that collectively achieve the learning. In this paper, we consider a departure from this paradigm by allowing the student to be a member of a classroom of students, where, for the most part, we permit each member of the classroom not only to learn from the teacher(s) but also to ldquoextractrdquo information from any of his fellow students. This paper deals with issues concerning the modeling, decision-making process, and testing of such a scenario within the LA context. The main result that we show is that a weak learner can actually benefit from this capability of utilizing the information that he gets from a superior colleague-if this information transfer is done appropriately. As far as we know, the whole concept of Students learning from both a teacher and from a classroom of Students is novel and unreported in the literature. The proposed student-classroom interaction has been tested for numerous strategies and for different environments, including the established benchmarks, and the results show that students can improve their learning by interacting with each other. For example, for some interaction strategies, a weak student can improve his learning by up to 73% when interacting with a classroom of students, which includes students of various capabilities. In these interactions, the student does not have a priori knowledge of the identity or characteristics of the students who offer their assistance.

Standalone CMAC Control System With Online Learning Ability

Feb. 2010

A cerebellar model articulation controller (CMAC) control system, which contains only one single-input controller implemented by a differentiable CMAC, is proposed in this paper. In the proposed scheme, the CMAC controller is solely used to control the plant, and no conventional controller is needed. Without a preliminary offline learning, the single-input CMAC controller can provide the control effort to the plant at each online learning step. To train the differentiable CMAC online, the gradient descent algorithm is employed to derive the learning rules. The sensitivity of the plant, with respect to the input, is approximated by a simple formula so that the learning rules can be applied to unknown plants. Moreover, based on a discrete-type Lyapunov function, conditions on the learning rates guaranteeing the convergence of the output error are derived in this paper. Finally, simulations on controlling three different plants are given to demonstrate the effectiveness of the proposed controller.

Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications

Feb. 2010

The cellular learning automaton (CLA), which is a combination of cellular automaton (CA) and learning automaton (LA), is introduced recently. This model is superior to CA because of its ability to learn and is also superior to single LA because it is a collection of LAs which can interact with each other. The basic idea of CLA is to use LA to adjust the state transition probability of stochastic CA. Recently, various types of CLA such as synchronous, asynchronous, and open CLAs have been introduced. In some applications such as cellular networks, we need to have a model of CLA for which multiple LAs reside in each cell. In this paper, we study a CLA model for which each cell has several LAs. It is shown that, for a class of rules called commutative rules, the CLA model converges to a stable and compatible configuration. Two applications of this new model such as channel assignment in cellular mobile networks and function optimization are also given. For both applications, it has been shown through computer simulations that CLA-based solutions produce better results.

Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution

Feb. 2010

In this paper, we present a learning-automata-like The reason why the mechanism is not a pure LA, but rather why it yet mimics one, will be clarified in the body of this paper. (LAL) mechanism for congestion avoidance in wired networks. Our algorithm, named as LAL Random Early Detection (LALRED), is founded on the principles of the operations of existing RED congestion-avoidance mechanisms, augmented with a LAL philosophy. The primary objective of LALRED is to optimize the value of the average size of the queue used for congestion avoidance and to consequently reduce the total loss of packets at the queue. We attempt to achieve this by stationing a LAL algorithm at the gateways and by discretizing the probabilities of the corresponding actions of the congestion-avoidance algorithm. At every time instant, the LAL scheme, in turn, chooses the action that possesses the maximal ratio between the number of times the chosen action is rewarded and the number of times that it has been chosen. In LALRED, we simultaneously increase the likelihood of the scheme converging to the action, which minimizes the number of packet drops at the gateway. Our approach helps to improve the performance of congestion avoidance by adaptively minimizing the queue-loss rate and the average queue size. Simulation results obtained using NS2 establish the improved performance of LALRED over the traditional RED methods which were chosen as the benchmarks for performance comparison purposes.

Biomimetic Approach to Tacit Learning Based on Compound Control

Feb. 2010

The remarkable capability of living organisms to adapt to unknown environments is due to learning mechanisms that are totally different from the current artificial machine-learning paradigm. Computational media composed of identical elements that have simple activity rules play a major role in biological control, such as the activities of neurons in brains and the molecular interactions in intracellular control. As a result of integrations of the individual activities of the computational media, new behavioral patterns emerge to adapt to changing environments. We previously implemented this feature of biological controls in a form of machine learning and succeeded to realize bipedal walking without the robot model or trajectory planning. Despite the success of bipedal walking, it was a puzzle as to why the individual activities of the computational media could achieve the global behavior. In this paper, we answer this question by taking a statistical approach that connects the individual activities of computational media to global network behaviors. We show that the individual activities can generate optimized behaviors from a particular global viewpoint, i.e., autonomous rhythm generation and learning of balanced postures, without using global performance indices.

Development of Quantum-Based Adaptive Neuro-Fuzzy Networks

Feb. 2010

In this study, we are concerned with a method for constructing quantum-based adaptive neuro-fuzzy networks (QANFNs) with a Takagi-Sugeno-Kang (TSK) fuzzy type based on the fuzzy granulation from a given input-output data set. For this purpose, we developed a systematic approach in producing automatic fuzzy rules based on fuzzy subtractive quantum clustering. This clustering technique is not only an extension of ideas inherent to scale-space and support-vector clustering but also represents an effective prototype that exhibits certain characteristics of the target system to be modeled from the fuzzy subtractive method. Furthermore, we developed linear-regression QANFN (LR-QANFN) as an incremental model to deal with localized nonlinearities of the system, so that all modeling discrepancies can be compensated. After adopting the construction of the linear regression as the first global model, we refined it through a series of local fuzzy if-then rules in order to capture the remaining localized characteristics. The experimental results revealed that the proposed QANFN and LR-QANFN yielded a better performance in comparison with radial basis function networks and the linguistic model obtained in previous literature for an automobile mile-per-gallon prediction, Boston Housing data, and a coagulant dosing process in a water purification plant.

Can You See Me Now? Sensor Positioning for Automated and Persistent Surveillance

Feb. 2010

Most existing camera placement algorithms focus on coverage and/or visibility analysis, which ensures that the object of interest is visible in the camera's field of view (FOV). However, visibility, which is a fundamental requirement of object tracking, is insufficient for automated persistent surveillance. In such applications, a continuous consistently labeled trajectory of the same object should be maintained across different camera views. Therefore, a sufficient uniform overlap between the cameras' FOVs should be secured so that camera handoff can successfully and automatically be executed before the object of interest becomes untraceable or unidentifiable. In this paper, we propose sensor-planning methods that improve existing algorithms by adding handoff rate analysis. Observation measures are designed for various types of cameras so that the proposed sensor-planning algorithm is general and applicable to scenarios with different types of cameras. The proposed sensor-planning algorithm preserves necessary uniform overlapped FOVs between adjacent cameras for an optimal balance between coverage and handoff success rate. In addition, special considerations such as resolution and frontal-view requirements are addressed using two approaches: 1) direct constraint and 2) adaptive weights. The resulting camera placement is compared with a reference algorithm published by Erdem and Sclaroff. Significantly improved handoff success rates and frontal-view percentages are illustrated via experiments using indoor and outdoor floor plans of various scales.

Set-Membership Fuzzy Filtering for Nonlinear Discrete-Time Systems

Feb. 2010

This paper is concerned with the set-membership filtering (SMF) problem for discrete-time nonlinear systems. We employ the Takagi-Sugeno (T-S) fuzzy model to approximate the nonlinear systems over the true value of state and to overcome the difficulty with the linearization over a state estimate set rather than a state estimate point in the set-membership framework. Based on the T-S fuzzy model, we develop a new nonlinear SMF estimation method by using the fuzzy modeling approach and the S-procedure technique to determine a state estimation ellipsoid that is a set of states compatible with the measurements, the unknown-but-bounded process and measurement noises, and the modeling approximation errors. A recursive algorithm is derived for computing the ellipsoid that guarantees to contain the true state. A smallest possible estimate set is recursively computed by solving the semidefinite programming problem. An illustrative example shows the effectiveness of the proposed method for a class of discrete-time nonlinear systems via fuzzy switch.

Improving POMDP Tractability via Belief Compression and Clustering

Feb. 2010

Partially observable Markov decision process (POMDP) is a commonly adopted mathematical framework for solving planning problems in stochastic environments. However, computing the optimal policy of POMDP for large-scale problems is known to be intractable, where the high dimensionality of the underlying belief space is one of the major causes. In this paper, we propose a hybrid approach that integrates two different approaches for reducing the dimensionality of the belief space: 1) belief compression and 2) value-directed compression. In particular, a novel orthogonal nonnegative matrix factorization is derived for the belief compression, which is then integrated in a value-directed framework for computing the policy. In addition, with the conjecture that a properly partitioned belief space can have its per-cluster intrinsic dimension further reduced, we propose to apply a k-means-like clustering technique to partition the belief space to form a set of sub-POMDPs before applying the dimension reduction techniques to each of them. We have evaluated the proposed belief compression and clustering approaches based on a set of benchmark problems and demonstrated their effectiveness in reducing the cost for computing policies, with the quality of the policies being retained.

Selecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization

Feb. 2010

Feature selection plays an important role in pattern recognition and machine learning. Feature evaluation and classification complexity estimation arise as key issues in the construction of selection algorithms. To estimate classification complexity in different feature subspaces, a novel feature evaluation measure, called the neighborhood decision error rate (NDER), is proposed, which is applicable to both categorical and numerical features. We first introduce a neighborhood rough-set model to divide the sample set into decision positive regions and decision boundary regions. Then, the samples that fall within decision boundary regions are further grouped into recognizable and misclassified subsets based on class probabilities that occur in neighborhoods. The percentage of misclassified samples is viewed as the estimate of classification complexity of the corresponding feature subspaces. We present a forward greedy strategy for searching the feature subset, which minimizes the NDER and, correspondingly, minimizes the classification complexity of the selected feature subset. Both theoretical and experimental comparison with other feature selection algorithms shows that the proposed algorithm is effective for discrete and continuous features, as well as their mixture.

Cyclorotation Models for Eyes and Cameras

Feb. 2010

The human visual system obeys Listing's law, which means that the cyclorotation of the eye (around the line of sight) can be predicted from the direction of the fixation point. It is shown here that Listing's law can conveniently be formulated in terms of rotation matrices. The function that defines the observed cyclorotation is derived in this representation. Two polynomial approximations of the function are developed, and the accuracy of each model is evaluated by numerical integration over a range of gaze directions. The error of the simplest approximation for typical eye movements is less than half a degree. It is shown that, given a set of calibrated images, the effect of Listing's law can be simulated in a way that is physically consistent with the original camera. This condition is important for robotic models of human vision, which typically do not reproduce the mechanics of the oculomotor system.

Pipelined Chebyshev Functional Link Artificial Recurrent Neural Network for Nonlinear Adaptive Filter

Feb. 2010

A novel nonlinear adaptive filter with pipelined Chebyshev functional link artificial recurrent neural network (PCFLARNN) is presented in this paper, which uses a modification real-time recurrent learning algorithm. The PCFLARNN consists of a number of simple small-scale Chebyshev functional link artificial recurrent neural network (CFLARNN) modules. Compared to the standard recurrent neural network (RNN), those modules of PCFLARNN can simultaneously be performed in a pipelined parallelism fashion, and this would lead to a significant improvement in its total computational efficiency. Furthermore, contrasted with the architecture of a pipelined RNN (PRNN), each module of PCFLARNN is a CFLARNN whose nonlinearity is introduced by enhancing the input pattern with Chebyshev functional expansion, whereas the RNN of each module in PRNN utilizing linear input and first-order recurrent term only fails to utilize the high-order terms of inputs. Therefore, the performance of PCFLARNN can further be improved at the cost of a slightly increased computational complexity. In addition, due to the introduced nonlinear functional expansion of each module in PRNN, the number of input signals can be reduced. Computer simulations have demonstrated that the proposed filter performs better than PRNN and RNN for nonlinear colored signal prediction, nonstationary speech signal prediction, and chaotic time series prediction.

New Delay-Dependent Exponential $H_{infty}$ Synchronization for Uncertain Neural Networks With Mixed Time Delays

Feb. 2010

This paper establishes an exponential H _infin synchronization method for a class of uncertain master and slave neural networks (MSNNs) with mixed time delays, where the mixed delays comprise different neutral, discrete, and distributed time delays. The polytopic and the norm-bounded uncertainties are separately taken into consideration. An appropriate discretized Lyapunov-Krasovskii functional and some free-weighting matrices are utilized to establish some delay-dependent sufficient conditions for designing delayed state-feedback control as a synchronization law in terms of linear matrix inequalities under less restrictive conditions. The controller guarantees the exponential H _infin synchronization of the two coupled MSNNs regardless of their initial states. Detailed comparisons with existing results are made, and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws.

Generalized Discriminant Analysis: A Matrix Exponential Approach

Feb. 2010

Linear discriminant analysis (LDA) is well known as a powerful tool for discriminant analysis. In the case of a small training data set, however, it cannot directly be applied to high-dimensional data. This case is the so-called small-sample-size or undersampled problem. In this paper, we propose an exponential discriminant analysis (EDA) technique to overcome the undersampled problem. The advantages of EDA are that, compared with principal component analysis (PCA) + LDA, the EDA method can extract the most discriminant information that was contained in the null space of a within-class scatter matrix, and compared with another LDA extension, i.e., null-space LDA (NLDA), the discriminant information that was contained in the non-null space of the within-class scatter matrix is not discarded. Furthermore, EDA is equivalent to transforming original data into a new space by distance diffusion mapping, and then, LDA is applied in such a new space. As a result of diffusion mapping, the margin between different classes is enlarged, which is helpful in improving classification accuracy. Comparisons of experimental results on different data sets are given with respect to existing LDA extensions, including PCA + LDA, LDA via generalized singular value decomposition, regularized LDA, NLDA, and LDA via QR decomposition, which demonstrate the effectiveness of the proposed EDA method.

On Utilizing Association and Interaction Concepts for Enhancing Microaggregation in Secure Statistical Databases

Feb. 2010

This paper presents a possibly pioneering endeavor to tackle the microaggregation techniques (MATs) in secure statistical databases by resorting to the principles of associative neural networks (NNs). The prior art has improved the available solutions to the MAT by incorporating proximity information, and this approach is done by recursively reducing the size of the data set by excluding points that are farthest from the centroid and points that are closest to these farthest points. Thus, although the method is extremely effective, arguably, it uses only the proximity information while ignoring the mutual interaction between the records. In this paper, we argue that interrecord relationships can be quantified in terms of the following two entities: 1) their ldquoassociationrdquo and 2) their ldquointeraction.rdquo This case means that records that are not necessarily close to each other may still be ldquogrouped,rdquo because their mutual interaction, which is quantified by invoking transitive-closure-like operations on the latter entity, could be significant, as suggested by the theoretically sound principles of NNs. By repeatedly invoking the interrecord associations and interactions, the records are grouped into sizes of cardinality ldquok,rdquo where k is the security parameter in the algorithm. Our experimental results, which are done on artificial data and benchmark real-life data sets, demonstrate that the newly proposed method is superior to the state of the art not only based on the information loss (IL) perspective but also when it concerns a criterion that involves a combination of the IL and the disclosure risk (DR).

Distance Approximating Dimension Reduction of Riemannian Manifolds

Feb. 2010

We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geodesic distances between data points on the Riemannian manifold while preserving discrimination ability. Existing algorithms, e.g., ISOMAP, that try to learn an isometric embedding of data points on a manifold have a non-satisfactory discrimination ability in practical applications such as face and gait recognition. In this paper, we propose a two-stage algorithm named tensor-based Riemannian manifold distance-approximating projection (TRIMAP), which can quickly compute an approximately optimal projection for a given tensor data set. In the first stage, we construct a graph from labeled or unlabeled data, which correspond to the supervised and unsupervised scenario, respectively, such that we can use the graph distance to obtain an upper bound on an objective function that preserves pairwise geodesic distances. Then, we perform some tensor-based optimization of this upper bound to obtain a projection onto a low-dimensional subspace. In the second stage, we propose three different strategies to enhance the discrimination ability, i.e., make data points from different classes easier to separate and make data points in the same class more compact. Experimental results on two benchmark data sets from the University of South Florida human gait database and the Face Recognition Technology face database show that the discrimination ability of TRIMAP exceeds that of other popular algorithms. We theoretically show that TRIMAP converges. We demonstrate, through experiments on six synthetic data sets, its potential ability to unfold nonlinear manifolds in the first stage. Index Terms-Gait recognition, linear discriminant analysis, manifold learning, multilinear tensor learning.

Vaccine-Enhanced Artificial Immune System for Multimodal Function Optimization

Feb. 2010

This paper emulates a biological notion in vaccines to promote exploration in the search space for solving multimodal function optimization problems using artificial immune systems (AISs). In this method, we first divide the decision space into equal subspaces. The vaccine is then randomly extracted from each subspace. A few of these vaccines, in the form of weakened antigens, are then injected into the algorithm to enhance the exploration of global and local optima. The goal of this process is to lead the antibodies to unexplored areas. Using this biologically motivated notion, we design the vaccine-enhanced AIS for multimodal function optimization, achieving promising performance.

A Multiagent Evolutionary Algorithm for Combinatorial Optimization Problems

Feb. 2010

Based on our previous works, multiagent systems and evolutionary algorithms (EAs) are integrated to form a new algorithm for combinatorial optimization problems (CmOPs), namely, MultiAgent EA for CmOPs (MAEA-CmOPs). In MAEA-CmOPs, all agents live in a latticelike environment, with each agent fixed on a lattice point. To increase energies, all agents compete with their neighbors, and they can also increase their own energies by making use of domain knowledge. Theoretical analyses show that MAEA-CmOPs converge to global optimum solutions. Since deceptive problems are the most difficult CmOPs for EAs, in the experiments, various deceptive problems with strong linkage, weak linkage, and overlapping linkage, and more difficult ones, namely, hierarchical problems with treelike structures, are used to validate the performance of MAEA-CmOPs. The results show that MAEA-CmOP outperforms the other algorithms and has a fast convergence rate. MAEA-CmOP is also used to solve large-scale deceptive and hierarchical problems with thousands of dimensions, and the experimental results show that MAEA-CmOP obtains a good performance and has a low computational cost, which the time complexity increases in a polynomial basis with the problem size.

Adaptive Fuzzy Switched Swing-Up and Sliding Control for the Double-Pendulum-and-Cart System

Feb. 2010

In this paper, an adaptive fuzzy switched swing-up and sliding controller (AFSSSC) is proposed for the swing-up and position controls of a double-pendulum-and-cart system. The proposed AFSSSC consists of a fuzzy switching controller (FSC), an adaptive fuzzy swing-up controller (FSUC), and an adaptive hybrid fuzzy sliding controller (HFSC). To simplify the design of the adaptive HFSC, the double-pendulum-and-cart system is reformulated as a double-pendulum and a cart subsystem with matched time-varying uncertainties. In addition, an adaptive mechanism is provided to learn the parameters of the output fuzzy sets for the adaptive HFSC. The FSC is designed to smoothly switch between the adaptive FSUC and the adaptive HFSC. Moreover, the sliding mode and the stability of the fuzzy sliding control systems are guaranteed. Simulation results are included to illustrate the effectiveness of the proposed AFSSSC.

Discriminative Orthogonal Neighborhood-Preserving Projections for Classification

Feb. 2010

Orthogonal neighborhood-preserving projection (ONPP) is a recently developed orthogonal linear algorithm for overcoming the out-of-sample problem existing in the well-known manifold learning algorithm, i.e., locally linear embedding. It has been shown that ONPP is a strong analyzer of high-dimensional data. However, when applied to classification problems in a supervised setting, ONPP only focuses on the intraclass geometrical information while ignores the interaction of samples from different classes. To enhance the performance of ONPP in classification, a new algorithm termed discriminative ONPP (DONPP) is proposed in this paper. DONPP 1) takes into account both intraclass and interclass geometries; 2) considers the neighborhood information of interclass relationships; and 3) follows the orthogonality property of ONPP. Furthermore, DONPP is extended to the semisupervised case, i.e., semisupervised DONPP (SDONPP). This uses unlabeled samples to improve the classification accuracy of the original DONPP. Empirical studies demonstrate the effectiveness of both DONPP and SDONPP.

IEEE Foundation

Feb. 2010

IEEE Systems, Man, and Cybernetics Society Information

Feb. 2010

IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics information for authors

Feb. 2010

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on - new TOC

Table of Contents

IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics publication information

Editorial

Adaptive and Learning Systems

Solving Multiconstraint Assignment Problems Using Learning Automata

A Team of Continuous-Action Learning Automata for Noise-Tolerant Learning of Half-Spaces

Modeling a Student–Classroom Interaction in a Tutorial-Like System Using Learning Automata

Standalone CMAC Control System With Online Learning Ability

Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications

Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution

Biomimetic Approach to Tacit Learning Based on Compound Control

Development of Quantum-Based Adaptive Neuro-Fuzzy Networks

Can You See Me Now? Sensor Positioning for Automated and Persistent Surveillance

Set-Membership Fuzzy Filtering for Nonlinear Discrete-Time Systems

Improving POMDP Tractability via Belief Compression and Clustering

Selecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization

Cyclorotation Models for Eyes and Cameras

Pipelined Chebyshev Functional Link Artificial Recurrent Neural Network for Nonlinear Adaptive Filter

New Delay-Dependent Exponential $H_{infty}$ Synchronization for Uncertain Neural Networks With Mixed Time Delays

Generalized Discriminant Analysis: A Matrix Exponential Approach

On Utilizing Association and Interaction Concepts for Enhancing Microaggregation in Secure Statistical Databases

Distance Approximating Dimension Reduction of Riemannian Manifolds

Vaccine-Enhanced Artificial Immune System for Multimodal Function Optimization

A Multiagent Evolutionary Algorithm for Combinatorial Optimization Problems

Adaptive Fuzzy Switched Swing-Up and Sliding Control for the Double-Pendulum-and-Cart System

Discriminative Orthogonal Neighborhood-Preserving Projections for Classification

IEEE Foundation

IEEE Systems, Man, and Cybernetics Society Information

IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics information for authors