Weighted reviewer graph based spammer group detection and characteristic analysis

doi:10.11772/j.issn.1001-9081.2018122611

Journal of Computer Applications ›› 2019, Vol. 39 ›› Issue (6): 1595-1600.DOI: 10.11772/j.issn.1001-9081.2018122611

• 2018 National Annual Conference on High Performance Computing (HPC China 2018) • Previous Articles Next Articles

Weighted reviewer graph based spammer group detection and characteristic analysis

ZHANG Qi¹, JI Shujuan¹, FU Qiang², ZHANG Chunjin³

1. Shandong Key Laboratory of Wisdom Mine Information Technology(Shandong University of Science and Technology), Qingdao Shangdong 266590, China;
2. Technical Reconnaissance Detachment, Qinhuangdao Public Security Bureau, Qinhuangdao Hebei 066100, China;
3. Network Information Center, Shandong University of Science and Technology, Qingdao Shangdong 266590, China

Received:2018-12-12 Revised:2019-03-25 Online:2019-06-10 Published:2019-06-17
Supported by:
This work is partially supported by the National Natural Science Foundation of China (71772107, 61502281).

基于带权评论图的水军群组检测及特征分析

张琪¹, 纪淑娟¹, 傅强², 张纯金³

1. 山东省智慧矿山信息技术重点实验室(山东科技大学), 山东青岛 266590;
2. 秦皇岛市公安局技术侦察支队, 河北秦皇岛 066000;
3. 山东科技大学网络信息中心, 山东青岛 266590

通讯作者: 纪淑娟
作者简介:张琪(1995-),男,山东泰安人,硕士研究生,CCF会员,主要研究方向:人工智能;纪淑娟(1977-),女,河北唐山人,副教授,博士,CCF高级会员,主要研究方向:分布式智能、智能信息处理;傅强(1983-),男,河北唐山人,工程师,主要研究方向:智能信息处理、虚假信息检测;张纯金(1977-),男,山东菏泽人,工程师,硕士,主要研究方向:网络安全、智能信息处理。
基金资助:
国家自然科学基金资助项目（71772107，61502281）。

Abstract

Abstract: Concerning the problem that how to detect spammer groups writing fake reviews on the e-commerce platforms, a Weighted reviewer Graph based Spammer group detection Algorithm (WGSA) was proposed. Firstly, a weighted reviewer graph was built based on the co-reviewing feature with the weight calculated by a series of group spam indicators. Then, a threshold was set for the edge weight to filter the suspicious subgraphs. Finally, considering the community structure of the graph, the community discovery algorithm was used to generate the spammer groups. Compared with K-Means clustering algorithm (KMeans), Density-Based spatial clustering of applications with noise (DBscan) and hierarchical clustering algorithm on the large dataset Yelp, the accuracy of WGSA is higher. The characteristics and distinction of the detected spammer groups were also analyzed, which show that spammer groups with different activeness have different harm. The high-active group is more harmful and should be concerned more.

Key words: e-commerce, spammer group, weighted reviewer graph, community discovery, clustering

摘要： 针对在电子商务平台上检测编写虚假评论的水军群组的问题，提出了基于带权评论图的水军群组检测算法（WGSA）。首先，利用共评论特征构建带权评论图，权重由一系列群组造假指标计算得到；然后，为边权重设置阈值筛选可疑子图；最后，从图的社区结构出发，利用社区发现算法生成最终的水军群组。在Yelp大型数据集上的实验结果表明，与K均值聚类算法（KMeans）、基于密度的噪声应用空间聚类算法（DBscan）以及层次聚类算法相比WGSA算法的准确度更高，同时对检测到水军群组的特征与差异作了分析，发现水军群组的活跃度不同，危害也不同。其中，高活跃度群组危害最大，应重点关注。

关键词: 电子商务, 水军群组, 带权评论图, 社区发现, 聚类

CLC Number:

TP391.4

ZHANG Qi, JI Shujuan, FU Qiang, ZHANG Chunjin. Weighted reviewer graph based spammer group detection and characteristic analysis[J]. Journal of Computer Applications, 2019, 39(6): 1595-1600.

