E. Acar, D. M. Dunlavy, and T. G. Kolda, A scalable optimization approach for fitting canonical tensor decompositions, Journal of Chemometrics, vol.43, issue.1, pp.67-86, 2011.
DOI : 10.1002/cem.1335

C. A. Andersson and R. Bro, The N-way Toolbox for MATLAB, Chemometrics and Intelligent Laboratory Systems, vol.52, issue.1, pp.1-4, 2000.
DOI : 10.1016/S0169-7439(00)00071-X

W. Austin, G. Ballard, and T. G. Kolda, Parallel Tensor Compression for Large-Scale Scientific Data, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.912-922, 2016.
DOI : 10.1109/IPDPS.2016.67

B. W. Bader and T. G. Kolda, Algorithm 862, ACM Transactions on Mathematical Software, vol.32, issue.4, pp.635-653, 2006.
DOI : 10.1145/1186785.1186794

B. W. Bader and T. G. Kolda, Efficient MATLAB Computations with Sparse and Factored Tensors, SIAM Journal on Scientific Computing, vol.30, issue.1, pp.205-231, 2007.
DOI : 10.1137/060676489

B. W. Bader and T. G. Kolda, Matlab tensor toolbox version 2.6. Available online http://www.sandia.gov/ tgkolda, 2015.

M. Baskaran, B. Meister, N. Vasilache, and R. Lethin, Efficient and scalable computations with sparse tensors, 2012 IEEE Conference on High Performance Extreme Computing, pp.1-6, 2012.
DOI : 10.1109/HPEC.2012.6408676

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

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

A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. R. Jr et al., Toward an architecture for never-ending language learning, AAAI, p.3, 2010.

D. J. Carroll, J. Chang, ¨. V. , and C. Aykanat, Analysis of individual differences in multidimensional scaling via an N-way generalization of " Eckart-Young " decomposition PaToH: A Multilevel Hypergraph Partitioning Tool, Version 3.0, Psychometrika, vol.3512, issue.3, pp.283-319, 1970.

¨. U. , C. Aykanat, ¨. U. , C. Aykanat, and B. Uçar, A hypergraph-partitioning approach for coarse-grain decomposition On two-dimensional sparse matrix partitioning: Models, methods, and a recipe, C ¸ atalyürek. Hypergraph Models for Sparse Matrix Partitioning and Reordering, pp.42656-683, 1999.

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

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

L. Grasedyck, Hierarchical Singular Value Decomposition of Tensors, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.4, pp.2029-2054, 2010.
DOI : 10.1137/090764189

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

J. Håstad, Tensor rank is NP-complete, Journal of Algorithms, vol.11, issue.4, pp.644-654, 1990.
DOI : 10.1016/0196-6774(90)90014-6

U. Kang, E. Papalexakis, A. Harpale, and C. Faloutsos, GigaTensor, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pp.316-324, 2012.
DOI : 10.1145/2339530.2339583

L. Karlsson, D. Kressner, and A. Uschmajew, Parallel algorithms for tensor completion in the CP format, Parallel Computing, vol.57, issue.C, pp.222-234, 2016.
DOI : 10.1016/j.parco.2015.10.002

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

O. Kaya and B. Uçar, High-performance parallel algorithms for the Tucker decomposition of higher order sparse tensors, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01219316

O. Kaya and B. Uçar, Scalable sparse tensor decompositions in distributed memory systems, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on, SC '15, pp.1-77
DOI : 10.1145/2807591.2807624
URL : https://hal.archives-ouvertes.fr/hal-01148202

O. Kaya and B. Uçar, High Performance Parallel Algorithms for the Tucker Decomposition of Sparse Tensors, 2016 45th International Conference on Parallel Processing (ICPP), pp.103-112, 2016.
DOI : 10.1109/ICPP.2016.19
URL : https://hal.archives-ouvertes.fr/hal-01354894

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

T. G. Kolda and B. Bader, Tensor Decompositions and Applications, SIAM Review, vol.51, issue.3, pp.455-500, 2009.
DOI : 10.1137/07070111X

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

T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, 1990.
DOI : 10.1007/978-3-322-92106-2

J. Leskovec and A. Krevl, SNAP Datasets: Stanford large network dataset collection, 2014.

I. Perros, R. Chen, R. Vuduc, and J. Sun, Sparse Hierarchical Tucker Factorization and Its Application to Healthcare, 2015 IEEE International Conference on Data Mining, pp.943-948, 2015.
DOI : 10.1109/ICDM.2015.29

S. Rendle and T. S. Lars, Pairwise interaction tensor factorization for personalized tag recommendation, Proceedings of the third ACM international conference on Web search and data mining, WSDM '10, pp.81-90, 2010.
DOI : 10.1145/1718487.1718498

S. Rendle, B. M. Leandro, A. Nanopoulos, and L. Schmidt-thieme, Learning optimal ranking with tensor factorization for tag recommendation, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.727-736, 2009.
DOI : 10.1145/1557019.1557100

G. M. Slota, K. Madduri, and S. Rajamanickam, PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks, 2014 IEEE International Conference on Big Data (Big Data), pp.481-490, 2014.
DOI : 10.1109/BigData.2014.7004265

S. Smith and G. Karypis, Tensor-matrix products with a compressed sparse tensor, Proceedings of the 5th Workshop on Irregular Applications Architectures and Algorithms, IA3 '15, p.7, 2015.
DOI : 10.1145/2833179.2833183

S. Smith and G. Karypis, A Medium-Grained Algorithm for Sparse Tensor Factorization, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.902-911, 2016.
DOI : 10.1109/IPDPS.2016.113

S. Smith, N. D. Ravindran, G. Sidiropoulos, and . Karypis, SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication, 2015 IEEE International Parallel and Distributed Processing Symposium, pp.61-70, 2015.
DOI : 10.1109/IPDPS.2015.27

S. Smith, G. Park, and . Karypis, An Exploration of Optimization Algorithms for High Performance Tensor Completion, SC16: International Conference for High Performance Computing, Networking, Storage and Analysis, 2016.
DOI : 10.1109/SC.2016.30

P. Symeonidis, A. Nanopoulos, and Y. Manolopoulos, Tag recommendations based on tensor dimensionality reduction, Proceedings of the 2008 ACM conference on Recommender systems, RecSys '08, pp.43-50, 2008.
DOI : 10.1145/1454008.1454017

J. Ugander and L. Backstrom, Balanced label propagation for partitioning massive graphs, Proceedings of the sixth ACM international conference on Web search and data mining, WSDM '13, pp.507-516, 2013.
DOI : 10.1145/2433396.2433461

M. A. Vasilescu and D. Terzopoulos, Multilinear Analysis of Image Ensembles: TensorFaces, Computer Vision?ECCV 2002, pp.447-460, 2002.
DOI : 10.1007/3-540-47969-4_30

N. Zheng, Q. Li, S. Liao, and L. Zhang, Flickr group recommendation based on tensor decomposition, Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval, SIGIR '10, pp.737-738, 2010.
DOI : 10.1145/1835449.1835591