Foundations of Computational, Intelligence Volume 1 [electronic resource] : Learning and Approximation / edited by Aboul-Ella Hassanien, Ajith Abraham, Athanasios V. Vasilakos, Witold Pedrycz.Material type: TextLanguage: English Series: Studies in Computational Intelligence: 201Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009Description: XII, 400 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642010828Subject(s): Engineering | Artificial intelligence | Engineering mathematics | Engineering | Appl.Mathematics/Computational Methods of Engineering | Artificial Intelligence (incl. Robotics)Additional physical formats: Printed edition:: No titleDDC classification: 519 LOC classification: TA329-348TA640-643Online resources: Click here to access online
Function Approximation -- Machine Learning and Genetic Regulatory Networks: A Review and a Roadmap -- Automatic Approximation of Expensive Functions with Active Learning -- New Multi-Objective Algorithms for Neural Network Training Applied to Genomic Classification Data -- An Evolutionary Approximation for the Coefficients of Decision Functions within a Support Vector Machine Learning Strategy -- Connectionist Learning -- Meta-learning and Neurocomputing – A New Perspective for Computational Intelligence -- Three-Term Fuzzy Back-Propagation -- Entropy Guided Transformation Learning -- Artificial Development -- Robust Training of Artificial Feedforward Neural Networks -- Workload Assignment in Production Networks by Multi Agent Architecture -- Knowledge Representation and Acquisition -- Extensions to Knowledge Acquisition and Effect of Multimodal Representation in Unsupervised Learning -- A New Implementation for Neural Networks in Fourier-Space -- Learning and Visualization -- Dissimilarity Analysis and Application to Visual Comparisons -- Dynamic Self-Organising Maps: Theory, Methods and Applications -- Hybrid Learning Enhancement of RBF Network with Particle Swarm Optimization.
Learning methods and approximation algorithms are fundamental tools that deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems have a large number of applications arising from a variety of fields, such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, scheduling problems and so on. The past years have witnessed a large number of interesting applications using various techniques of Computational Intelligence such as rough sets, connectionist learning; fuzzy logic; evolutionary computing; artificial immune systems; swarm intelligence; reinforcement learning, intelligent multimedia processing etc.. In spite of numerous successful applications of Computational Intelligence in business and industry, it is sometimes difficult to explain the performance of these techniques and algorithms from a theoretical perspective. Therefore, we encouraged authors to present original ideas dealing with the incorporation of different mechanisms of Computational Intelligent dealing with Learning and Approximation algorithms and underlying processes. This edited volume comprises 15 chapters, including an overview chapter, which provides an up-to-date and state-of-the art research on the application of Computational Intelligence for learning and approximation.