2016
DOI: 10.1007/978-0-387-87811-9_7
|View full text |Cite
|
Sign up to set email alerts
|

Spectral Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 305 publications
0
1
0
Order By: Relevance
“…Eigen decomposition retrieves the structures of the data cloud in the high-dimensions space by decomposing it into a set of eigenvalues and eigenvectors. Eigenvectors are orthogonal unitarian column vectors, ordered according to their eigenvalues (Vidal, Ma and Sastry, 2016), which represent dimensions of the data cloud: the first eigenvector identifies the dimension of the largest variance in the data, the second one the second largest variance, and so on. By identifying the most relevant eigenvectors of a movement data set represented as sequences of states of an individual, eigen decomposition can find commonly repeated behavioural patterns, the so-called eigenbehaviours (Eagle and Pentland, 2009).…”
Section: Introductionmentioning
confidence: 99%
“…Eigen decomposition retrieves the structures of the data cloud in the high-dimensions space by decomposing it into a set of eigenvalues and eigenvectors. Eigenvectors are orthogonal unitarian column vectors, ordered according to their eigenvalues (Vidal, Ma and Sastry, 2016), which represent dimensions of the data cloud: the first eigenvector identifies the dimension of the largest variance in the data, the second one the second largest variance, and so on. By identifying the most relevant eigenvectors of a movement data set represented as sequences of states of an individual, eigen decomposition can find commonly repeated behavioural patterns, the so-called eigenbehaviours (Eagle and Pentland, 2009).…”
Section: Introductionmentioning
confidence: 99%