Collective Spammer Detection in Evolving Multi-Relational Social Networks
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Detecting unsolicited content and the spammers who create it is a long-standing challenge that affects all of us on a daily basis. The recent growth of richly-structured social networks has provided new challenges and opportunities in the spam detection landscape. Motivated by the Tagged.com social network, we develop methods to identify spammers in evolving multi-relational social networks. We model a social network as a time-stamped multi-relational graph where vertices represent users, and edges represent different activities between them. To identify spammer accounts, our approach makes use of structural features, sequence modelling, and collective reasoning. We leverage relational sequence information using k-gram features and probabilistic modelling with a mixture of Markov models. Furthermore, in order to perform collective reasoning and improve the predictive power of a noisy abuse reporting system, we develop a statistical relational model using hinge-loss Markov random fields (HL-MRFs), a class of probabilistic graphical models which are highly scalable. We use Graphlab Create and Probabilistic Soft Logic (PSL) to prototype and experimentally evaluate our solutions on internet-scale data from Tagged.com. Our experiments demonstrate the effectiveness of our approach, and show that models which incorporate the multi-relational nature of the social network significantly gain predictive performance over those that do not.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Uncovering social spammers: social honeypots + machine learning
Lee, K., Caverlee, J., & Webb, S. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835522 · Cited by 619 · cited 1×
“[39] used honeypots in Twitter and MySpace to harvest deceptive spam profiles.”
MethodA survey of learning-based techniques of email spam filtering
Blanzieri, E., & Bryl, A. (2008) · Artificial Intelligence Review · doi:10.1007/s10462-009-9109-6 · Cited by 407
Stein, T., Chen, E., & Mangla, K. (2011) · Proceedings of the 4th Workshop on Social Network Systems · doi:10.1145/1989656.1989664 · Cited by 219
“Learning latent engagement patterns of students in online courses,”
Ramesh, A., Goldwasser, D., Huang, B., Daume III, H., & Getoor, L. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8920 · Cited by 123 · cited 1×
“HLMRFs have achieved state-of-the-art performance in many domains including knowledge graph identification [13], understanding engagements in MOOCs [14], biomedicine and multi-relational link prediction [15, 16], and modelling social trust [17].”
BackgroundSelf-citation
Cited by
Fraud detection: A systematic literature review of graph-based anomaly detection approaches
Pourhabibi, T., Ong, K.-L., Kam, B. H., & Boo, Y. L. (2020) · Decision Support Systems · doi:10.1016/j.dss.2020.113303 · Cited by 434
hPSD: A Hybrid PU-Learning-Based Spammer Detection Model for Product Reviews
Wu, Z., Cao, J., Wang, Y., Wang, Y., Zhang, L., & Wu, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2877161 · Cited by 166
“Along this line, some recent studies [7], [12] proposed utilizing these relationships to define new topological features.”
BackgroundMethodInfluentialWang, T., Peng, Q., Liu, B., Liu, Y., & Wang, Y. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00418 · Cited by 27
“…Zachary’s karate club network (Zachary, 1977), UKfaculty social network (Nepusz et al., 2008), Dolphin Social Network (Lusseau et al., 2003), College football game network (Girvan and Newman, 2002), US Political Books network (Krebs, 2004), and Cora citation network (Fakhraei et al., 2015).”
BackgroundSurvey on Astroturfing Detection and Analysis from an Information Technology Perspective
Chen, T., Liu, J., Wu, Y., Tian, Y., Tong, E., Niu, W., Li, Y., Xiang, Y., & Wang, W. (2021) · Security and Communication Networks · doi:10.1155/2021/3294610 · Cited by 10
“In the structure-based detection of astroturfing, Fakhraei et al. [34] proposed a method to detect abnormal users under the scenario of multiple relational social networks.”
Method
Metadata
- Authors
- Fakhraei, S., Foulds, J., Shashanka, M., & Getoor, L.
- Venue
- Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2015-08-10
- Pages
- 1769-1778
- OpenAlex
- W1994940238
- Cited by
- 109
- References
- 4
- FWCI
- 8.48
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.