Adaptive networks for physical modeling

This paper presents an original link between neural networks theory and mechanical modeling networks. The problem is to find the parameters characterizing mechanical structures in order to reproduce given mechanical behaviors. Replacing “neural” units with mechanically based units and applying classical learning algorithms dedicated to supervised dynamic networks to these mechanical networks allows us to find the parameters for a physical model. Some new variants of real-time recurrent learning (RTRL) are also introduced, based on mechanical principles.

The notion of interaction during learning is discussed at length and the results of tests are presented. Instead of the classical {machine learning system, environment} pair, we propose to study the {machine learning system, human operator, environment} triplet.

Experiments have been carried out in simulated scenarios and some original experiments with a force-feedback device are also described.     

Adaptive iterative learning control for robot manipulators

In this paper, we propose some adaptive iterative learning control (ILC) schemes for trajectory tracking of rigid robot manipulators, with unknown parameters, performing repetitive tasks. The proposed control schemes are based upon the use of a proportional-derivative (PD) feedback structure, for which an iterative term is added to cope with the unknown parameters and disturbances. The control design is very simple in the sense that the only requirement on the PD and learning gains is the positive definiteness condition and the bounds of the robot parameters are not needed. In contrast to classical ILC schemes where the number of iterative variables is generally equal to the number of control inputs, the second controller proposed in this paper uses just two iterative variables, which is an interesting fact from a practical point of view since it contributes considerably to memory space saving in real-time implementations. We also show that it is possible to use a single iterative variable in the control scheme if some bounds of the system parameters are known. Furthermore, the resetting condition is relaxed to a certain extent for a certain class of reference trajectories. Finally, simulation results are provided to illustrate the effectiveness of the proposed controllers.     

基于模糊竞争学习的非线性系统自适应模糊建模方法

提出了一种新的基于模糊竞争学习的自调整的模糊建模方法. 基于模糊竞争学习, 模糊系统能够进行自适应模糊推理. 在被调整模糊系统基础上, 提出了一种非线性系统在线估计参数的在线辨识算法. 为了证明提出算法的有效性, 最后给出了几个例子的仿真结果.     

Event rates and aggregation in hierarchical discrete event systems

A discrete event system (DES) is a dynamical system whose evolution in time develops as the result of the occurrence of physical events at possibly irregular time intervals. Although many DES's operation is asynchronous, others have dynamics which depend on a clock or some other complex timing schedule. Here we provide a formal representation of the advancement of time for logical DES via interpretations of time. We show that the interpretations of time along with a timing structure provide a framework to study principles of the advancement of time for hierarchical DES (HDES). In particular, it is shown that for a wide class of HDES the event rate is higher for DES at the lower levels of the hierarchy than at the higher levels of the hierarchy. Relationships between event rate and event aggregation are shown. We define a measure for event aggregation and show that there exists an inverse relationship between the amount of event aggregation and the event rate at any two successive levels in a class of HDES. Next, we study how to design the timing structure to ensure that there will be a decrease in the event rate (by some constant factor) between any two levels of a wide class of HDES. It is shown that if the communications between the various DES in the HDES satisfy a certain admissibility condition then there will be a decrease in the event rate. These results for HDES constitute the main results of this paper, since they provide the first mathematical characterization of the relationship between event aggregation and event rates of the HDES and show how to design the interconnections in a HDES to achieve event rate reduction. Several examples are provided to illustrate the results.The authors gratefully acknowledge the partial support of the Jet Propulsion Laboratory. Please address all correspondence to K. Passino (email: passino@eagle.eng.ohio-state.edu).     

机器学习中自适应k值的k均值算法改进

针对k-means算法对于远离群点敏感和k值难以确定等缺陷,在分析已有的k-means改进算法的基础上,引进肘部法则的思想对数据进行优化处理并且根据自适应思想结合误差平方和SSE(sum of squared error),提出一种自适应调整k值的k-means改进算法。选取机器学习库中的真实数据集进行仿真实验,其结果表明,改进后的k-means算法中的剔除远离群点和自适应调整k值的方法均可行,准确性高、聚类效果质量更优。     

