2005
DOI: 10.1016/j.fss.2004.07.008
|View full text |Cite
|
Sign up to set email alerts
|

Modified Gath–Geva clustering for fuzzy segmentation of multivariate time-series

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
92
0
1

Year Published

2008
2008
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 116 publications
(93 citation statements)
references
References 21 publications
0
92
0
1
Order By: Relevance
“…Fuzzy clustering algorithms have showed a significant potential to address this category of problems. With this regard, Abonyi et al (2005) developed a modified GathGeva algorithm to divide time-varying multivariate data into segments by using fuzzy sets to represent such temporal segments. Duncan and Bryant (1996) proposed dynamic programming to determine a total number of intervals within the data, the location of these intervals and the order of the model within each segment.…”
Section: Experimental Data Sets-a Summarymentioning
confidence: 99%
See 1 more Smart Citation
“…Fuzzy clustering algorithms have showed a significant potential to address this category of problems. With this regard, Abonyi et al (2005) developed a modified GathGeva algorithm to divide time-varying multivariate data into segments by using fuzzy sets to represent such temporal segments. Duncan and Bryant (1996) proposed dynamic programming to determine a total number of intervals within the data, the location of these intervals and the order of the model within each segment.…”
Section: Experimental Data Sets-a Summarymentioning
confidence: 99%
“…The quality of such granulation (abstraction) of data is clearly related to the ability of this abstraction process to retain the essence of the original data (problem) while removing (hiding) all unnecessary details. With this regard, granularity of information (Bargiela and Pedrycz 2002, 2003, 2005Apolloni etal. 2008;Srivastava et al 1999;Slȩzak 2009;Pedrycz and Song 2011;Qian et al 2011) plays a pivotal role and becomes of paramount importance, both from the conceptual as well as algorithmic perspective to the realization of granular models of time series.…”
Section: Introductionmentioning
confidence: 99%
“…However, our method has an extra component that dynamically determines the number of segments (see Section 2.2). Another similar work using a different approach to determine the number of segments is reported in (Abonyi et al, 2005). Figure 9-2 is an example of a well log with 189 data points, which are partitioned into 10 segments.…”
Section: Segmentationmentioning
confidence: 99%
“…Ref. [25] proposed the modified Gath-Geva clustering algorithm for fuzzy segmentation of multivariate time series. The algorithm uses local probabilistic principal component analysis (PPCA) models to measure the homogeneity of the segments and fuzzy sets to represent segments in time, which is able to detect changes in the hidden structure of multivariate time-series [25][26][27].…”
Section: Introductionmentioning
confidence: 99%
“…Based on [25], the improved Gath-Geva (IGG) clustering algorithm is proposed for automatic fuzzy segmentation of univariate and multivariate time series [28]. The algorithm considers time series segmentation problem as Gath-Geva clustering and the minimum message length criterion [29] is used as segmentation order selection criterion.…”
Section: Introductionmentioning
confidence: 99%