Residuals-based subgraph detection with cue vertices

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Asilomar Conference on Signals, Systems and Computers

• Publication date

  2015-11-30

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ACSSC.2015.7421401
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Spectral Framework for Anomalous Subgraph Detection

  2014cited by this paper
• Community Detection in Random Networks

  2013cited by this paper
• Bayesian Discovery of Threat Networks

  2013cited by this paper
• Vertex Nomination via Content and Context

  2012cited by this paper
• On hard limits of eigen-analysis based planted clique detection

  2012influential reference
• A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally

  2009cited by this paper
• Local Graph Partitioning using PageRank Vectors

  2006cited by this paper
• Graph evolution: Densification and shrinking diameters

  2006cited by this paper
• Finding community structure in networks using the eigenvectors of matrices.

  2006cited by this paper
• Scaling personalized web search

  2003cited by this paper

• Network discovery using content and homophily

  2017cites this paper
• Le Pouvoir d ’ Information Supplementaire en Detection des Sousgraphes

  2017cites this paper
• The Power of Side-Information in Subgraph Detection

  2016cites this paper
• Subgraph Detection with cues using Belief Propagation

  2016cites this paper
• Intersection and convex combination in multi-source spectral planted cluster detection

  2016cites this paper