Leman Akoglu

Leman Akoglu

Auto-generated profile, based on publicly available information

Leman Akoglu

Carnegie Mellon University, Pittsburgh, PA, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 October 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XMXiaoxiao Ma
Xiaoxiao Ma
Jia WUJia WU
Jia WU
SXShan Xue
Shan Xue
JYJian Yang
Jian Yang
CZChuan Zhou
Chuan Zhou
LALeman Akoglu
Leman Akoglu
Anomalies are rare observations (e.g., data records or events) that deviate significantly from the others in the sample. Over the past few decades, research on anomaly mining has received increasing interests due to the implications of these occurrences in a wide range of disciplines - for instance, security, finance, and medicine. For this reason, anomaly detection, which aims to identify these rare observations, has become one of the most vital tasks in the world and has shown its power in preventing detrimental events, such as financial fraud, network intrusions, and social spam. The detection task is typically solved by identifying outlying data points in the feature space, which, inherently, overlooks the relational information in real-world data. At the same time, graphs have been prevalently used to represent the structural/relational information, which raises the graph anomaly detection problem - identifying anomalous graph objects (i.e., nodes, edges and sub-graphs) in a single graph, or anomalous graphs in a set/database of graphs. Conventional anomaly detection techniques cannot tackle this problem well because of the complexity of graph data (e.g., irregular structures, relational dependencies, node/edge types/attributes/directions/multiplicities/weights, large scale, etc.). However, thanks to the advent of deep learning in breaking these limitations, graph anomaly detection with deep learning has received a growing attention recently. In this survey, we aim to provide a systematic and comprehensive review of the contemporary deep learning techniques for graph anomaly detection. Specifically, we provide a taxonomy that follows a task-driven strategy and categorizes existing work according to the anomalous graph objects that they can detect. We especially focus on the challenges in this research area and discuss the key intuitions, technical details as well as relative strengths and weaknesses of various techniques in each category. From the survey results, we highlight 12 future research directions spanning unsolved and emerging problems introduced by graph data, anomaly detection, deep learning and real-world applications. Additionally, to provide a wealth of useful resources for future studies, we have compiled a set of open-source implementations, public datasets, and commonly-used evaluation metrics. With this survey, our goal is to create a “one-stop-shop” that provides a unified understanding of the problem categories and existing approaches, publicly available hands-on resources, and high-impact open challenges for graph anomaly detection using deep learning.

1 June 2023 in Big Data
Verified
Journal Article
Closed access
LZLingxiao Zhao
Lingxiao Zhao
LALeman Akoglu
Leman Akoglu
It is common practice of the outlier mining community to repurpose classification datasets toward evaluating various detection models. To that end, often a binary classification dataset is used, where samples from one of the classes are designated as the “inlier” samples, and the other class is substantially down-sampled to create the (ground-truth) “outlier” samples. Graph-level outlier detection (GLOD) is rarely studied but has many potentially influential real-world applications. In this study, we identify an intriguing issue with repurposing graph classification datasets for GLOD. We find that ROC-AUC performance of the models changes significantly (“flips” from high to very low, even worse than random) depending on which class is down-sampled. Interestingly, ROC-AUCs on these two variants approximately sum to 1 and their performance gap is amplified with increasing propagations for a certain family of propagation-based outlier detection models. We carefully study the graph embedding space produced by propagation-based models and find two driving factors: (1) disparity between within-class densities, which is amplified by propagation, and (2) overlapping support (mixing of embeddings) across classes. We also study other graph embedding methods and downstream outlier detectors, and we find that the intriguing “performance flip” issue still widely exists but which version of the down-sample achieves higher performance may vary. Thoughtful analysis over comprehensive results further deepens our understanding of the established issue. With this study, we aim at drawing attention to this (to our knowledge) previously unnoticed issue for the rarely studied GLOD problem, and specifically to the following questions: (1) Given the performance flip issue we identified, where one version of the down-sample often yields worse-than-random performance, is it appropriate to evaluate GLOD by average performance across all down-sampled versions when repurposing graph classification datasets? (2) Considering consistently observed performance flip issue across different graph embedding methods we studied, is it possible to design better graph embedding methods to overcome the issue? We conclude the article with our insights to these questions.

2 August 2018 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
MMMeghanath Macha
Meghanath Macha
LALeman Akoglu
Leman Akoglu

20 February 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
HNHung T. Nguyen
Hung T. Nguyen
PLPierre J. Liang
Pierre J. Liang
LALeman Akoglu
Leman Akoglu
Within a large database 𝒢 containing graphs with labeled nodes and directed, multi-edges; how can we detect the anomalous graphs? Most existing work are designed for plain (unlabeled) and/or simple (unweighted) graphs. We introduce CODEtect , the first approach that addresses the anomaly detection task for graph databases with such complex nature. To this end, it identifies a small representative set 𝒮 of structural patterns (i.e., node-labeled network motifs) that losslessly compress database 𝒢 as concisely as possible. Graphs that do not compress well are flagged as anomalous. CODEtect exhibits two novel building blocks: (i) a motif-based lossless graph encoding scheme, and (ii) fast memory-efficient search algorithms for 𝒮. We show the effectiveness of CODEtect on transaction graph databases from three different corporations and statistically similar synthetic datasets, where existing baselines adjusted for the task fall behind significantly, across different types of anomalies and performance metrics.

13 February 2020 in arXiv
Verified
Preprint
Open access
PDF file
LZLingxiao Zhao
Lingxiao Zhao
LALeman Akoglu
Leman Akoglu
The performance of graph neural nets (GNNs) is known to gradually decrease with increasing number of layers. This decay is partly attributed to oversmoothing, where repeated graph convolutions eventually make node embeddings indistinguishable. We take a closer look at two different interpretations, aiming to quantify oversmoothing. Our main contribution is PairNorm, a novel normalization layer that is based on a careful analysis of the graph convolution operator, which prevents all node embeddings from becoming too similar. What is more, PairNorm is fast, easy to implement without any change to network architecture nor any additional parameters, and is broadly applicable to any GNN. Experiments on real-world graphs demonstrate that PairNorm makes deeper GCN, GAT, and SGC models more robust against oversmoothing, and significantly boosts performance for a new problem setting that benefits from deeper GNNs. Code is available at https://github.com/LingxiaoShawn/PairNorm.

25 November 2023
Verified
Conference Paper
Open access
XDXueying Ding
Xueying Ding
NSNikita Seleznev
Nikita Seleznev
SKSenthil Kumar
Senthil Kumar
CBC. Bayan Bruss
C. Bayan Bruss
LALeman Akoglu
Leman Akoglu
Anomalies are often indicators of malfunction or inefficiency in various systems such as manufacturing, healthcare, finance, etc. While the literature is abundant in effective detection algorithms due to this practical relevance, autonomous anomaly detection is rarely used in real-world scenarios. Especially in high-stakes applications, a human-in-the-loop is often involved in processes beyond detection such as sense-making and troubleshooting. Motivated by the financial fraud verification problem, we introduce ALARM (for Analyst-in-the-Loop Anomaly Reasoning and Management); a comprehensive end-to-end framework that supports the anomaly mining cycle from detection to action and is applicable more broadly to domains beyond finance. Besides unsupervised detection of emerging anomalies, it offers anomaly explanations and an interactive GUI for human-in-the-loop processes—visual exploration, sense-making, and ultimately action-taking via designing new detection rules—that help close “the loop” as the new rules complement rule-based supervised detection, typical of many deployed systems in practice. We demonstrate ALARM’s efficacy quantitatively and qualitatively through a series of case with fraud analysts from the financial industry.