Efficient model selection in switching linear dynamic systems by graph clustering
원문 초록
The computation required for a switching Kalman Filter (SKF) increases exponentially with the number of system operation modes. In this paper, a computationally tractable graph representation is proposed for a switching linear dynamic system (SLDS) along with the solution of a minimum-sum optimization problem for clustering to reduce the switching mode cardinality offline, before collecting measurements. It is shown that upon perfect mode detection, the induced error caused by mode clustering can be quantified exactly in terms of the dissimilarity measures in the proposed graph structure. Numerical results verify that clustering based on the proposed framework effectively reduces model complexity given uncertain mode detection and that the induced error can be well approximated if the underlying assumptions are satisfied.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Unsupervised Graph Clustering with Deep Structural Entropy
Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning
Rhomboid Tiling for Geometric Graph Deep Learning
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering
Efficient graph convolution for joint node representation learning and clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.