Fake News Named Entity Relationship Analysis Through Community Building
Abstract
This paper proposes a study based on communities to facilitate the analysis of entity relationships named in Fake News. For this, we extract named entities from the news datasets, using Natural Language Processing techniques. Subsequently, the relationships between entities are used to generate a graph, where two entities in the same news are considered adjacent, allowing the identification of communities. The graphs and communities generated were evaluated based on several metrics. As a result, non-random fake news communities were obtained, providing a method that can assist the user in identifying other fake news when observing patterns similar to those of the formed communities
Keywords:
Fake News, Graphs, Communities
References
Aranha, C. and Passos, E. (2006). A tecnologia de mineração de textos. Revista Eletrˆonica de Sistemas de Informação, 5(2).
Arney, C. (2009). Linked: How everything is connected to everything else and what it means for business, science, and everyday life. Mathematics and Computer Education, 43(3).
Barbosa, J., Vieira, J., Santos, R., Magalh˜aes Junior, G., Muniz, M., and Moura, R.(2017). Introdução ao processamento de linguagem natural usando python. III Escola Regional de Inform´atica do Piau´í 1:336–360.
Bastian, M., Heymann, S., and Jacomy, M. (2009). Gephi: An open source software for exploring and manipulating networks.
Bird, S., Klein, E., and Loper, E. (2009). Natural language processing with Python: analyzing text with the natural language toolkit. ”O’Reilly Media, Inc.”.
Blondel, V., Guillaume, J., Lambiotte, R., and Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment,(10).
Bondy, J., Murty, U., et al. (1976). Graph theory with applications, volume 290. Citeseer.
Carnivali, G., Vieira, A., Esquef, P., and Ziviani, A. (2018). M´etodo r´apido de agrupamento de v´ertices para detecc¸ ˜ao de comunidades em redes complexas de larga-escala. In Workshop em Desempenho de Sistemas Computacionais e de Comunicação.
Chalumeau, T., Costa, L., Laligant, O., and Meriaudeau, F. (2008). Texture discrimination using hierarchical complex networks. In Signal Processing for Image Enhancement and Multimedia Processing, pages 95–102. Springer.
Clauset, A., Newman, M., and Moore, C. (2004). Finding community structure in very large networks. Physical review E, 70(6).
Erds, P. and R´enyi, A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci, 5:17–61.
G1 Team (2018). G1 lanc¸a fato ou fake, novo servic¸o de checagem de conte´udos suspeitos. https://g1.globo.com/fato-ou-fake/noticia/2018/07/30/g1-lanca-fato-ou-fakenovo-servico-de-checagem-de-conteudos-suspeitos.ghtml.
Honnibal, M. and Montani, I. (2017). spaCy 2: Natural language understanding with Bloom embeddings, convolutional neural networks and incremental parsing.
Indurkhya, N. and Damerau, F. (2010). Handbook of natural language processing, volume 2. CRC Press.
Metz, J., Calvo, R., Seno, E., Romero, R., and Liang, Z. (2007). Redes complexas: conceitos e aplicações. Relat´orios T´ecnicos do ICMC/USP.
Milgram, S. (1967). The small world problem. Psychology today, 2(1):60–67.
Monteiro, R., Santos, R., Pardo, T., de Almeida, T., Ruiz, E., and Vale, O. (2018). Contributions to the study of fake news in portuguese: New corpus and automatic detection results. In Computational Processing of the Portuguese Language.
Newman, M. E. (2004). Fast algorithm for detecting community structure in networks. Physical review E, 69(6):066133.
Pena, L. P. J. (2018). Fake news: Uma breve an´alise acerca de sua trajet´oria internacional, consequˆencias políticas e perspectiva jur´ýdica. Revista Dizer, 3(1).
Porcello, F. and Dias, F. (2018). Verdade x mentira: a ameac¸a das fakenews nas eleic¸ ˜oes de 2018 no brasil. In Congresso Brasileiro de Ciˆencias da Comunicação.
Rationality. (1999). The Cambridge Dictionary of Philosophy. Cambridge University Press.
Resende, G., Messias, J., Silva, M., Almeida, J., Vasconcelos, M., and Benevenuto, F. (2018). A system for monitoring public political groups in whatsapp. In Proceedings of the 24th Brazilian Symposium on Multimedia and the Web.
Robertson, D. (1946). A note on the classical origin of ”circumstances”in the medieval confessional. Studies in Philology, 43(1):6–14.
Arney, C. (2009). Linked: How everything is connected to everything else and what it means for business, science, and everyday life. Mathematics and Computer Education, 43(3).
Barbosa, J., Vieira, J., Santos, R., Magalh˜aes Junior, G., Muniz, M., and Moura, R.(2017). Introdução ao processamento de linguagem natural usando python. III Escola Regional de Inform´atica do Piau´í 1:336–360.
Bastian, M., Heymann, S., and Jacomy, M. (2009). Gephi: An open source software for exploring and manipulating networks.
Bird, S., Klein, E., and Loper, E. (2009). Natural language processing with Python: analyzing text with the natural language toolkit. ”O’Reilly Media, Inc.”.
Blondel, V., Guillaume, J., Lambiotte, R., and Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment,(10).
Bondy, J., Murty, U., et al. (1976). Graph theory with applications, volume 290. Citeseer.
Carnivali, G., Vieira, A., Esquef, P., and Ziviani, A. (2018). M´etodo r´apido de agrupamento de v´ertices para detecc¸ ˜ao de comunidades em redes complexas de larga-escala. In Workshop em Desempenho de Sistemas Computacionais e de Comunicação.
Chalumeau, T., Costa, L., Laligant, O., and Meriaudeau, F. (2008). Texture discrimination using hierarchical complex networks. In Signal Processing for Image Enhancement and Multimedia Processing, pages 95–102. Springer.
Clauset, A., Newman, M., and Moore, C. (2004). Finding community structure in very large networks. Physical review E, 70(6).
Erds, P. and R´enyi, A. (1960). On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci, 5:17–61.
G1 Team (2018). G1 lanc¸a fato ou fake, novo servic¸o de checagem de conte´udos suspeitos. https://g1.globo.com/fato-ou-fake/noticia/2018/07/30/g1-lanca-fato-ou-fakenovo-servico-de-checagem-de-conteudos-suspeitos.ghtml.
Honnibal, M. and Montani, I. (2017). spaCy 2: Natural language understanding with Bloom embeddings, convolutional neural networks and incremental parsing.
Indurkhya, N. and Damerau, F. (2010). Handbook of natural language processing, volume 2. CRC Press.
Metz, J., Calvo, R., Seno, E., Romero, R., and Liang, Z. (2007). Redes complexas: conceitos e aplicações. Relat´orios T´ecnicos do ICMC/USP.
Milgram, S. (1967). The small world problem. Psychology today, 2(1):60–67.
Monteiro, R., Santos, R., Pardo, T., de Almeida, T., Ruiz, E., and Vale, O. (2018). Contributions to the study of fake news in portuguese: New corpus and automatic detection results. In Computational Processing of the Portuguese Language.
Newman, M. E. (2004). Fast algorithm for detecting community structure in networks. Physical review E, 69(6):066133.
Pena, L. P. J. (2018). Fake news: Uma breve an´alise acerca de sua trajet´oria internacional, consequˆencias políticas e perspectiva jur´ýdica. Revista Dizer, 3(1).
Porcello, F. and Dias, F. (2018). Verdade x mentira: a ameac¸a das fakenews nas eleic¸ ˜oes de 2018 no brasil. In Congresso Brasileiro de Ciˆencias da Comunicação.
Rationality. (1999). The Cambridge Dictionary of Philosophy. Cambridge University Press.
Resende, G., Messias, J., Silva, M., Almeida, J., Vasconcelos, M., and Benevenuto, F. (2018). A system for monitoring public political groups in whatsapp. In Proceedings of the 24th Brazilian Symposium on Multimedia and the Web.
Robertson, D. (1946). A note on the classical origin of ”circumstances”in the medieval confessional. Studies in Philology, 43(1):6–14.
Published
2019-09-25
How to Cite
BRITO, Lucas Santana; SILVA, Lúcia Emília Soares; MOURA, Raimundo.
Fake News Named Entity Relationship Analysis Through Community Building. In: REGIONAL SCHOOL ON COMPUTING OF CEARÁ, MARANHÃO, AND PIAUÍ (ERCEMAPI), 7. , 2019, São Luís/MA.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2019
.
p. 1-8.