雪深超声回波信号的自适应滤波建模方法

针对现阶段获取积雪数据准确度不高的问题,根据超声回波信号特征并结合建模方法和现代数字信号处理技术,提出一种积雪超声回波信号的自适应滤波建模方法,利用包络检波算法和曲线拟合对回波信号包络中的确定性信号进行拟合并结合自适应滤波算法,在误差信号的反馈下通过迭代使输入信号逼近参考信号,改变输入信号幅值和频率也可以稳定地收敛。通过这种方法可以合成积雪回波信号,准确描述雪盖的层理结构,有效地降低了噪声干扰,拟合匹配度得到提高。     

Adaptive personalized recommendation based on adaptive learning

Collaborative filtering has been widely applied in many fields in recent years due to the increase in web-based activities such as e-commerce and online content distribution. Current collaborative filtering techniques such as correlation-based, SVD-based and supervised learning-based approaches provide good accuracy, but are computationally very expensive and can only be deployed in static off-line settings, where the known rating information does not change with time. However, a number of practical scenarios require dynamic adaptive collaborative filtering that can allow new users, items and ratings to enter the system at a rapid rate. In this paper, we consider a novel adaptive personalized recommendation based on adaptive learning. Fast adaptive learning runs through all the aspects of the proposed approach, including training, prediction and updating. Empirical evaluation of our approach on Movielens dataset demonstrates that it is possible to obtain accuracy comparable to that of the correlation-based, SVD-based and supervised learning-based approaches at a much lower computational cost.     

Adaptive learning algorithm of self-organizing teams

In order to improve the ability of achieving good performance in self-organizing teams, this paper presents a self-adaptive learning algorithm for team members. Members of the self-organizing teams are simulated by agents. In the virtual self-organizing team, agents adapt their knowledge according to cooperative principles. The self-adaptive learning algorithm is approached to learn from other agents with minimal costs and improve the performance of the self-organizing team. In the algorithm, agents learn how to behave (choose different game strategies) and how much to think about how to behave (choose the learning radius). The virtual team is self-adaptively improved according to the strategies’ ability of generating better quality solutions in the past generations. Six basic experiments are manipulated to prove the validity of the adaptive learning algorithm. It is found that the adaptive learning algorithm often causes agents to converge to optimal actions, based on agents’ continually updated cognitive maps of how actions influence the performance of the virtual self-organizing team. This paper considered the influence of relationships in self-organizing teams over existing works. It is illustrated that the adaptive learning algorithm is beneficial to both the development of self-organizing teams and the performance of the individual agent.     

Data spread-based entropy clustering method using adaptive learning

Clustering analysis is to identify inherent structures and discover useful information from large amount of data. However, the decision makers may suffer insufficient understanding the nature of the data and do not know how to set the optimal parameters for the clustering method. To overcome the drawback above, this paper proposes a new entropy clustering method using adaptive learning. The proposed method considers the data spreading to determine the adaptive threshold within parameters optimized by adaptive learning. Four datasets in UCI database are used as the experimental data to compare the accuracy of the proposed method with the listing clustering methods. The experimental results indicate that the proposed method is superior to the listing methods.     

基于正交最小二乘和UD分解的模糊建模方法

通过改进模糊聚类方法确定模糊模型的前件结构，并对模糊推理关系矩阵进行正交最小二乘估计。通过分析正交向量在模型中贡献的大小确定聚类规则的有效性，然后采用基于UD分解的最小二乘确定模糊模型的后件参数，实现模糊模型的结构和参数的优化。该方法已成功地应用于Box-Jenkins煤气炉的数据系统建模。     

Adaptive sampling design for multi-task learning of Gaussian processes in manufacturing

