In order to continuously adapt to dynamic data distributions, existing incremental and online learning methods adopt bagging or boosting structures, in which some sub-classifiers are abandoned when the data distribution varies significantly in the learning process. As such, these ensemble classifiers may fail to reach the global optimum. Furthermore, the training of static sub-classifiers, which are dropped when concept drift emerges, leads to unnecessary computational costs. To solve these issues, this study proposes a novel training method consisting of a single dynamic classifier—named the dynamic incremental adaptive Takagi–Sugeno–Kang fuzzy classifier (DIA-TSK)—which leverages the superior non-linear modeling capabilities and interpretability of the TSK fuzzy system. DIA-TSK utilizes a multi-dimensional incremental learning strategy that is capable of dynamically learning from new data in real time while maintaining global optimal solutions across various online application scenarios. DIA-TSK incorporates two distinct learning paradigms: online learning (O-DIA-TSK) and batch incremental learning (B-DIA-TSK). These modules can work separately or collaborate synergistically to achieve rapid, precise and resource-efficient incremental learning. With the implementation of O-DIA-TSK, we significantly reduce the computational complexity in incremental processes, effectively addressing real-time learning requirements for high-frequency dynamic data streams. Moreover, the novel incremental update mechanism of O-DIA-TSK dynamically adjusts its parameters to ensure progressive optimization, enhancing both real-time performance and learning accuracy. For large-scale data sets, DIA-TSK evolves into B-DIA-TSK, which implements batch updates for multiple samples based on the Woodbury matrix identity. This extension substantially improves computational efficiency and robustness during incremental learning, making it particularly suitable for high-dimensional and complex data sets. Extensive comparative experiments demonstrate that the DIA-TSK approaches significantly outperform existing incremental learning methods across multiple dynamic data sets, exhibiting notable advantages in terms of computational efficiency, classification accuracy and memory management. In the experimental comparison, O-DIA-TSK and B-DIA-TSK reach significant superiority in classification performance with respect to comparative methods, with up to 33.3% and 55.8% reductions in training time, respectively, demonstrating the advantage of DIA-TSK in classification tasks using dynamic data.
Takagi–Sugeno–Kang (TSK) fuzzy classifiers have achieved notable success in pattern recognition and data mining due to their combination of approximation capability and model interpretability. However, existing TSK classifiers predominantly rely on batch training, which becomes impractical in streaming environments characterized by continuous sample arrival, limited memory, and evolving data distributions. To address these challenges, this paper proposes the Online Adaptive TSK (OA-TSK) fuzzy classifier with an incremental–decremental update protocol for non-stationary data streams. First, we develop the Decremental Adaptive TSK Fuzzy Classifier (DA-TSK), whose update procedure applies the Sherman–Morrison formula to a symmetric rank-one downdate, enabling precise sample removal while maintaining exact equivalence to batch least-squares retraining. Building upon DA-TSK and our prior Dynamic Incremental Adaptive TSK Fuzzy Classifier (DIA-TSK), we then propose OA-TSK, which integrates incremental and decremental updates within a sliding-window mechanism to achieve continuous adaptation with bounded memory. The key theoretical contribution is that, in exact arithmetic, OA-TSK produces at every time step the same ridge-regularized least-squares solution as batch retraining on the active window. To further handle severe shifts in the input distribution, which can cause fixed rule centers to become poorly aligned with newly arriving samples, we propose Online Adaptive TSK with Antecedent Reclustering (OA-A-TSK), which incorporates an adaptive antecedent reclustering mechanism. Comprehensive experiments on synthetic and real-world data streams demonstrate that OA-TSK achieves classification accuracy comparable to that of ridge-regularized batch retraining while substantially reducing per-sample computational complexity. An analysis of average ranks shows that OA-TSK and OA-A-TSK rank among the top-performing methods across diverse drift scenarios while preserving the intrinsic interpretability of TSK fuzzy systems.