Hierarchical Fuzzy Systems for Function Approximation on Discrete Input Spaces With Application

This paper investigates the capabilities of hierarchical fuzzy systems to approximate functions on discrete input spaces. First, it is shown that any function on a discrete space has an arbitrary separable hierarchical structure and can be naturally approximated by hierarchical fuzzy systems. As a by-product of this result, a discrete version of Kolmogorov's theorem is obtained; second, it is proven that any function on a discrete space can be approximated to any degree of accuracy by hierarchical fuzzy systems with any desired separable hierarchical structure. That is, functions on discrete spaces can be approximated more simply and flexibly than those on continuous spaces; third, a hierarchical fuzzy system identification method is proposed in which human knowledge and numerical data are combined for system construction and identification. Finally, the proposed method is applied to the market condition performance modeling problem in site selection decision support and shows the better performance in both accuracy and interpretability than the regression and neural network approaches. In additions, the reason and mechanism why hierarchical fuzzy systems outperform regression and neural networks in this type of application are analyzed.

I. Introduction

The main motivations for our research in hierarchical fuzzy systems for function approximation on discrete input spaces are as follows.