Residuals-based subgraph detection with cue vertices

Benjamin A.  Miller; Stephen Kelley; Rajmonda S. Caceres; Steven T. Smith

doi:10.1109/ACSSC.2015.7421401

Residuals-based subgraph detection with cue vertices

Benjamin A. Miller, Stephen Kelley, Rajmonda S. Caceres, Steven T. Smith

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A common problem in modern graph analysis is the detection of communities, an example of which is the detection of a single anomalously dense subgraph. Recent results have demonstrated a fundamental limit for this problem when using spectral analysis of modularity. In this paper, we demonstrate the implication of these results on subgraph detection when a cue vertex is provided, indicating one of the vertices in the community of interest. Several recent algorithms for local community detection are applied in this context, and we compare their empirical performance to that of the simple method used to derive the theoretical detection limits.

Original language	English
Title of host publication	Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	1530-1534
Number of pages	5
ISBN (Electronic)	9781467385763
DOIs	https://doi.org/10.1109/ACSSC.2015.7421401
State	Published - 26 Feb 2016
Externally published	Yes
Event	49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: 8 Nov 2015 → 11 Nov 2015

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2016-February
ISSN (Print)	1058-6393

Conference

Conference	49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/Territory	United States
City	Pacific Grove
Period	8/11/15 → 11/11/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Access to Document

10.1109/ACSSC.2015.7421401

Cite this

Miller, B. A., Kelley, S., Caceres, R. S., & Smith, S. T. (2016). Residuals-based subgraph detection with cue vertices. In M. B. Matthews (Ed.), Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 (pp. 1530-1534). [7421401] (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2016-February). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421401

Miller, Benjamin A. ; Kelley, Stephen ; Caceres, Rajmonda S. et al. / Residuals-based subgraph detection with cue vertices. Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. editor / Michael B. Matthews. IEEE Computer Society, 2016. pp. 1530-1534 (Conference Record - Asilomar Conference on Signals, Systems and Computers).

@inproceedings{a8662a9d99ac4e2cbc22ed557e46b195,

title = "Residuals-based subgraph detection with cue vertices",

abstract = "A common problem in modern graph analysis is the detection of communities, an example of which is the detection of a single anomalously dense subgraph. Recent results have demonstrated a fundamental limit for this problem when using spectral analysis of modularity. In this paper, we demonstrate the implication of these results on subgraph detection when a cue vertex is provided, indicating one of the vertices in the community of interest. Several recent algorithms for local community detection are applied in this context, and we compare their empirical performance to that of the simple method used to derive the theoretical detection limits.",

author = "Miller, {Benjamin A.} and Stephen Kelley and Caceres, {Rajmonda S.} and Smith, {Steven T.}",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 ; Conference date: 08-11-2015 Through 11-11-2015",

year = "2016",

month = feb,

day = "26",

doi = "10.1109/ACSSC.2015.7421401",

language = "English",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "1530--1534",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015",

address = "United States",

}

Miller, BA, Kelley, S, Caceres, RS & Smith, ST 2016, Residuals-based subgraph detection with cue vertices. in MB Matthews (ed.), Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015., 7421401, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2016-February, IEEE Computer Society, pp. 1530-1534, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 8/11/15. https://doi.org/10.1109/ACSSC.2015.7421401

Residuals-based subgraph detection with cue vertices. / Miller, Benjamin A. ; Kelley, Stephen; Caceres, Rajmonda S. et al.
Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. ed. / Michael B. Matthews. IEEE Computer Society, 2016. p. 1530-1534 7421401 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2016-February).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Residuals-based subgraph detection with cue vertices

AU - Miller, Benjamin A.

AU - Kelley, Stephen

AU - Caceres, Rajmonda S.

AU - Smith, Steven T.

PY - 2016/2/26

Y1 - 2016/2/26

N2 - A common problem in modern graph analysis is the detection of communities, an example of which is the detection of a single anomalously dense subgraph. Recent results have demonstrated a fundamental limit for this problem when using spectral analysis of modularity. In this paper, we demonstrate the implication of these results on subgraph detection when a cue vertex is provided, indicating one of the vertices in the community of interest. Several recent algorithms for local community detection are applied in this context, and we compare their empirical performance to that of the simple method used to derive the theoretical detection limits.

AB - A common problem in modern graph analysis is the detection of communities, an example of which is the detection of a single anomalously dense subgraph. Recent results have demonstrated a fundamental limit for this problem when using spectral analysis of modularity. In this paper, we demonstrate the implication of these results on subgraph detection when a cue vertex is provided, indicating one of the vertices in the community of interest. Several recent algorithms for local community detection are applied in this context, and we compare their empirical performance to that of the simple method used to derive the theoretical detection limits.

UR - http://www.scopus.com/inward/record.url?scp=84969822814&partnerID=8YFLogxK

U2 - 10.1109/ACSSC.2015.7421401

DO - 10.1109/ACSSC.2015.7421401

M3 - Conference contribution

AN - SCOPUS:84969822814

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 1530

EP - 1534

BT - Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

A2 - Matthews, Michael B.

PB - IEEE Computer Society

T2 - 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

Y2 - 8 November 2015 through 11 November 2015

ER -

Miller BA, Kelley S, Caceres RS, Smith ST. Residuals-based subgraph detection with cue vertices. In Matthews MB, editor, Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. IEEE Computer Society. 2016. p. 1530-1534. 7421401. (Conference Record - Asilomar Conference on Signals, Systems and Computers). doi: 10.1109/ACSSC.2015.7421401

Residuals-based subgraph detection with cue vertices

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this