• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Functional equivalence between radial basis function networks and fuzzy inference systems (1993)

by J-S R Jang, C-T Sun
Venue:IEEE Trans. Neural Netw
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 77
Next 10 →

ANFIS: Adaptive-Network-Based Fuzzy Inference System

by Jyh-shing Roger Jang , 1993
"... This paper presents the architecture and learning procedure underlying ANFIS (AdaptiveNetwork -based Fuzzy Inference System), a fuzzy inference system implemented in the framework of adaptive networks. By using a hybrid learning procedure, the proposed ANFIS can construct an input-output mapping bas ..."
Abstract - Cited by 323 (5 self) - Add to MetaCart
This paper presents the architecture and learning procedure underlying ANFIS (AdaptiveNetwork -based Fuzzy Inference System), a fuzzy inference system implemented in the framework of adaptive networks. By using a hybrid learning procedure, the proposed ANFIS can construct an input-output mapping based on both human knowledge (in the form of fuzzy if-then rules) and stipulated input-output data pairs. In our simulation, we employ the ANFIS architecture to model nonlinear functions, identify nonlinear components on-linely in a control system, and predict a chaotic time series, all yielding remarkable results. Comparisons with artificail neural networks and earlier work on fuzzy modeling are listed and discussed. Other extensions of the proposed ANFIS and promising applications to automatic control and signal processing are also suggested. 1 Introduction System modeling based on conventional mathematical tools (e.g., differential equations) is not well suited for dealing with ill-define...

Neuro-Fuzzy Modeling and Control

by Jyh-Shing Roger Jang, Chuen-Tsai Sun - PROCEEDINGS OF THE IEEE , 1995
"... Fundamental and advanced developments in neuro-fuzzy synergisms for modeling and control are reviewed. The essential part of neuro-fuzzy synergisms comes from a common framework called adaptive networks, which unifies both neural networks and fuzzy models. The fuzzy models under the framework of ada ..."
Abstract - Cited by 110 (1 self) - Add to MetaCart
Fundamental and advanced developments in neuro-fuzzy synergisms for modeling and control are reviewed. The essential part of neuro-fuzzy synergisms comes from a common framework called adaptive networks, which unifies both neural networks and fuzzy models. The fuzzy models under the framework of adaptive networks is called ANFIS (Adaptive-Network-based Fuzzy Inference System), which possess certain advantages over neural networks. We introduce the design methods for ANFIS in both modeling and control applications. Current problems and future directions for neuro-fuzzy approaches are also addressed.

A new methodology of extraction, optimization and application of crisp and fuzzy logical rules

by Włodzisław Duch, Rafał Adamczak , Krzysztof Grabczewski - IEEE TRANSACTIONS ON NEURAL NETWORKS , 2001
"... A new methodology of extraction, optimization, and application of sets of logical rules is described. Neural networks are used for initial rule extraction, local, or global minimization procedures for optimization, and Gaussian uncertainties of measurements are assumed during application of logical ..."
Abstract - Cited by 46 (23 self) - Add to MetaCart
A new methodology of extraction, optimization, and application of sets of logical rules is described. Neural networks are used for initial rule extraction, local, or global minimization procedures for optimization, and Gaussian uncertainties of measurements are assumed during application of logical rules. Algorithms for extraction of logical rules from data with real-valued features require determination of linguistic variables or membership functions. Context-dependent membership functions for crisp and fuzzy linguistic variables are introduced and methods of their determination described. Several neural and machine learning methods of logical rule extraction generating initial rules are described, based on constrained multilayer perceptron, networks with localized transfer functions or on separability criteria for determination of linguistic variables. A tradeoff between accuracy/simplicity is explored at the rule extraction stage and between rejection/error level at the optimization stage. Gaussian uncertainties of measurements are assumed during application of crisp logical rules, leading to “soft trapezoidal” membership functions and allowing to optimize the linguistic variables using gradient procedures. Numerous applications of this methodology to benchmark and real-life problems are reported and very simple crisp logical rules for many datasets provided.

Soft Computing: the Convergence of Emerging Reasoning Technologies

by Piero P. Bonissone - Soft Computing , 1997
"... The term Soft Computing (SC) represents the combination of emerging problem-solving technologies such as Fuzzy Logic (FL), Probabilistic Reasoning (PR), Neural Networks (NNs), and Genetic Algorithms (GAs). Each of these technologies provide us with complementary reasoning and searching methods to so ..."
Abstract - Cited by 35 (5 self) - Add to MetaCart
The term Soft Computing (SC) represents the combination of emerging problem-solving technologies such as Fuzzy Logic (FL), Probabilistic Reasoning (PR), Neural Networks (NNs), and Genetic Algorithms (GAs). Each of these technologies provide us with complementary reasoning and searching methods to solve complex, real-world problems. After a brief description of each of these technologies, we will analyze some of their most useful combinations, such as the use of FL to control GAs and NNs parameters; the application of GAs to evolve NNs (topologies or weights) or to tune FL controllers; and the implementation of FL controllers as NNs tuned by backpropagation-type algorithms.

Hybrid Neural Systems

by Stefan Wermter, Ron Sun , 2000
"... This chapter provides an introduction to the field of hybrid neural systems. Hybrid neural systems are computational systems which are based mainly on artificial neural networks but also allow a symbolic interpretation, or interaction with symbolic components. In this overview, we will describe rece ..."
Abstract - Cited by 34 (9 self) - Add to MetaCart
This chapter provides an introduction to the field of hybrid neural systems. Hybrid neural systems are computational systems which are based mainly on artificial neural networks but also allow a symbolic interpretation, or interaction with symbolic components. In this overview, we will describe recent results of hybrid neural systems. We will give a brief overview of the main methods used, outline the work that is presented here, and provide additional references. We will also highlight some important general issues and trends.