张琪, 纪淑娟, 傅强, 张纯金. 基于带权评论图的水军群组检测及特征分析[J]. 计算机应用, 2019, 39(6): 1595-1600.

References

[1] MUKHERJEE A, LIU B, GLANCE N. Spotting fake reviewer groups in consumer reviews[C]//Proceedings of the 21st Annual Conference on World Wide Web. New York:ACM, 2012:191-200.
[2] XU C, ZHANG J, CHANG K, et al. Uncovering collusive spammers in Chinese review website[C]//Proceedings of the 22nd ACM International Conference on Information & Knowledge Management. New York:ACM, 2013:979-988.
[3] YE J, AKOGLU L. Discovering opinion spammer groups by network footprints[C]//Proceedings of the 2015 Joint European Conference on Machine Learning and Knowledge Discovery in Databases, LNCS 9284. Cham:Springer, 2015:267-282.
[4] WANG Z, HOU T, SONG D, et al. Detecting review spammer groups via bipartite graph projection[J]. The Computer Journal, 2016, 59(6):861-874.
[5] 张慧杰.基于多特征尺度空间模型的网络水军组织发现技术研究[D].杭州:浙江工商大学,2015:2-66.(ZHANG H J. Research technology on found of spammer organizations based on multi-feature scale space model[D]. Hangzhou:Zhejiang Gongshang University, 2015:2-66.)
[6] RAYANA S, AKOGLU L. Collective opinion spam detection:bridging review networks and metadata[C]//Proceedings of the 201521th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2015:985-994.
[7] RAYANA S, AKOGLU L. Collective opinion spam detection using active inference[C]//Proceedings of the 201616th SIAM International Conference on Data Mining. Philadelphia, PA:SIAM, 2016:630-638.
[8] JINDAL N, LIU B. Opinion spam and analysis[C]//Proceedings of the 2008 International Conference on Web Search & Data Mining. New York:ACM, 2008:219-230.
[9] LIM E, NGUYEN V, JINDAL N, et al. Detecting product review spammers using rating behaviors[C]//Proceedings of the 19th ACM Conference on Information and Knowledge Management. New York:ACM, 2010:939-948.
[10] OTT M, CHOI Y, CARDIE C, et al. Finding deceptive opinion spam by any stretch of the imagination[C]//Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics:Human Language Technologies. Stroudsburg, PA:Association for Computational Linguistics, 2011:309-319.
[11] YU P S, LIU B, XIE S, et al. Review graph based online store review spammer detection[C]//Proceedings of the 11th IEEE International Conference on Data Mining. Piscataway, NJ:IEEE, 2011:1242-1247.
[12] AKOGLU L, CHANDY R, FALOUTSOS C. Opinion fraud detection in online reviews by network effects[C]//Proceedings of the 20137th International Conference on Weblogs and Social Media. Menlo Park, CA:AAAI, 2013:2-11.
[13] LI H, CHEN Z, MUKHERJEE A, et al. Analyzing and detecting opinion spam on a large-scale dataset via temporal and spatial patterns[C]//Proceedings of the 9th International Conference on Web and Social Media. Menlo Park, CA:AAAI, 2015:634-637.
[14] LI H Y, FEI G, SHAO W X, et al. Bimodal distribution and co-bursting in review spam detection[C]//Proceedings of the 26th International Conference on World Wide Web. Republic and Canton of Geneva, Switzerland:International World Wide Web Conferences Steering Committee, 2017:1063-1072.
[15] AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules in large databases[C]//Proceedings of the 20th International Conference on Very Large Data Bases. San Francisco, CA:Morgan Kaufmann Publishers Inc., 1994:487-499.
[16] BLONDEL V D, GUILLAUME J, LAMBIOTTE R, et al. Fast unfolding of communities in large networks[J]. Journal of Statistical Mechanics Theory & Experiment, 2008(10):155-168.
[17] NEWMAN M E J. The structure and function of complex networks[J]. SIAM Review, 2003, 45(2):167-256.
[18] WATTS D J, STROGATZ S H. Collective dynamics of ‘small-world’ networks[J]. Nature, 1998(393):440-442.
[19] FRONCZAK A, FRONCZAK P, HOŁYST J A. Average path length in random networks[J]. Physical Review E, 2004, 70(5):056110.
[20] MUKHERJEE A, KUMAR A, LIU B, et al. Spotting opinion spammers using behavioral footprints[C]//Proceedings of the 2013 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2013:632-640.

