TY  - JOUR
T1  - Proposal of a Graph Based Chat Message Analysis Model for Messenger User Verification
AU  - Lee, Da-Young 
AU  - Cho, Hwan-Gue 
JO  - Journal of KIISE, JOK
PY  - 2022
DA  - 2022/1/14
DO  - 10.5626/JOK.2022.49.9.696
KW  - user verification
KW  - messenger chatting
KW  - chatting message
KW  - random walk
KW  - graph analysis
AB  - As crimes and accidents through messengers increase, the necessity of verifying messenger users is emerging. In this study, two graph-based messenger user verification models that apply the traditional author verification problem to chat text were proposed. First, the graph random walk model builds an n-gram transition graph with a previous chat message and verifies the user by learning the characteristic of traversing the transition graph with a message whose author is unknown. The results showed an accuracy of 86% in 10,000 chat conversations. Second, the graph volume model verified the user using the characteristic that the size of the transition graph increased over time and achieved an accuracy of 87% in 1,000 chat conversations. When the density of the chat messages was calculated based on the transmission time, both graph models could guarantee more than 80% accuracy when the chat density was 15 or more.