2010
DOI: 10.1007/s12530-010-9025-7
|View full text |Cite
|
Sign up to set email alerts
|

Recursive clustering based on a Gustafson–Kessel algorithm

Abstract: In this paper an on-line fuzzy identification of Takagi Sugeno fuzzy model is presented. The presented method combines a recursive Gustafson-Kessel clustering algorithm and the fuzzy recursive least squares method. The on-line Gustafson-Kessel clustering method is derived. The recursive equations for fuzzy covariance matrix, its inverse and cluster centers are given. The use of the method is presented on two examples. First example demonstrates the use of the method for monitoring of the waste water treatment … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
35
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
4
2

Relationship

2
8

Authors

Journals

citations
Cited by 107 publications
(36 citation statements)
references
References 35 publications
0
35
0
Order By: Relevance
“…Moreover, an extension of GK algorithm for evolving data stream was proposed in (Georgieva and Filev 2009) which applied Kohonen rule to update cluster centers and fuzzy covariance matrix. In this paper, we propose online GK that updates its parameter similar to (Dovžan and Škrjanc 2011), but number of clusters is changed over time by adding new clusters and merging similar clusters.…”
Section: Online Gk Clustering Algorithmmentioning
confidence: 99%
“…Moreover, an extension of GK algorithm for evolving data stream was proposed in (Georgieva and Filev 2009) which applied Kohonen rule to update cluster centers and fuzzy covariance matrix. In this paper, we propose online GK that updates its parameter similar to (Dovžan and Škrjanc 2011), but number of clusters is changed over time by adding new clusters and merging similar clusters.…”
Section: Online Gk Clustering Algorithmmentioning
confidence: 99%
“…The main property of the evolving Takagi-Sugeno-Kang fuzzy models, which gives them advantages over other fuzzy ones, consists in computing the rule bases by a learning process, that is, by continuous online rule base learning as shown in the classical and recent papers exemplified by [1][2][3][4][5][6][7][8][9][10]. The Takagi-Sugeno-Kang fuzzy models are obtained by evolving the model structure and parameters in terms of online identification algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…Similarly, a generalized fuzzy C-means clustering is proposed by [17]. A recursive clustering and fuzzy Takagi Sugeno identification is presented in [18][19][20]. Fuzzy approaches can also be applied to identify a low size feature subset which maximize information and minimize data redundancy as in [29].…”
Section: Introductionmentioning
confidence: 99%