Detecting Fake Online Reviews: An Unsupervised Detection Method With a Novel Performance Evaluation

被引:5
|
作者
Pan, Yuchen [1 ]
Xu, Lu [1 ]
机构
[1] Renmin Univ China, Sch Informat Resource Management, Beijing 100872, Peoples R China
基金
中国国家自然科学基金;
关键词
Fake-review detection; unsupervised problem; fake reviews; online recommenders; recommender metric; online reviews; RANKING; NETWORK; FRAUD;
D O I
10.1080/10864415.2023.2295067
中图分类号
F [经济];
学科分类号
02 ;
摘要
Fake reviews are critical issues in the online world, as they affect the credibility of e-commerce platforms and undermine consumers' trust. Therefore, fake-review detection is of great significance. Since fake-review detection is an unsupervised problem, most existing methods and performance metrics cannot be applied. In addition, contemporary review manipulations are much more difficult to detect than before. To address these two problems, we first propose a fully unsupervised method with steps of survey research, fake-review feature analysis, fake index estimation, and fake-review selection. Fake-review features can be accurately derived from existing studies and survey research. Second, we propose a recommendation-based performance metric for evaluating fake-review detection methods. This metric differs from traditional binary classification performance metrics, as it can be used on review data with no objective review authenticity classifications. In this research, we utilize Dianping as a case study to evaluate the effectiveness of the proposed detection method and performance metric.
引用
收藏
页码:84 / 107
页数:24
相关论文
共 50 条
  • [21] GAMC: An Unsupervised Method for Fake News Detection Using Graph Autoencoder with Masking
    Yin, Shu
    Zhu, Peican
    Wu, Lianwei
    Gao, Chao
    Wang, Zhen
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 1, 2024, : 347 - 355
  • [22] Review tree: an unsupervised method to auto-generate visual summary of online reviews
    Das, Bhaskarjyoti
    Prathima, V. R.
    PROCEEDINGS OF THE 2016 2ND INTERNATIONAL CONFERENCE ON APPLIED AND THEORETICAL COMPUTING AND COMMUNICATION TECHNOLOGY (ICATCCT), 2016, : 582 - 587
  • [23] SGAN-SAM-ERNIE: A Novel and Effective Detection Scheme for Chinese Fake Reviews
    Zhang, Min
    Zhang, Yuhang
    Zhang, Xuanjie
    IEEE ACCESS, 2024, 12 : 114190 - 114197
  • [24] A Novel Ensemble Model BharatAuthenticNet for Detecting Fake News: Experimentation and Performance Analysis
    Singh, Manish Kumar
    Ahmed, Jawed
    Raghuvanshi, Kamlesh Kumar
    Alam, Mohammad Afshar
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2025,
  • [25] A Novel Laser-based System: Fully Online Detection of Abnormal Activity via an Unsupervised Method
    Song, Xuan
    Shao, Xiaowei
    Shibasaki, Ryosuke
    Zhao, Huijing
    Cui, Jinshi
    Zha, Hongbin
    2011 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2011, : 1317 - 1322
  • [26] User experience evaluation method based on online product reviews
    Cheng, Fangmin
    Yu, Suihuai
    Qin, Shengfeng
    Chu, Jianjie
    Chen, Jian
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (01) : 1791 - 1805
  • [27] A Novel Parallel Hybrid k-Means and HGSO Based Approach for Detecting Fake Reviews in Social Media
    Rajendra Purohit
    K. R. Chowdhary
    S. D. Purohit
    Raju Pal
    Harish Sharma
    SN Computer Science, 6 (5)
  • [28] Transparency in healthcare and e-commerce: detecting online fake reviews using a dense neural network model with relevance mapping
    Deshai, N.
    Rao, B. Bhaskara
    SOFT COMPUTING, 2023, 27 (14) : 9861 - 9875
  • [29] A Novel Method for Detecting Fake news: Deep Learning Based on Propagation Path Concept
    Torgheh, Fatemeh
    Masoumi, Behrooz
    Keyvanpour, Mohammad Reza
    Shojaedini, Seyed Vahab
    2021 26TH INTERNATIONAL COMPUTER CONFERENCE, COMPUTER SOCIETY OF IRAN (CSICC), 2021,
  • [30] A novel heuristic method for detecting overfit in unsupervised classification of climate model data
    Boland, Emma J. D.
    Atkinson, Erin
    Jones, Dani C.
    ENVIRONMENTAL DATA SCIENCE, 2023, 2