TY - GEN
T1 - Gtt
T2 - 13th International Conference on Similarity Search and Applications, SISAP 2020
AU - Li, Mao Lin
AU - Candan, K. Selçuk
AU - Sapino, Maria Luisa
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2020.
PY - 2020
Y1 - 2020
N2 - The demand for searching, querying multimedia data such as image, video and audio is omnipresent, how to effectively access data for various applications is a critical task. Nevertheless, these data usually are encoded as multi-dimensional arrays, or Tensor, and traditional data mining techniques might be limited due to the curse of dimensionality. Tensor decomposition is proposed to alleviate this issue, commonly used tensor decomposition algorithms include CP-decomposition (which seeks a diagonal core) and Tucker-decomposition (which seeks a dense core). Naturally, Tucker maintains more information, but due to the denseness of the core, it also is subject to exponential memory growth with the number of tensor modes. Tensor train (TT) decomposition addresses this problem by seeking a sequence of three-mode cores: but unfortunately, currently, there are no guidelines to select the decomposition sequence. In this paper, we propose a GTT method for guiding the tensor train in selecting the decomposition sequence. GTT leverages the data characteristics (including number of modes, length of the individual modes, density, distribution of mutual information, and distribution of entropy) as well as the target decomposition rank to pick a decomposition order that will preserve information. Experiments with various data sets demonstrate that GTT effectively guides the TT-decomposition process towards decomposition sequences that better preserve accuracy.
AB - The demand for searching, querying multimedia data such as image, video and audio is omnipresent, how to effectively access data for various applications is a critical task. Nevertheless, these data usually are encoded as multi-dimensional arrays, or Tensor, and traditional data mining techniques might be limited due to the curse of dimensionality. Tensor decomposition is proposed to alleviate this issue, commonly used tensor decomposition algorithms include CP-decomposition (which seeks a diagonal core) and Tucker-decomposition (which seeks a dense core). Naturally, Tucker maintains more information, but due to the denseness of the core, it also is subject to exponential memory growth with the number of tensor modes. Tensor train (TT) decomposition addresses this problem by seeking a sequence of three-mode cores: but unfortunately, currently, there are no guidelines to select the decomposition sequence. In this paper, we propose a GTT method for guiding the tensor train in selecting the decomposition sequence. GTT leverages the data characteristics (including number of modes, length of the individual modes, density, distribution of mutual information, and distribution of entropy) as well as the target decomposition rank to pick a decomposition order that will preserve information. Experiments with various data sets demonstrate that GTT effectively guides the TT-decomposition process towards decomposition sequences that better preserve accuracy.
KW - Low-rank embedding
KW - Tensor train decomposition
UR - http://www.scopus.com/inward/record.url?scp=85093825319&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85093825319&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-60936-8_15
DO - 10.1007/978-3-030-60936-8_15
M3 - Conference contribution
AN - SCOPUS:85093825319
SN - 9783030609351
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 187
EP - 202
BT - Similarity Search and Applications - 13th International Conference, SISAP 2020, Proceedings
A2 - Satoh, Shin’ichi
A2 - Vadicamo, Lucia
A2 - Carrara, Fabio
A2 - Zimek, Arthur
A2 - Bartolini, Ilaria
A2 - Aumüller, Martin
A2 - Jonsson, Bjorn Por
A2 - Pagh, Rasmus
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 30 September 2020 through 2 October 2020
ER -