Online Evolving TSK fuzzy identification

Kyoung-Jung Kim, Chang‐Woo Park, Euntai Kim, Mignon ParkJournal of Korean Institute of Intelligent Systems 2005 · DOI

Abstract

This paper presents an online identification algorithm for Takagi-Sugeno-Kang (TSK) fuzzy models. The proposed algorithm identifies the structure of the premise part using distance metrics and obtains the parameters of the piecewise linear functions in the consequent part using recursive least squares (RLS). While most existing research considers only the input space for structure identification, the proposed algorithm incorporates both input and output spaces. This dual-space approach effectively excludes outliers during clustering. Furthermore, unlike many existing algorithms that use sample data points as fixed cluster centers—making them sensitive to noise—the proposed method dynamically updates centers, enhancing robustness. The model is obtained in a single pass without requiring extensive data storage.

Introduction

Identifying the structure of nonlinear systems in real-time is a cornerstone of modern control theory and signal processing. TSK fuzzy models are particularly effective for this task as they bridge the gap between the interpretability of fuzzy logic and the precision of local linear models. However, traditional online identification methods often struggle with two primary issues: vulnerability to outliers due to input-only clustering and high sensitivity to noise caused by static cluster center assignment. This research addresses these gaps by introducing a robust, one-pass learning framework that is resilient to sensor interference.

Methodology

The proposed identification process consists of two main phases: premise identification and consequent parameter learning.

Premise Identification (Structure Learning)

The "If" part of the fuzzy rules is determined through a novel clustering approach that utilizes Dual-Space Evaluation. By calculating distances in both the input and output spaces, the algorithm can distinguish between a genuine shift in system state and a transient outlier. A new rule is only created when a data point is significantly distant in both spaces. Additionally, the algorithm employs Dynamic Center Updates, where the center and width (standard deviation) of Gaussian membership functions are refined as new data arrives, effectively smoothing out the impact of initial measurement noise.

Consequent Identification (Parameter Learning)

The "Then" part of the TSK model consists of linear functions updated via Recursive Least Squares (RLS). This allows the model to adapt its local linear approximations on the fly, ensuring high accuracy without the need to store historical data.

Experimental Setup

The algorithm was rigorously tested using the Mackey-Glass (MG) chaotic time series, a standard benchmark for nonlinear system identification. To evaluate robustness, Gaussian noise was added to the MG data to simulate real-world sensor interference. This setup tests the model's ability to extract the underlying signal from a corrupted data stream.

Mackey-Glass chaotic time series with added Gaussian noise used for testing robustness.

Results and Discussion

The proposed algorithm demonstrated superior performance compared to established benchmarks such as DENFIS, eTS, and EfuNN.

  • Accuracy and Efficiency: On the Mackey-Glass benchmark, the method achieved a Non-Dimensional Error Index (NDEI) of 0.0176 using only 50 rules. In contrast, the eTS model required 113 rules to reach an NDEI of 0.0954, and EfuNN required 1125 rules for an NDEI of 0.094. The efficiency gains are particularly noteworthy; while EfuNN achieves comparable accuracy, its requirement for over a thousand rules makes it impractical for real-time applications where memory and latency are critical.
  • Outlier Rejection: A critical innovation is the validation of new clusters using the output space. By verifying if the corresponding output also deviates significantly, the algorithm avoids creating redundant or erroneous rules, maintaining a compact and interpretable model.
  • Robustness: The dual-space clustering effectively ignored spikes and sensor glitches that typically lead to "rule explosion" in other systems. Even under severe noise conditions, the tracking performance remained remarkably stable, as shown in the comparison between the real function and the model's output.
Tracking performance of the proposed TSK fuzzy model showing the predicted output vs. the real function.

Conclusion

The proposed one-pass, online evolving TSK fuzzy identification algorithm offers a robust and computationally efficient solution for real-time modeling. By integrating output-space information into the clustering process and dynamically updating rule parameters, it achieves high accuracy with a parsimonious rule base. Future work will explore automated hyperparameter tuning to further enhance the algorithm's autonomy in unknown environments.

Summary updated

Abstract

본 논문에서는 TSK 퍼지 모델을 위한 온라인 식별 알고리즘을 제안한다. 제안된 알고리즘은 거리를 이용하여 TSK 퍼지 모델에 대한 전건부의 구조를 식별하고, 재귀적 최소자승법으로 후건부를 구성하는 부분 선형 함수들의 매개 변수를 구한다. 대부분의 다른 연구들에서는 전건부의 구조를 구하기 위해서 클러스터링을 수행할 때 입력 공간에서만 고려하였으나. 제안된 알고리즘에서는 입력 공간 및 출력 공간 모두에서 고려하여, 아웃라이어를 효과적으로 배제할 수 있다. 기존의 대부분의 다른 알고리즘에서 샘플 데이터자체를 클러스터의 중심으로 사용하여 잡음에 민감한 단점이 있었으나, 제안된 알고리즘에서는 데이터 자체를 클러스터의 중심으로 사용하지 않아 잡음에 대해 민감하지 않다. 제안된 알고리즘은 많은 데이터의 저장을 필요로 하지 않고, 한 번 통과함으로써 모델을 구할 수 있다. This paper presents online identification algorithm for TSK fuzzy model. The proposed algorithm identify structure of premise part by using distance, and obtain the parameters of the piecewise linear function consisting consequent part by using recursive least square. Only input space was considered in Most researches on structure identification, but input and output space is considered in the proposed algorithm. By doing so, outliers are excluded in clustering effectively. The existing other algorithm has disadvantage that it is sensitive to noise by using data itself as cluster centers. The proposed algorithm is non-sensitive to noise not by using data itself as cluster centers. Model can be obtained through one pass and it is not needed to memorize many data in the proposed algorithm.
BibTeX
@article{kim2005online,
  author = {Kyoung-Jung Kim and Chang‐Woo Park and Euntai Kim and Mignon Park},
  title = {{Online Evolving TSK fuzzy identification}},
  journal = {Journal of Korean Institute of Intelligent Systems},
  year = {2005},
  doi = {10.5391/jkiis.2005.15.2.204},
}
Figure