2019
DOI: 10.1080/01621459.2018.1527701
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Tensor Clustering

Abstract: Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. There is also a gap between statistical guarantee and computational efficiency for existing tensor clustering solutions. In this article, we propose a new dynamic tensor clustering method that works for a general-order dynamic tensor, and enjoys both strong statistical guarantee and high computational ef… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 56 publications
(35 citation statements)
references
References 52 publications
0
35
0
Order By: Relevance
“…Nonetheless, we leave for future work a more principled approach to rank selection. One promising angle of pursuit would be to leverage the equivalence between CCA and a least squares problem (Sun, Ji, & Ye, ) and then derive an information criterion, a strategy commonly used to select the rank parameter in several recently proposed tensor estimation procedures (Zhou et al, ; Sun et al, ; Sun & Li, ).…”
Section: Discussionmentioning
confidence: 99%
“…Nonetheless, we leave for future work a more principled approach to rank selection. One promising angle of pursuit would be to leverage the equivalence between CCA and a least squares problem (Sun, Ji, & Ye, ) and then derive an information criterion, a strategy commonly used to select the rank parameter in several recently proposed tensor estimation procedures (Zhou et al, ; Sun et al, ; Sun & Li, ).…”
Section: Discussionmentioning
confidence: 99%
“…Remark 1 It is worth mentioning that our framework is related but distinct from the CP low-rank-based decomposition framework in literature (see De Silva and Lim (2008); Kolda and Bader (2009);Anandkumar et al (2014a,b); Sun et al (2015); Sun and Li (2017); Wang et al…”
Section: Sparse Tensor Svd Modelmentioning
confidence: 96%
“…[246] further extended this approach to handle large networks. [204] proposed a structured tensor factorization approach that encourages sparsity and smoothness in parameters along the specified tensor modes. They then built a dynamic tensor clustering method, and applied to brain dynamic functional connectivity analysis.…”
Section: Network Estimationmentioning
confidence: 99%