Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Izhar Ali

dblp:74/6287 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0006-9643-1869ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › network analysis
dynamic network analysis
0.912025
Early Detection and Attribution of Structural Changes in Dynamic Networks · ICDM 2025
Data mining
anomaly detection
0.912025
Early Detection and Attribution of Structural Changes in Dynamic Networks · ICDM 2025
Data mining › time series analysis
change point detection
0.912025
Early Detection and Attribution of Structural Changes in Dynamic Networks · ICDM 2025

Methods — techniques the papers use, named apart from their topics

statistical forecasting · 1.7horizon martingale · 1.7
YearPublicationVenuePosition
2026 Detecting and explaining structural changes in an evolving graph using a martingale
abstract
Dynamic systems such as sensor networks, social networks, computer networks, and power grids can be modeled as evolving graphs, requiring effective methods to monitor structural changes in real-time. In this paper, we present a change detection framework for detecting global structural changes in evolving graphs. This framework combines multiple martingale-based change detectors using different graph features. We establish a mathematical relationship between an additive martingale (derived from the multiple graph features) and the Shapley Additive Explanations (SHAP) method, demonstrating that martingale values at detected change-points directly quantify each feature’s contribution to the detected change. Thus, graph features with significantly high martingale values provide meaningful explanations for detected structural changes. We demonstrate our approach using three synthetic graph types (random topology, scale-free, and small-world), showing how different graph features vary in detection performance across network types. This highlights the importance of using multiple graph features, as relying on any single feature might not detect certain changes. Additionally, we apply our approach to the MIT Reality dataset to identify changes in social interactions among dormitory students at some special time periods. Our results reveal which graph features best characterize the real-world network changes during these special time periods.
Shen-Shyang Ho, Tarun Teja Kairamkonda, Izhar Ali
Pattern Recognit.3
2025 Early Detection and Attribution of Structural Changes in Dynamic Networks
abstract
Dynamic networks evolve through structural changes that significantly impact their functionality. Early detection of these changes remains a fundamental challenge due to the inherent tradeoffs between detection delay and false alarm control. Current methods accumulate evidence of these changes only after they occur, creating unavoidable detection delays that limit practical utility in time-sensitive applications. We address this limitation through horizon martingales that leverage statistical forecasting to accumulate evidence from predicted future network states, enabling detection before changes fully manifest. We establish two fundamental results: (1) horizon martingales preserve the martingale property under proper forecasting calibration, and (2) they maintain rigorous false alarm control with probability bounds of$1/\lambda$for detection threshold$\lambda$. Comprehensive evaluation across diverse synthetic network types and real-world social interaction data demonstrates consistent improvements in detection speed with 13–25% reductions in detection delay while maintaining strict statistical guarantees.
Izhar Ali, Shen-Shyang Ho
ICDM1