2015
DOI: 10.1016/j.neucom.2014.12.093
|View full text |Cite
|
Sign up to set email alerts
|

Maximum margin clustering for state decomposition of metastable systems

Abstract: When studying a metastable dynamical system, a prime concern is how to decompose the phase space into a set of metastable states. Unfortunately, the metastable state decomposition based on simulation or experimental data is still a challenge. The most popular and simplest approach is geometric clustering which is developed based on the classical clustering technique. However, the prerequisites of this approach are: (1) data are obtained from simulations or experiments which are in global equilibrium and (2) th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 47 publications
0
6
0
Order By: Relevance
“…For the sake of convenience, here we let e k denote a κ dimensional vector with only the k-th element being 1 and others 0, and define a matrix B ∈ R where K = K (1,1) K (1,2) K (2,1) K (2,2) (B.5) K s = K (1,1) + K (1,2) + K (2,1) + K (2,2) (B.6) and where R is a full column rank matrix satisfying…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…For the sake of convenience, here we let e k denote a κ dimensional vector with only the k-th element being 1 and others 0, and define a matrix B ∈ R where K = K (1,1) K (1,2) K (2,1) K (2,2) (B.5) K s = K (1,1) + K (1,2) + K (2,1) + K (2,2) (B.6) and where R is a full column rank matrix satisfying…”
Section: Discussionmentioning
confidence: 99%
“…In this section, we apply the framework of large margin learning to metastability analysis. Suppose that we have L trajectories {x 1 1 , . .…”
Section: Maximum Margin Metastable Clusteringmentioning
confidence: 99%
See 3 more Smart Citations