在线社交网络中对抗演变的垃圾信息者策略
71 浏览量
更新于2024-08-28
收藏 1.26MB PDF 举报
"对抗在线社交网络中不断进化的垃圾信息制造者"
这篇研究论文"Combating the evolving spammers in online social networks"聚焦于当前一个日益严重的问题：如何在如Facebook和新浪微博这样的在线社交网络中抵御不断演化的垃圾信息制造者。随着社交媒体平台成为信息分享和社交活动的主要场所，垃圾信息制造者也开始利用这些平台来传播垃圾信息，通常通过创建虚假账户进行。
尽管已经提出了许多检测方法来解决这个问题，并且在一定程度上显示出了成功，但随着垃圾信息制造者逃避检测的策略不断进化，许多现有的方法逐渐失去了效力。文章指出，以前的方法主要局限在于它们依赖静态时间点的特征来识别垃圾信息制造者，而忽视了时间因素的影响。
在该研究中，作者Qiang Fu、Bo Feng、Dong Guo等提出了一个新的视角，他们考虑到了时间变化的因素，试图捕捉垃圾信息制造者行为模式的动态性。这种方法可能有助于更准确地跟踪和预测垃圾信息制造者的活动模式，从而提高检测效率。研究可能涉及利用机器学习和数据挖掘技术，分析用户的行为模式、交互模式以及信息传播模式，以识别异常行为。
此外，论文可能会探讨如何建立适应性更强的模型，这些模型能够随着时间推移自我更新和学习，以应对垃圾信息制造者策略的快速变化。这可能包括深度学习、时间序列分析和社交网络分析等技术的运用。论文还可能讨论了实验设计、结果评估以及与现有方法的比较，以证明其提出的解决方案的有效性和优越性。
这篇研究论文对于理解并对抗在线社交网络中的垃圾信息问题具有重要意义，它强调了考虑时间维度和动态行为分析在识别和阻止垃圾信息制造者方面的必要性。这一研究不仅对学术界有指导价值，也为业界提供了一种可能的、更为先进的反垃圾信息策略。
researches but did not provide sophisticated and efficient
methods of detection.
Subsequently, many approaches have been proposed to
combat spam in online social networks.These approaches can
be generally divided into two types: machine learning-based
(
Hu et al., 2013; Lee et al., 2010; Lee and Kim, 2012; Wang et al.,
2015) and social-graph-based (Cao et al., 2012; Xue et al., 2013;
Yang et al., 2012
) approaches. Chen et al. (2015) constructed a
huge ground-truth dataset consisting of 6.5 million spam tweets
and 6 million non-spam tweets, and then conducted a com-
prehensive evaluation of different machine learning algorithms
using lightweight features.
Gao et al. (2012) present an online
spam filtering system as a component of online social network
platforms. They aggregated messages generated by users to
campaigns by adopting incremental clustering algorithm and
used six features to distinguish spam campaigns.
Cao et al.
(2012) designed an inference scheme to detect fake accounts
by computing the landing probability of early terminated
random walks.Yang et al
(2013) further explored the friend in-
vitation graphs and developed a detection system based on it.
Given the ability of spammers to rapidly change their tactics
to evade such detections (
Zhu et al., 2012), these approaches
are not very effective.
To meet this challenge, researchers have developed their
countermeasures.
Yang et al. (2013) identified and verified
several common evasion strategies used by spammers, de-
signed some more sophisticated detection features based on
the analysis, and then proposed a formal model to evaluate
the robustness of the new features.
Fu et al. (2015) extracted
the carefulness of users as a metric to indicate how careful a
user is when following another user, and subsequently made
use of this parameter to adjust and improve existing features
and methods.
Chen et al. (2017) focused on the “Twitter spam
drift” problem in which spammers post more tweets with the
similar semantic meaning but different text to evade detec-
tion; they proposed a “Lfun” approach which learns from
unlabeled tweets to address the “Twitter Spam Drift” problem.
However, the weakness of the above approaches is that they
do not address the critical issue as they still consider the social
networks as a static system, whereas spammers are con-
stantly finding new evasion techniques.To address this problem,
we propose a dynamic metric to describe temporal patterns
of users and develop a novel method for identifying spammers.
It is one of the main differences between our method and other
previous approaches.
3. Preliminary
Before illustrating our study in detail, we provide the motiva-
tion behind our work and the assumptions used in our
approach.
3.1. Motivation
As mentioned earlier, the means that spammers use to evade
detection are becoming increasingly sophisticated. If an in-
spection system is capable of discovering majority of the
spamming accounts at a period, its capacity to do so at another
period is uncertain.
The main reason for this new challenge is that most de-
tection mechanisms characterize users on the basis of their
features at a single point of time, whereas spammers continu-
ously optimize their spamming strategies.This aspect motivated
us to obtain a deeper insight about users in terms of tempo-
ral evolution patterns and design a detection system.
3.2. Assumptions
To make the proposed approach more reasonable, we make fol-
lowing assumptions according to the observations of the dataset
and the experiences of previous studies.
Assumption 1. Spammers constantly change their spamming
strategies.
This assumption is mentioned and utilized in many exist-
ing approaches, such as
Liu et al. (2016); Tan et al. (2013). The
reason behind this assumption is easy to understand: As the
intensity of detection increases, only those spammers who
adjust their strategies according to the detection method will
be able to survive. Meanwhile, legitimate users will not have
to make these adjustments, thus forming relatively non-
volatile patterns.
Assumption 2. Spammers tend to control a large number of
accounts to spread spam.
The profits of spammers’ activities are dependent on the
extent of users to which their spam messages can reach.
Because of the broad adoption of features based on bursty prop-
erty, such as time interval, spammers cannot generate a massive
amount of spam information using a few accounts. There-
fore, spammers usually create or compromise a significant
number of accounts and use them to spread spam to a large
set of users, thereby resulting in corresponding spam ac-
counts with similar behavioral patterns.
4. Dynamic metric
In this section, we first present the activity measures that are
used to build our dynamic metric.These activity measures prin-
cipally consist of features based on users’ activities. We then
illustrate the proposed dynamic metric and the new features
for characterizing the evolution patterns and detecting
spammers.
4.1. Activity measures
The features that we use as activity measures to build the
dynamic metric are divided into two categories: graph-based
and non-graph-based. For a spammer, the first step to spread
the malicious information in social networks is to establish
social relationships with other users, thus features based on
the social graph is a primary source of access to users’ pref-
erences and characteristics. We select four of these features:
degree centrality, bidirectional link ratio, betweenness centrality, and
62 computers & security 72 (2018) 60–73
剩余13页未读，继续阅读
2020-11-25 上传
2021-02-07 上传
2021-02-07 上传
2021-02-09 上传
2009-12-08 上传
2021-02-21 上传
2021-02-10 上传
2014-10-14 上传
weixin_38727694
- 粉丝: 4
- 资源: 947
我的内容管理
展开
最新资源
- 前端协作项目：发布猜图游戏功能与待修复事项
- Spring框架REST服务开发实践指南
- ALU课设实现基础与高级运算功能
- 深入了解STK：C++音频信号处理综合工具套件
- 华中科技大学电信学院软件无线电实验资料汇总
- CGSN数据解析与集成验证工具集：Python和Shell脚本
- Java实现的远程视频会议系统开发教程
- Change-OEM: 用Java修改Windows OEM信息与Logo
- cmnd：文本到远程API的桥接平台开发
- 解决BIOS刷写错误28：PRR.exe的应用与效果
- 深度学习对抗攻击库：adversarial_robustness_toolbox 1.10.0
- Win7系统CP2102驱动下载与安装指南
- 深入理解Java中的函数式编程技巧
- GY-906 MLX90614ESF传感器模块温度采集应用资料
- Adversarial Robustness Toolbox 1.15.1 工具包安装教程
- GNU Radio的供应商中立SDR开发包：gr-sdr介绍