Weighted reviewer graph based spammer group detection and characteristic analysis

基于带权评论图的水军群组检测及特征分析

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	CHEN Hengheng, NI Zhiwei, ZHU Xuhui, JIN Yuanyuan, CHEN Qian. Differential privacy high-dimensional data publishing method via clustering analysis [J]. Journal of Computer Applications, 2021, 41(9): 2578-2585.
[2]	ZENG Xiangyin, ZHENG Bochuan, LIU Dan. Detection of left and right railway tracks based on deep convolutional neural network and clustering [J]. Journal of Computer Applications, 2021, 41(8): 2324-2329.
[3]	ZHU Cheng, ZHAO Xiaoqi, ZHAO Liping, JIAO Yuhong, ZHU Yafei, CHENG Jianying, ZHOU Wei, TAN Ying. Classification of functional magnetic resonance imaging data based on semi-supervised feature selection by spectral clustering [J]. Journal of Computer Applications, 2021, 41(8): 2288-2293.
[4]	DAI Yanran, DAI Guoqing, YUAN Yubo. Multi-face foreground extraction method based on skin color learning [J]. Journal of Computer Applications, 2021, 41(6): 1659-1666.
[5]	WANG Jiarui, TAN Guoping, ZHOU Siyuan. Clustered wireless federated learning algorithm in high-speed internet of vehicles scenes [J]. Journal of Computer Applications, 2021, 41(6): 1546-1550.
[6]	WANG Zhihe, CHANG Xiaoqing, DU Hui. Adaptive affinity propagation clustering algorithm based on universal gravitation [J]. Journal of Computer Applications, 2021, 41(5): 1337-1342.
[7]	MA Jianhong, CAO Wenbin, LIU Yuangang, XIA Shuang. Patent clustering method based on functional effect [J]. Journal of Computer Applications, 2021, 41(5): 1361-1366.
[8]	LI Guorong, YE Jimin, ZHEN Yuanting. Time series clustering based on new robust similarity measure [J]. Journal of Computer Applications, 2021, 41(5): 1343-1347.
[9]	LI Xingfeng, HUANG Yuqing, REN Zhenwen, LI Yihong. Robust multi-view clustering algorithm based on adaptive neighborhood [J]. Journal of Computer Applications, 2021, 41(4): 1093-1099.
[10]	LONG Chaoqi, JIANG Yu, XIE Yu. Improved wavelet clustering algorithm based on peak grid [J]. Journal of Computer Applications, 2021, 41(4): 1122-1127.
[11]	QIN Li, HAO Zhigang, LI Guoliang. Construction and correlation analysis of national food safety standard graph [J]. Journal of Computer Applications, 2021, 41(4): 1005-1011.
[12]	LYU Jia, XIAN Yan. Co-training algorithm combining improved density peak clustering and shared subspace [J]. Journal of Computer Applications, 2021, 41(3): 686-693.
[13]	ZOU Zhiwen, QIN Cheng. Method of dynamically constructing spatial topic R-tree based on k-means++ [J]. Journal of Computer Applications, 2021, 41(3): 733-737.
[14]	GUO Jia, HAN Litao, SUN Xianlong, ZHOU Lijuan. Comparative density peaks clustering algorithm with automatic determination of clustering center [J]. Journal of Computer Applications, 2021, 41(3): 738-744.
[15]	ZHANG En, LI Huimin, CHANG Jian. Verifiable k-means clustering scheme with privacy-preserving [J]. Journal of Computer Applications, 2021, 41(2): 413-421.