Projects per year
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 language | English |
---|---|
Pages | 1197-1202 |
Number of pages | 6 |
DOIs | |
Publication status | Published - Oct 2011 |
Event | 20th ACM Conference on Information and Knowledge Management - Glasgow, United Kingdom Duration: 24 Oct 2011 → 28 Oct 2011 |
Conference
Conference | 20th ACM Conference on Information and Knowledge Management |
---|---|
Abbreviated title | CIKM 2011 |
Country/Territory | United Kingdom |
City | Glasgow |
Period | 24/10/2011 → 28/10/2011 |
Bibliographical note
ISSN: 978-1-4503-0717-8Fingerprint
Dive into the research topics of 'Detecting Anomalies in Graphs with Numeric Labels'. Together they form a unique fingerprint.Projects
- 1 Finished
-
R1118ECI: Centre for Secure Information Technologies (CSIT)
McCanny, J. V. (PI), Cowan, C. (CoI), Crookes, D. (CoI), Fusco, V. (CoI), Linton, D. (CoI), Liu, W. (CoI), Miller, P. (CoI), O'Neill, M. (CoI), Scanlon, W. (CoI) & Sezer, S. (CoI)
01/08/2009 → 30/06/2014
Project: Research