Cited by 82Complex Network Analysis TechniquesGraph theory and applicationsGraph Theory and Algorithms

Inferring Strange Behavior from Connectivity Pattern in Social Networks

Jiang, Meng, Cui, Peng, Beutel, Alex, Faloutsos, Christos, Yang, Shiqiang·2014·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-319-06608-0_11

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The paper's work can complement other methods used in prior work to detect fake and compromised accounts, such as unsupervised anomaly detection, temporal features, IP addresses, and generic supervised learning.

    “Finally, we highlight that our work can complement other methods used in prior work to detect fake and compromised accounts, such as using unsupervised anomaly detection techniques [50], temporal features [23, 24], IP addresses [45], as well as generic supervised learning [3].”

    From Measuring, Characterizing, and Detecting Facebook Like Farms (2017) · cites this paper as [24]

The citation lists haven’t been fetched yet

References 20 · Cited by 82

Authors
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S.
Affiliations
  • Tsinghua University (CN)
  • Carnegie Mellon University (US)
Venue
Lecture Notes in Computer Science
Published
2014
Pages
126-138
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W81017276
Cited by
82
References
20
Citations by year
2026: 1 · 2025: 1 · 2024: 2 · 2023: 2 · 2022: 7 · 2021: 7 · 2020: 8 · 2019: 7 · 2018: 13 · 2017: 12 · 2016: 9 · 2015: 10 · 2014: 3
FWCI
10.43
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Mathematics › Geometry and Topology › Graph theory and applications
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
Keywords
social networks, adjacency matrix, spectral subspaces, anomaly detection, user behavior detection, block structure, staircase structure, large-scale graphs

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