A probabilistic matrix factorization algorithm for approximation of sparse matrices in natural language processing

ICT Express - Tập 4 - Trang 87-90 - 2018
Gianmaria Tarantino1, Stefania Monica1, Federico Bergenti1
1Dipartimento di Scienze Matematiche, Fisiche e Informatiche Universitá degli Studi di Parma, 43124 Parma, Italy

Tài liệu tham khảo

Pennington, 2014, GloVe: Global vectors for word representation, 1532 Levy, 2014, vol. 27, 2177 Mikolov, 2013, Distributed representations of words and phrases and their compositionality, 3111 Deerwester, 1990, Indexing by latent semantic analysis, J. Amer. Soc. Inf. Sci., 41, 391, 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9 O., 1995, Using linear algebra for intelligent information retrieval, SIAM Rev., 37, 573, 10.1137/1037127 Golub, 1989, vol. 3 Halko, 2011, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM Rev., 53, 217, 10.1137/090771806 Voronin, 2016, A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices, SIAM J. Sci. Comput., 38, S485, 10.1137/15M1026080