Embedding Learning with Relational Heterogeneous Information in Social Network Posts to Detect Malicious Behavior

Although social networking services (SNS) have enabled the free exchange of opinions and feelings, the posting of malicious content has increasingly become a problem. To solve this problem, malicious behavior detection methods based on posting behavior are being developed. Existing methods focus on semantic analysis of posts using natural language processing, and one existing approach uses graph neural networks to consider context from various elements, such as users, posts, hashtags, and entities. However, this approach does not adequately capture the complex patterns and interactions of SNS networks. In particular, it is insufficient to fully capture the complexity of heterogeneity between nodes and edges in an SNS network. In this paper, we propose a method for extended heterogeneous graph construction and an architecture for heterogeneous graph embedding learning. The proposed method focuses on and exploits the diverse heterogeneity of social networks, optimally integrates heterogeneous information from SNS posts, and analyzes the relationships in the data to improve the performance of malicious behavior detection. The effectiveness of the proposed method is demonstrated by evaluation on a newly collected large dataset.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Published
2024-08-21
DOI
https://doi.org/10.1587/transfun.2024smp0004
Citations
1
Primary Topic
Spam and Phishing Detection
Type
article
Field-Weighted Citation Impact
0.78

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Embedding Learning with Relational Heterogeneous Information in Social Network Posts to Detect Malicious Behavior

Soh Yoshida, Ryo Yoshida, Mitsuji Muneyasu
1 citations
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Spam and Phishing Detection
0.78
article

Embedding Learning with Relational Heterogeneous Information in Social Network Posts to Detect Malicious Behavior

Soh Yoshida, Ryo Yoshida, Mitsuji Muneyasu
article en
1 citations

Abstract

Although social networking services (SNS) have enabled the free exchange of opinions and feelings, the posting of malicious content has increasingly become a problem. To solve this problem, malicious behavior detection methods based on posting behavior are being developed. Existing methods focus on semantic analysis of posts using natural language processing, and one existing approach uses graph neural networks to consider context from various elements, such as users, posts, hashtags, and entities. However, this approach does not adequately capture the complex patterns and interactions of SNS networks. In particular, it is insufficient to fully capture the complexity of heterogeneity between nodes and edges in an SNS network. In this paper, we propose a method for extended heterogeneous graph construction and an architecture for heterogeneous graph embedding learning. The proposed method focuses on and exploits the diverse heterogeneity of social networks, optimally integrates heterogeneous information from SNS posts, and analyzes the relationships in the data to improve the performance of malicious behavior detection. The effectiveness of the proposed method is demonstrated by evaluation on a newly collected large dataset.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E108.A(3)
Kansai University (JP)
Kansai University, Japan Society for the Promotion of Science
Reduced inequalities
Openalex Percentile: Top 22%
Spam and Phishing Detection
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.