Approximation models (or surrogate models) have been widely used in engineering problems to mitigate the cost of running expensive experiments or simulations. Gaussian processes (GPs) are a popular tool used to construct these models due to their flexibility and computational tractability. The accuracy of these models is a strong function of the density and locations of the sampled points in the parametric space used for training. Previously, multi-task learning (MTL) has been used to learn similar-but-not-identical tasks together, thus increasing the effective density of training points. Also, several adaptive sampling strategies have been developed to identify regions of interest for intelligent sampling in single-task learning of GPs. While both these methods have addressed the density and location constraint separately, sampling design approaches for MTL are lacking. In this paper, we formulate an adaptive sampling strategy for MTL of GPs, thereby further improving data efficiency and modeling performance in GP. To this end, we develop variance measures for an MTL framework to effectively identify optimal sampling locations while learning multiple tasks simultaneously. We demonstrate the effectiveness of the proposed method using a case study on a real-world engine surface dataset. We observe that the proposed method leverages both MTL and intelligent sampling to significantly outperform state-of-the-art methods which use either approach separately. The developed sampling design strategy is readily applicable to many problems in various fields.     

Adaptive partial graph learning and fusion for incomplete multi-view clustering

Most of existing multi-view clustering methods assume that different feature views of data are fully observed. However, it is common that only portions of data features can be obtained in many practical applications. The presence of incomplete feature views hinders the performance of the conventional multi-view clustering methods to a large extent. Recently proposed incomplete multi-view clustering methods often focus on directly learning a common representation or a consensus affinity similarity graph from available feature views while ignore the valuable information hidden in the missing views. In this study, we present a novel incomplete multi-view clustering method via adaptive partial graph learning and fusion (APGLF), which can capture the local data structure of both within-view and cross-view. Specifically, we use the available data of each view to learn a corresponding view-specific partial graph, in which the within-view local structure can be well preserved. Then we design a cross-view graph fusion term to learn a consensus complete graph for different views, which can take advantage of the complementary information hidden in the view-specific partial graphs learned from incomplete views. In addition, a rank constraint is imposed on the graph Laplacian matrix of the fused graph to better recover the optimal cluster structure of original data. Therefore, APGLF integrates within-view partial graph learning, cross-view partial graph fusion and cluster structure recovering into a unified framework. Experiments on five incomplete multi-view data sets are conducted to validate the efficacy of APGLF when compared with eight state-of-the-art methods.     

Adaptive fuzzy inference neural network

An adaptive fuzzy inference neural network (AFINN) is proposed in this paper. It has self-construction ability, parameter estimation ability and rule extraction ability. The structure of AFINN is formed by the following four phases: (1) initial rule creation, (2) selection of important input elements, (3) identification of the network structure and (4) parameter estimation using LMS (least-mean square) algorithm. When the number of input dimension is large, the conventional fuzzy systems often cannot handle the task correctly because the degree of each rule becomes too small. AFINN solves such a problem by modification of the learning and inference algorithm.     

A fuzzy modeling method via Enhanced Objective Cluster Analysis for designing TSK model

This paper proposes a fuzzy modeling method via Enhanced Objective Cluster Analysis to obtain the compact and robust approximate TSK fuzzy model. In our approach, the Objective Cluster Analysis algorithm is introduced. In order to obtain more compact and more robust fuzzy rule prototypes, this algorithm is enhanced by introducing the Relative Dissimilarity Measure and the new consistency criterion to represent the similarity degree between the clusters. By these additional criteria, the redundant clusters caused by iterations are avoided; the subjective influence from human judgment for clustering is weakened. Moreover the clustering results including the number of clusters and the cluster centers are considered as the initial condition of the premise parameters identification. Thus the traditional iteration modeling procedure for determining the number of rules and identifying parameters is changed into one-off modeling, which significantly reduces the burden of computation. Furthermore the decomposition errors and the approximation errors resulted from premise parameters identification by Fuzzy c-Means clustering are decreased. For the consequence parameters identification, the Stable Kalman Filter algorithm is adopted. The performance of the proposed modeling method is evaluated by the example of Box–Jenkins gas furnace. The simulation results demonstrate the power of our model.     

Adaptive immunity based reinforcement learning

