52nd IEEE Conference on Decision and Control 2013
DOI: 10.1109/cdc.2013.6759874
|View full text |Cite
|
Sign up to set email alerts
|

Exact system identification with missing data

Abstract: The paper presents initial results on a subspace method for exact identification of a linear time-invariant system from data with missing values. The identification problem with missing data is equivalent to a Hankel structured lowrank matrix completion problem. The novel idea is to search systematically and use effectively completely specified submatrices of the incomplete Hankel matrix constructed from the given data. Nontrivial kernels of the rank-deficient completely specified submatrices carry information… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
17
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(17 citation statements)
references
References 12 publications
0
17
0
Order By: Relevance
“…The proposed technique will impact other areas of applied matrix completion, viz. collaborative filtering [29], system identification [30], direction of arrival estimation [31] etc.…”
Section: Contributionmentioning
confidence: 99%
“…The proposed technique will impact other areas of applied matrix completion, viz. collaborative filtering [29], system identification [30], direction of arrival estimation [31] etc.…”
Section: Contributionmentioning
confidence: 99%
“…In this paper, we consider the exact (deterministic) identification problem in the case of data with missing values. Apart from the preliminary results [13] by the author, currently there are no subspace methods that address this problem. We do not make assumptions about the nature or pattern of the missing values apart from the basic one that they are a part of a valid trajectory of a linear time-invariant system with a given number of inputs and bounded lag.…”
Section: Context and Aim Of The Papermentioning
confidence: 99%
“…Subspace identification methods, however, are unable to directly handle the problem of missing data since SVD requires matrices to be full rank. A method introduced by 18 utilizes sub‐matrices that contain full rank data by rearranging the data. However, this is not appropriate for handling process data since subspace identification relies on the time‐dependent relationships in the data to identify a state trajectory.…”
Section: Introductionmentioning
confidence: 99%