Hybrid neural systems: from simple coupling to fully integrated neural networks

by Kenneth Mcgarry, Stefan Wermter, John Macintyre - Neural Computing Surveys , 1999
"... This paper describes techniques for integrating neural networks and symbolic components into powerful hybrid systems. Neural networks have unique processing characteristics that enable tasks to be performed that would be di cult or intractable for a symbolic rule-based system. However, a stand-alone ..."
Abstract - Cited by 26 (6 self) - Add to MetaCart
This paper describes techniques for integrating neural networks and symbolic components into powerful hybrid systems. Neural networks have unique processing characteristics that enable tasks to be performed that would be di cult or intractable for a symbolic rule-based system. However, a stand-alone neural network requires an interpretation either by ahuman or a rulebased system. This motivates the integration of neural/symbolic techniques within a hybrid system. Anumber of integration possibilities exist: some systems consist of neural network components performing symbolic tasks while other systems are composed of several neural networks and symbolic components, each component acting as a self-contained module communicating with the others. Other hybrid systems are able to transform subsymbolic representations into symbolic ones and vice-versa. This paper providesanoverview and evaluation of the state of the artofseveral hybrid neural systems for rule-based processing. 1

Extraction of logical rules from backpropagation networks

by Włodzisław Duch Rafał Adamczak - Neural Processing Lett , 1998
"... networks ..."
Abstract - Cited by 20 (17 self) - Add to MetaCart
Abstract not found

Computational Intelligence Methods for Rule-Based Data Understanding

by Wlodzislaw Duch, Rudy Setiono, Jacek M. Zurada - PROCEEDINGS OF THE IEEE , 2004
"... ... This paper is focused on the extraction and use of logical rules for data understanding. All aspects of rule generation, optimization, and application are described, including the problem of finding good symbolic descriptors for continuous data, tradeoffs between accuracy and simplicity at the r ..."
Abstract - Cited by 19 (3 self) - Add to MetaCart
... This paper is focused on the extraction and use of logical rules for data understanding. All aspects of rule generation, optimization, and application are described, including the problem of finding good symbolic descriptors for continuous data, tradeoffs between accuracy and simplicity at the rule-extraction stage, and tradeoffs between rejection and error level at the rule optimization stage. Stability of rule-based description, calculation of probabilities from rules, and other related issues are also discussed. Major approaches to extraction of logical rules based on neural networks, decision trees, machine learning, and statistical methods are introduced. Optimization and application issues for sets of logical rules are described. Applications of such methods to benchmark and real-life problems are reported and illustrated with simple logical rules for many datasets. Challenges and new directions for research are outlined.

The Shape of Fuzzy Sets in Adaptive Function Approximation

by Sanya Mitaim, Bart Kosko , 2001
"... The shape of if-part fuzzy sets affects how well feedforward fuzzy systems approximate continuous functions. We explore a wide range of candidate if-part sets and derive supervised learning laws that tune them. Then we test how well the resulting adaptive fuzzy systems approximate a battery of test ..."
Abstract - Cited by 18 (3 self) - Add to MetaCart
The shape of if-part fuzzy sets affects how well feedforward fuzzy systems approximate continuous functions. We explore a wide range of candidate if-part sets and derive supervised learning laws that tune them. Then we test how well the resulting adaptive fuzzy systems approximate a battery of test functions. No one set shape emerges as the best shape. The sinc function often does well and has a tractable learning law. But its undulating sidelobes may have no linguistic meaning. This suggests that the engineering goal of function-approximation accuracy may sometimes have to outweigh the linguistic or philosophical interpretations of fuzzy sets that have accompanied their use in expert systems. We divide the if-part sets into two large classes. The first class consists of-dimensional joint sets that factor into scalar sets as found in almost all published fuzzy systems. These sets ignore the correlations among vector components of input vectors. Fuzzy systems that use factorable if-part sets suffer in general from exponential rule explosion in high dimensions when they blindly approximate functions without knowledge of the functions. The factorable fuzzy sets themselves also suffer from what we call the second curse of dimensionality: The fuzzy sets tend to become binary spikes in high dimension. The second class of if-part sets consists of the more general but less common-dimensional joint sets that do not factor into scalar fuzzy sets. We present a method for constructing such unfactorable joint sets from scalar distance measures. Fuzzy systems that use unfactorable if-part sets need not suffer from exponential rule explosion but their increased complexity may lead to intractable learning laws and inscrutable if-then rules. We prove that some of these unfactorable join...

Fuzzy Rule Based Modeling As A Universal Approximation Tool

by V. Kreinovich, G. C. Mouzouris , 1996
"... INTRODUCTION 1.1. WHY UNIVERSAL APPROXIMATION In some cases, fuzzy rule based model needs tuning. If we have applied some version of fuzzy rule based modeling, and the resulting model is satisfactory, great. But sometimes, the resulting model is not of very high quality: \Gamma we may have misint ..."
Abstract - Cited by 16 (12 self) - Add to MetaCart
INTRODUCTION 1.1. WHY UNIVERSAL APPROXIMATION In some cases, fuzzy rule based model needs tuning. If we have applied some version of fuzzy rule based modeling, and the resulting model is satisfactory, great. But sometimes, the resulting model is not of very high quality: \Gamma we may have misinterpreted some of the expert's rules; \Gamma we may have missed some of the important rules. So, to improve the quality of the resulting model, we must either: \Gamma re-interpret the existing rules, or \Gamma ask the experts for extra rules. 2 V. KREINOVICH ET AL. Before we start tuning, we want to make sure that tuning will help. In order to make sure that this "tuning" will always help, we must guarantee that by appropriate tuning, we will be able to change the initial (not very successful) model into a successful one. To guarantee that the fuzzy rule based modeling me
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University