TY - GEN
T1 - EdgeCentric
T2 - 16th IEEE International Conference on Data Mining Workshops, ICDMW 2016
AU - Shah, Neil
AU - Beutel, Alex
AU - Hooi, Bryan
AU - Akoglu, Leman
AU - Gunnemann, Stephan
AU - Makhija, Disha
AU - Kumar, Mohit
AU - Faloutsos, Christos
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/7/2
Y1 - 2016/7/2
N2 - Given a network with attributed edges, how can we identify anomalous behavior? Networks with edge attributes are ubiquitous, and capture rich information about interactions between nodes. In this paper, we aim to utilize exactly this information to discern suspicious from typical behavior in an unsupervised fashion, lending well to the traditional scarcity of ground-Truth labels in practical anomaly detection scenarios. Our work has a number of notable contributions, including (a) formulation: while most other graph-based anomaly detection works use structural graph connectivity or node information, we focus on the new problem of leveraging edge information, (b) methodology: we introduce EdgeCentric, an intuitive and scalable compression-based approach for detecting edge-Attributed graph anomalies, and (c) practicality: we show that EdgeCentric successfully spots numerous such anomalies in several large, edge-Attributed real-world graphs, including the Flipkart e-commerce graph with over 3 million product reviews between 1.1 million users and 545 thousand products, where it achieved 0.87 precision over the top 100 results.
AB - Given a network with attributed edges, how can we identify anomalous behavior? Networks with edge attributes are ubiquitous, and capture rich information about interactions between nodes. In this paper, we aim to utilize exactly this information to discern suspicious from typical behavior in an unsupervised fashion, lending well to the traditional scarcity of ground-Truth labels in practical anomaly detection scenarios. Our work has a number of notable contributions, including (a) formulation: while most other graph-based anomaly detection works use structural graph connectivity or node information, we focus on the new problem of leveraging edge information, (b) methodology: we introduce EdgeCentric, an intuitive and scalable compression-based approach for detecting edge-Attributed graph anomalies, and (c) practicality: we show that EdgeCentric successfully spots numerous such anomalies in several large, edge-Attributed real-world graphs, including the Flipkart e-commerce graph with over 3 million product reviews between 1.1 million users and 545 thousand products, where it achieved 0.87 precision over the top 100 results.
KW - Anomaly detection
KW - Edge attributes
KW - Network
KW - Ranking
KW - Unsupervised
UR - http://www.scopus.com/inward/record.url?scp=85015201922&partnerID=8YFLogxK
U2 - 10.1109/ICDMW.2016.0053
DO - 10.1109/ICDMW.2016.0053
M3 - Conference contribution
AN - SCOPUS:85015201922
T3 - IEEE International Conference on Data Mining Workshops, ICDMW
SP - 327
EP - 334
BT - Proceedings - 16th IEEE International Conference on Data Mining Workshops, ICDMW 2016
A2 - Domeniconi, Carlotta
A2 - Gullo, Francesco
A2 - Bonchi, Francesco
A2 - Bonchi, Francesco
A2 - Domingo-Ferrer, Josep
A2 - Baeza-Yates, Ricardo
A2 - Baeza-Yates, Ricardo
A2 - Baeza-Yates, Ricardo
A2 - Zhou, Zhi-Hua
A2 - Wu, Xindong
PB - IEEE Computer Society
Y2 - 12 December 2016 through 15 December 2016
ER -