E. Acar, D. M. Dunlavy, and T. G. Kolda, A scalable optimization approach for fitting 1116 canonical tensor decompositions, Journal of Chemometrics, vol.25, pp.67-86, 2011.

C. A. Andersson and R. Bro, The N-way toolbox for MATLAB, Chemometrics and Intelligent 1118 Laboratory Systems, vol.52, pp.1-4, 2000.

W. Austin, G. Ballard, and T. G. Kolda, Parallel tensor compression for large-scale scien1120 tific data, IEEE International Parallel and Distributed Processing Symposium (IPDPS, p.1121

B. W. Bader and T. G. Kolda, Efficient MATLAB computations with sparse and factored 1123 tensors, SIAM Journal on Scientific Computing, vol.30, pp.205-231, 2007.

B. W. Bader and T. G. Kolda, Matlab tensor toolbox version 2.6, 2015.

M. Baskaran, B. Meister, N. Vasilache, and R. Lethin, Efficient and scalable computa1127 tions with sparse tensors, IEEE Conference on High Performance Extreme Computing 1128 (HPEC), pp.1-6, 2012.

J. Bennett and S. Lanning, The Netflix Prize, Proceedings of KDD cup and workshop, vol.1130, p.35, 2007.

S. Bird, E. Loper, and E. Klein, Natural Language Processing with Python, 1132.

J. Buurlage, Self-improving sparse matrix partitioning and bulk-synchronous pseudo1134 streaming, master's thesis, p.1135, 2016.

A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. et al., Toward an architecture for never-ending language learning, AAAI, vol.5, pp.3-1137, 1136.

D. J. Carroll and J. Chang, Analysis of individual differences in multidimensional scaling 1138 via an N-way generalization of "Eckart-Young" decomposition, Psychometrika, vol.35, pp.1139-283, 1140.

U. V. and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool, 1141 Version 3.0

U. V. and C. Aykanat, A hypergraph-partitioning approach for coarse-grain 1144 decomposition, Supercomputing, ACM/IEEE 2001 Conference, vol.14, pp.1145-1187, 2001.

U. V. , C. Aykanat, and B. Uçar, On two-dimensional sparse matrix partition1147 ing: Models, methods, and a recipe, SIAM Journal on Scientific Computing, vol.32, pp.1148-656, 2010.

U. V. , Hypergraph Models for Sparse Matrix Partitioning and Reordering, 1151.

J. H. Choi and S. V. Vishwanathan, DFacTo: Distributed factorization of tensors, 1152 27th Advances in Neural Information Processing Systems, pp.1296-1304, 1153.

O. Görlitz, S. Sizov, and S. Staab, PINTS: Peer-to-peer infrastructure for tagging systems, 1155 in Proceedings of the 7th International Conference on Peer-to-Peer Systems, p.19, 2008.

L. Grasedyck, Hierarchical singular value decomposition of tensors, Analysis and Applications, vol.31, pp.2029-2054, 1158.

R. A. Harshman, Foundations of the PARAFAC procedure: Models and conditions for an 1160 "explanatory" multi-modal factor analysis, UCLA Working Papers in Phonetics, vol.16, pp.1161-1162, 1970.

V. Henne, Label propagation for hypergraph partitioning, master's thesis, Karsruhe Institute 1163 of Technology, 2015.

J. Håstad, Tensor rank is NP-complete, Journal of Algorithms, pp.644-654, 1990.

U. Kang, E. Papalexakis, A. Harpale, and C. Faloutsos, GigaTensor: Scaling tensor 1166 analysis up by 100 times-Algorithms and discoveries, Proceedings of the 18th ACM 1167 SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.316-324, 2012.

L. Karlsson, D. Kressner, and A. Uschmajew, Parallel algorithms for tensor completion 1170 in the CP format, Parallel Computing, vol.57, pp.222-234, 2016.

G. Karypis and V. Kumar, Multilevel algorithms for multi-constraint hypergraph partitioning, 1172.

O. Kaya and B. Uçar, High-performance parallel algorithms for the Tucker decomposition of 1175 higher order sparse tensors, 2015.

O. Kaya and B. Uçar, Scalable sparse tensor decompositions in distributed memory systems, 1177 in Proceedings of the International Conference for High Performance Computing, Network1178 ing, Storage and Analysis, vol.77, p.11, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01148202

O. Kaya and B. Uçar, High performance parallel algorithms for the Tucker decomposition of 1180 sparse tensors, 45th International Conference on Parallel Processing (ICPP '16), pp.103-112, 1181.

T. G. Kolda and B. Bader, The TOPHITS model for higher-order web link analysis, 1183 Proceedings of Link Analysis, Counterterrorism and Security, 2006.

T. G. Kolda and B. Bader, Tensor decompositions and applications, SIAM Review, vol.51, pp.1185-455, 2009.

O. Kaya-and and B. Uç-ar,

L. D. Lathauwer and B. D. Moor, From matrix to tensor: Multilinear algebra and signal 1187 processing, Institute of Mathematics and Its Applications Conference Series, vol.67, pp.1-16, 11881998.

T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Chich1190 ester, 1990.

J. Leskovec, A. Krevl, and . Datasets, , 2014.

J. Li, J. Choi, I. Perros, J. Sun, and R. Vuduc, Model-driven sparse CP decomposition for 1194 higher-order tensors, 31th IEEE International Symposium on Parallel and 1195 Distributed Processing, pp.1048-1057, 2017.

I. Perros, R. Chen, R. Vuduc, and J. Sun, Sparse hierarchical Tucker factorization and its 1197 application to healthcare, Data Mining (ICDM), 2015 IEEE International Conference 1198 on, pp.943-948, 2015.

A. H. Phan, P. Tichavsk´ytichavsk´y, and A. Cichocki, Fast alternating LS algorithms for high order 1200 CANDECOMP/PARAFAC tensor factorizations, IEEE Transactions on Signal Processing, vol.1201, pp.4834-4846, 2013.

S. Rendle and T. S. Lars, Pairwise interaction tensor factorization for personalized tag rec1203 ommendation, Proceedings of the Third ACM International Conference on Web Search 1204 and Data Mining, WSDM '10, pp.81-90, 2010.

S. Rendle, B. M. Leandro, A. Nanopoulos, and L. Schmidt-thieme, Learning optimal 1206 ranking with tensor factorization for tag recommendation, Proceedings of the 15th ACM 1207 SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pp.727-736, 1208.

G. M. Slota, K. Madduri, and S. Rajamanickam, PuLP: Scalable multi-objective multi1210 constraint partitioning for small-world networks, Proc. 2nd IEEE Int'l. Conf. on Big 1211 Data (BigData), pp.481-490, 2014.

S. Smith and G. Karypis, Tensor-matrix products with a compressed sparse tensor, Pro1213 ceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, p.7, 1214.

S. Smith and G. Karypis, A medium-grained algorithm for sparse tensor factorization, 1216 2016 IEEE International Parallel and Distributed Processing Symposium, vol.2016, p.1217

S. Smith, J. Park, and G. Karypis, An exploration of optimization algorithms for high per1219 formance tensor completion, Proceedings of the 2016 ACM/IEEE conference on Super1220 computing, 2016.

S. Smith, N. Ravindran, N. D. Sidiropoulos, and G. Karypis, SPLATT: Efficient and par1222 allel sparse tensor-matrix multiplication, 29th IEEE International Parallel & Distributed 1223 Processing Symposium, pp.61-70, 2015.

P. Symeonidis, A. Nanopoulos, and Y. Manolopoulos, Tag recommendations based on 1225 tensor dimensionality reduction, Proceedings of the 2008 ACM Conference on Recom1226 mender Systems, pp.43-50, 2008.

G. Tomasi and R. Bro, A comparison of algorithms for fitting the parafac model, Computa1228 tional Statistics & Data Analysis, vol.50, pp.1700-1734, 2006.

J. Ugander and L. Backstrom, Balanced label propagation for partitioning massive graphs, 1230 Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 1231 WSDM '13, pp.507-516, 2013.

M. A. Vasilescu and D. Terzopoulos, Multilinear analysis of image ensembles: Tensor1233 Faces, Computer Vision-ECCV 2002, pp.447-460, 2002.

N. Zheng, Q. Li, S. Liao, and L. Zhang, Flickr group recommendation based on tensor de1235 composition, Proceedings of the 33rd International ACM SIGIR Conference on Research 1236 and Development in Information Retrieval, SIGIR '10, pp.737-738, 2010.