This function finds groups in SSA eigentriples by reconstructing individual eigentriples back to their original (time) domain and by determining the nearest euclidian neighbour for each eigentriple. Groups with more than two members are constructed by identifying groups with a very similar Euclidian distance.
object of class ssa (e.g. the results from a call to ssa)
other objects that can be passed to the function but which are not used. This is only implemented to make the function identical in its call to the grouping.auto function.
list: list indicating the grouping of the SSA eigentriples
Jannis v. Buttlar
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.