CP decomposition and weighted clique problem

Tonglin Zhang

Statistics & Probability Letters, 2020, vol. 161, issue C

Abstract: The determination of the optimal subdecomposition based on CP decomposition for high-order tensors is not straightforward because the rank-one tensors are not orthogonal. We show that this is equivalent to the weighted clique problem. Thus, it is NP-hard.

Keywords: CP decomposition; Dimension reduction; Weighted clique problem; NP-hard; Subdecomposition; Tensors (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715220300262
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:161:y:2020:i:c:s0167715220300262

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2020.108723

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().