1997
DOI: 10.1080/03610919708813380
|View full text |Cite
|
Sign up to set email alerts
|

A nonparametric statistical approach in noisy chaos identification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
199
0
1

Year Published

2014
2014
2021
2021

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 101 publications
(201 citation statements)
references
References 7 publications
1
199
0
1
Order By: Relevance
“…To further access the stability of the clusters under change of the clustering algorithm, we have also implemented the Mean shift clustering algorithm [14][15][16] , which similarly reproduces the same clustering with minor variations. Please see Supplementary Note 3 for a discussion of the selection of the clustering algorithms and Supplementary Note 4 and Supplementary Table 1 for a comprehensive comparison of all clustering runs.…”
Section: Article Nature Communications | Doi: 101038/ncomms6803mentioning
confidence: 99%
See 2 more Smart Citations
“…To further access the stability of the clusters under change of the clustering algorithm, we have also implemented the Mean shift clustering algorithm [14][15][16] , which similarly reproduces the same clustering with minor variations. Please see Supplementary Note 3 for a discussion of the selection of the clustering algorithms and Supplementary Note 4 and Supplementary Table 1 for a comprehensive comparison of all clustering runs.…”
Section: Article Nature Communications | Doi: 101038/ncomms6803mentioning
confidence: 99%
“…In this case, the next hydrogen bond belongs to the longrange clusters. Still assuming that the conformational angles between the two hydrogen bonds correspond to an ideal antiparallel beta strand, we get equation (16) instead of equation (15). We have probed for the existence of pairs R H and R H 1 subject to either (15) or (16) as follows.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we extend the MEM algorithm, proposed by Li et al (2007) to maximise (2.3). Since the SCAD penalty is irregular at the origin, maximising (2.3) directly may be difficult.…”
Section: A Modified Modal Expectation-maximization Algorithmmentioning
confidence: 99%
“…iii) DBScan clustering algorithm [24]; iv) Mode identification based clustering algorithm [25]; v) Random swap algorithm [26]; vi) Density peak algorithm [27].…”
Section: Numerical Examples and Analysismentioning
confidence: 99%