Learning and approximation
Author(s)
Bibliographic Information
Learning and approximation
(Studies in computational intelligence, v. 201 . Foundations of computational intelligence ; v. 1)
Springer, c2009
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references and index
Description and Table of Contents
Description
Foundations of Computational Intelligence Volume 1: Learning and Approximation: Theoretical Foundations and Applications 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, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approxi- tion 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 C- putational 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 inc- poration of different mechanisms of Computational Intelligent dealing with Lea- ing 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.
Table of Contents
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.
by "Nielsen BookData"