A Fuzzy Approximation Scheme for Sequential Learning in Pattern Recognition

An adaptive learning scheme, based on a fuzzy approximation to the gradient descent method for training a pattern classifier using unlabeled samples, is described. The objective function defined for the fuzzy ISODATA clustering procedure is used as the loss function for computing the gradient. Learning is based on simultaneous fuzzy decisionmaking and estimation. It uses conditional fuzzy measures on unlabeled samples. An exponential membership function is assumed for each class, and the parameters constituting these membership functions are estimated, using the gradient, in a recursive fashion. The induced possibility of occurrence of each class is useful for estimation and is computed using 1) the membership of the new sample in that class and 2) the previously computed average possibility of occurrence of the same class. An inductive entropy measure is defined in terms of induced possibility distribution to measure the extent of learning. The method is illustrated with relevant examples.

Computationally efficient sequential learning algorithms for direct link resource-allocating networks

Computionally efficient sequential learning algorithms are developed for direct-link resource-allocating networks (DRANs). These are achieved by decomposing existing recursive training algorithms on a layer by layer and neuron by neuron basis. This allows network weights to be updated in an efficient parallel manner and facilitates the implementation of minimal update extensions that yield a significant reduction in computation load per iteration compared to existing sequential learning methods employed in resource-allocation network (RAN) and minimal RAN (MRAN) approaches. The new algorithms, which also incorporate a pruning strategy to control network growth, are evaluated on three different system identification benchmark problems and shown to outperform existing methods both in terms of training error convergence and computational efficiency. (c) 2005 Elsevier B.V. All rights reserved.

Client learning and the performance of collaborative infrastructure projects

Australia is a leading user of collaborative procurement methods, which are used to deliver large and complex infrastructure projects. Project alliances, Early Contractor Involvement (ECI), and partnering are typical examples of collaborative procurement models. In order to increase procurement effectiveness and value for money (VfM), clients have adopted various learning strategies for new contract development. However client learning strategies and behaviours have not been systematically analysed before. Therefore, the current paper undertakes a literature review addressing the research question “How can client learning capabilities be effectively understood?”. From the resource-based and dynamic capability perspectives, this paper proposes that the collaborative learning capability (CLC) of clients drives procurement model evolution. Learning routines underpinning CLC carry out exploratory, transformative and exploitative learning phases associated with collaborative project delivery. This learning improves operating routines, and ultimately performance. The conceptualization of CLC and the three sequential learning phases is used to analyse the evidence in the construction management literature. The main contribution of this study is the presentation of a theoretical foundation for future empirical studies to unveil effective learning strategies, which help clients to improve the performance of collaborative projects in the dynamic infrastructure market.

A hierarchical system of learning automata that can learn die globally optimal path

Systems of learning automata have been studied by various researchers to evolve useful strategies for decision making under uncertainity. Considered in this paper are a class of hierarchical systems of learning automata where the system gets responses from its environment at each level of the hierarchy. A classification of such sequential learning tasks based on the complexity of the learning problem is presented. It is shown that none of the existing algorithms can perform in the most general type of hierarchical problem. An algorithm for learning the globally optimal path in this general setting is presented, and its convergence is established. This algorithm needs information transfer from the lower levels to the higher levels. Using the methodology of estimator algorithms, this model can be generalized to accommodate other kinds of hierarchical learning tasks.