Online reviews on platforms such as Amazon and Yelp significantly influence consumer decisions and business reputations. However, spammers form groups that strategically control product reviews over specific periods to manipulate consumer sentiment and decision-making. Traditional spammer group detection methods face two primary issues: 1) knowledge marginalization: interactions dominate the model to form candidate groups, potentially marginalizing valuable structured knowledge; and 2) temporal knowledge discrepancy: inconsistencies in users’ temporal activities and behavioral features lead to blurry classification of candidate groups. To address these two limitations, we introducetemporal knowledge consistency for spammer groups detection via contrastive learningcalled TKCCL. We employ dual-view encoders derived from knowledge graphs and heterogeneous information networks to learn informative representations, thereby alleviating knowledge marginalization. TKCCL maps the temporal knowledge as vectors to measure consistency, enhancing users’ rating proximity and temporal synchronization in dual views, thereby reducing temporal knowledge discrepancies. We optimize spammer group detection by modeling it as a greedy set cover problem, which enhances the method’s responsiveness to dynamic spam strategies. Experimental results on four public datasets demonstrate that TKCCL substantially outperforms existing methods. Our code is available athttps://github.com/NeenLee/TKCCL.

In this paper, we take a different angle to evaluate compiler optimizations than all existing works in compiler testing literature. In particular, we consider a specific scenario in software development, that is, when developers manually optimize a program to improve its performance, do compilers actually generate more efficient code with the help of developers' optimizations?