Recently much attention has been paid to intelligent systems which can adapt themselves to dynamic and/or unknown environments by the use of learning methods. However, traditional learning methods have a disadvantage that learning requires enormously long amounts of time with the degree of complexity of systems and environments to be considered. We thus propose a novel reinforcement learning method based on adaptive immunity. Our proposed method can provide a near-optimal solution with less learning time by self-learning using the concept of adaptive immunity. The validity of our method is demonstrated through some simulations with Sutton’s maze problem. This work was present in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Adaptive fuzzy identification and predictive control for industrial processes

This paper proposes a method for adaptive identification and control for industrial applications. The learning of a T–S fuzzy model is performed from input/output data to approximate unknown nonlinear processes by a hierarchical genetic algorithm (HGA). The HGA approach is composed by five hierarchical levels where the following parameters of the T–S fuzzy system are learned: input variables and their respective time delays, antecedent fuzzy sets, consequent parameters, and fuzzy rules. In order to reduce the computational cost and increase the algorithm’s performance an initialization method is applied on HGA. To deal with nonlinear plants and time-varying processes, the T–S fuzzy model is adapted online to maintain the quality of the identification/control. The identification methodology is proposed for two application problems: (1) the design of data-driven soft sensors, and (2) the learning of a model for the Generalized predictive control (GPC) algorithm. The integration of the proposed adaptive identification method with the GPC results in an effective adaptive predictive fuzzy control methodology. To validate and demonstrate the performance and effectiveness of the proposed methodologies, they are applied on identification of a model for the estimation of the flour concentration in the effluent of a real-world wastewater treatment system; and on control of a simulated continuous stirred tank reactor (CSTR) and on a real experimental setup composed of two coupled DC motors. The results are presented, showing that the developed evolving T–S fuzzy model can identify the nonlinear systems satisfactorily and it can be used successfully as a prediction model of the process for the GPC controller.     

应用自适应神经模糊推理系统(ANFIS)进行建模与仿真

模糊规划的提取和隶属度函数的学习是模糊推理系统设计中重要而困难的问题，自适应神经模糊推理系统（ANFIS）方法基于Sugeno模糊模型，其结构类似于神经网络，采用反向传播算法和最小二乘法调整模糊推理系统的参数，并能自动产生模糊规划，本文应用该方法给出了对一个典型系统建模的仿真实例，取得了良好的效果。     

Fuzzy-based Adaptive Routing Algorithm for Networks-on-Chip

In this paper, we propose two adaptive routing algorithms to alleviate congestion in the network. In the first algorithm, the routing decision is assisted by the number of occupied buffer slots at the corresponding input buffer of the next router and the congestion level of that router. Although this algorithm performs better than the conventional method, DyXY, in some cases the proposed algorithm leads to non-optimal decisions. Fuzzy controllers compensate for ambiguities in the data by giving a level of confidence rather than declaring the data simply true or false. To make a better routing decision, we propose an adaptive routing algorithm based on fuzzy logic for Networks-on-chip where the routing path is determined based on the current condition of the network. The proposed algorithm avoids congestion by distributing traffic over the routers that are less congested or have a spare capacity. The output of the fuzzy controller is the congestion level, so that at each router, the neighboring router with the lowest congestion value is chosen for routing a packet. To evaluate the proposed routing method, we use two multimedia applications and two synthetic traffic profiles. The experimental results show that the fuzzy-based routing scheme improves the performance over the DyXY routing algorithm by up to 25% with a negligible hardware overhead.     

改进型RBF神经网络的多标签算法研究

针对已有的RBF神经网络多标签算法未充分考虑多个样本标签之间的关联性,从而导致泛化性能受到一定影响的问题,研究分析了一种改进型RBF神经网络的多标签算法.该算法首先优化隐含层RBF神经网络基函数中心求取算法——k-均值聚类.采用AP聚类自动寻找k值以获得隐含层节点数目,并构造Huff man树来选取初始聚类中心以防k-均值聚类结果陷入局部最优.然后构造体现标签类之间信息的标签计数向量C,并将其与由优化k-均值聚类得到的聚类中心进行线性叠乘,进而改进RBF神经网络基函数中心,建立RBF神经网络.在公共多标签数据集emotion上的实验表明了该算法能够有效地进行多标签分类.