Aceleração da Construção de Matrizes de Concorrência Palavra-Palavra em Textos Usando GPU
Resumo
Neste trabalho implementamos algoritmos sequenciais e paralelos para o problema de construção de matrizes de coocorrências na GPU
Palavras-chave:
Texto, Processamento de Linguagem Natura, Word Embeddings, Paralelismo, GPU
Referências
Arora, Sanjeev, Ge, Rong, Halpern, Yonatan, Mimno, David, Moitra, Ankur, Sontag, Da- vid, Wu, Yichen, and Zhu, Michael. A practical algorithm for topic modeling with pro- vable guarantees. In Proceedings of The 30th International Conference on Machine Lear- ning, pp. 280–288, (2013).
J. Gantz and D. Reinsel, ‘The digital universe decade-are you ready, Proc. White Paper, IDC(2010).
Lee, Moontae, Mimno, David, and Bindel, David. Robust spectral inference for joint stochastic matrix factorization. In Advances in neural information processing systems, (2015).
Lin, Jimmy. Scalable language processing algorithms for the masses: A case study in computing word cooccurrence matrices with MapReduce. In Proceedings of the Confe- rence on Empirical Methods in Natural Language Processing, EMNLP ’08, pp. 419–428, Stroudsburg, PA, USA, (2008)
Levy, Omer and Goldberg, Yoav. Neural word embedding as implicit matrix factorization. In Advances in Neural Information Processing Systems, pp. 2177–2185, (2014).
Mikolov, Tomas, Chen, Kai, Corrado, Greg, and Dean, Jeffrey. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781, (2013).
Pennington, Jeffrey, Socher, Richard, and Manning, Christopher D. Glove: Global vec- tors for word representation. Proceedings of the Empiricial Methods in Natural Language Processing (EMNLP 2014 ), 12:1532–1543, (2014)
TAN, A.-H, Text mining: the state of the art and the challenges , KDAD, Beijing. China. PAKDD, p. 71-76., (1999).
J. Gantz and D. Reinsel, ‘The digital universe decade-are you ready, Proc. White Paper, IDC(2010).
Lee, Moontae, Mimno, David, and Bindel, David. Robust spectral inference for joint stochastic matrix factorization. In Advances in neural information processing systems, (2015).
Lin, Jimmy. Scalable language processing algorithms for the masses: A case study in computing word cooccurrence matrices with MapReduce. In Proceedings of the Confe- rence on Empirical Methods in Natural Language Processing, EMNLP ’08, pp. 419–428, Stroudsburg, PA, USA, (2008)
Levy, Omer and Goldberg, Yoav. Neural word embedding as implicit matrix factorization. In Advances in Neural Information Processing Systems, pp. 2177–2185, (2014).
Mikolov, Tomas, Chen, Kai, Corrado, Greg, and Dean, Jeffrey. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781, (2013).
Pennington, Jeffrey, Socher, Richard, and Manning, Christopher D. Glove: Global vec- tors for word representation. Proceedings of the Empiricial Methods in Natural Language Processing (EMNLP 2014 ), 12:1532–1543, (2014)
TAN, A.-H, Text mining: the state of the art and the challenges , KDAD, Beijing. China. PAKDD, p. 71-76., (1999).
Publicado
22/11/2019
Como Citar
DE MORAES, Misael Mateus Oliveira; MARTINS, Wellington Santos .
Aceleração da Construção de Matrizes de Concorrência Palavra-Palavra em Textos Usando GPU. In: ESCOLA REGIONAL DE INFORMÁTICA DE GOIÁS (ERI-GO), 7. , 2019, Goiânia.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2019
.
p. 395-398.
