Detecting Anomalies in Graphs with Numeric Labels

Michael Davis, Weiru Liu, Paul Miller, George Redpath

Research output: Contribution to conferencePaperpeer-review

24 Citations (Scopus)

Abstract

This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-related examples and validated with experiments on a physical Access Control database. Quantitative analysis shows that in the upper range of anomaly thresholds, Yagada detects twice as many anomalies as the best-performing numeric discretization algorithm. Qualitative evaluation shows that the detected anomalies are meaningful, representing a com- bination of structural irregularities and numerical outliers.
Original languageEnglish
Pages1197-1202
Number of pages6
DOIs
Publication statusPublished - Oct 2011
Event20th ACM Conference on Information and Knowledge Management - Glasgow, United Kingdom
Duration: 24 Oct 201128 Oct 2011

Conference

Conference20th ACM Conference on Information and Knowledge Management
Abbreviated titleCIKM 2011
CountryUnited Kingdom
CityGlasgow
Period24/10/201128/10/2011

Bibliographical note

ISSN: 978-1-4503-0717-8

Fingerprint

Dive into the research topics of 'Detecting Anomalies in Graphs with Numeric Labels'. Together they form a unique fingerprint.

Cite this