Detecting Collusive Spamming Activities in Community Question Answering

被引:11
|
作者
Liu, Yuli [1 ]
Liu, Yiqun [1 ]
Zhou, Ke [2 ]
Zhang, Min [1 ]
Ma, Shaoping [1 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing, Peoples R China
[2] Univ Nottingham, Sch Comp Sci, Nottingham, England
来源
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17) | 2017年
关键词
Community Question Answering; Crowdsourcing Manipulation; Spam Detection; Factor Graph;
D O I
10.1145/3038912.3052594
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Community Question Answering (CQA) portals provide rich sources of information on a variety of topics. However, the authenticity and quality of questions and answers (Q&As) has proven hard to control. In a troubling direction, the widespread growth of crowdsourcing websites has created a large-scale, potentially difficult-to-detect workforce to manipulate malicious contents in CQA. The crowd workers who join the same crowdsourcing task about promotion campaigns in CQA collusively manipulate deceptive Q&As for promoting a target (product or service). The collusive spamming group can fully control the sentiment of the target. How to utilize the structure and the attributes for detecting manipulated Q&As? How to detect the collusive group and leverage the group information for the detection task? To shed light on these research questions, we propose a unified framework to tackle the challenge of detecting collusive spamming activities of CQA. First, we interpret the questions and answers in CQA as two independent networks. Second, we detect collusive question groups and answer groups from these two networks respectively by measuring the similarity of the contents posted within a short duration. Third, using attributes (individual-level and group-level) and correlations (user-based and content-based), we proposed a combined factor graph model to detect deceptive Q&As simultaneously by combining two independent factor graphs. With a large-scale practical data set, we find that the proposed framework can detect deceptive contents at early stage, and outperforms a number of competitive baselines.
引用
收藏
页码:1073 / 1082
页数:10
相关论文
共 50 条
  • [1] Predicting Question Popularity for Community Question Answering
    Wu, Yuehong
    Wen, Zhiwei
    Liang, Shangsong
    ELECTRONICS, 2024, 13 (16)
  • [2] Learning to Rank for Question Routing in Community Question Answering
    Ji, Zongcheng
    Wang, Bin
    PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 2363 - 2368
  • [3] Knowledge Graph Based Question Routing for Community Question Answering
    Liu, Zhu
    Li, Kan
    Qu, Dacheng
    NEURAL INFORMATION PROCESSING, ICONIP 2017, PT V, 2017, 10638 : 721 - 730
  • [4] User correlation model for question recommendation in community question answering
    Fu, Chaogang
    APPLIED INTELLIGENCE, 2020, 50 (02) : 634 - 645
  • [5] Dual Role Model for Question Recommendation in Community Question Answering
    Xu, Fei
    Ji, Zongcheng
    Wang, Bin
    SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2012, : 771 - 779
  • [6] Manhattan Siamese LSTM for Question Retrieval in Community Question Answering
    Othman, Nouha
    Faiz, Rim
    Smaili, Kamel
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2019 CONFERENCES, 2019, 11877 : 661 - 677
  • [7] User correlation model for question recommendation in community question answering
    Chaogang Fu
    Applied Intelligence, 2020, 50 : 634 - 645
  • [8] QAAN: Question Answering Attention Network for Community Question Classification
    Wang, Yuntao
    Huang, Weiqing
    2021 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2021,
  • [9] User intimacy model for question recommendation in community question answering
    Fu, Chaogang
    KNOWLEDGE-BASED SYSTEMS, 2020, 188
  • [10] Learning pairwise patterns in Community Question Answering
    Filice, Simone
    Moschitti, Alessandro
    INTELLIGENZA ARTIFICIALE, 2018, 12 (02) : 49 - 65