2004
DOI: 10.1016/s1474-6670(17)31464-7
|View full text |Cite
|
Sign up to set email alerts
|

Identification of piecewise affine systems based on statistical clustering technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
59
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(60 citation statements)
references
References 19 publications
1
59
0
Order By: Relevance
“…An iterative algorithm that sequentially estimates the parameters of the model and classifies the data through the use of adapted weights is described in [60]. A method based on statistical clustering of measured data via a Gaussian mixture model and support vector classifiers is presented in [56]. Several optimization problem formulations of the identification problem are proposed in [54,55].…”
Section: Paper Contributionmentioning
confidence: 99%
See 2 more Smart Citations
“…An iterative algorithm that sequentially estimates the parameters of the model and classifies the data through the use of adapted weights is described in [60]. A method based on statistical clustering of measured data via a Gaussian mixture model and support vector classifiers is presented in [56]. Several optimization problem formulations of the identification problem are proposed in [54,55].…”
Section: Paper Contributionmentioning
confidence: 99%
“…The third category contains a variety of approaches, sharing the characteristic that the parameters of the submodels and the partition of the domain are identified iteratively or in different steps, each step considering either the submodels or the regions. The algorithms proposed in [5,27,47,56,60] start by classifying the data points and estimating the linear/affine submodels simultaneously. Then, region estimation is carried out by resorting to standard linear separation techniques.…”
Section: Remark 31mentioning
confidence: 99%
See 1 more Smart Citation
“…The former approach allows us to derive a PWA model directly from input-output data of the biological network as an identification problem (e.g. Ferrari-Trecate et al 2003;Roll et al 2004;Juloski et al 2005;Nakada et al 2005;Drulhe et al 2008). Although many approaches have been developed, they in general include three steps: the inputoutput data-clustering based on k-means method or expectation maximization method, the estimation of sub-regions of the state space corresponding to each mode via support vector machine method, and the parameter identification of a linear (affine) system in each mode.…”
Section: Piecewise Affine Approximation Of Biological Networkmentioning
confidence: 99%
“…The first class includes the clustering-based approach, using either k-means [3] or Expectation Maximization (EM) [11], and the Bayesian approach [5]. These methods alternate between solving the classification problem for fixed model parameters and solving the estimation problem for a fixed classification.…”
Section: Introductionmentioning
confidence: 99%