Demo Data from EDBT 2026 / reviewers in the wild / expert
Syed Afzal Murtaza Rizvi
dblp:251/9546
· DBLP profile ↗
4ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-8641-4383ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 2 since 2021Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1
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 · 67% Web and social media mining · 33% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
anomaly detection |
0.9 | 1 | 2025 | Generalized Local Prominence for Source Detection in Real-World Rumor Networks · IEEE Trans. Knowl. Data Eng. 2025 |
Data mining
pattern mining |
0.9 | 1 | 2025 | Generalized Local Prominence for Source Detection in Real-World Rumor Networks · IEEE Trans. Knowl. Data Eng. 2025 |
Web and social media mining › information diffusion
rumor source detection |
0.9 | 1 | 2025 | Generalized Local Prominence for Source Detection in Real-World Rumor Networks · IEEE Trans. Knowl. Data Eng. 2025 |
Methods — techniques the papers use, named apart from their topics
generalized local prominence · 1.7exoneration and prominence based age · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Generalized Local Prominence for Source Detection in Real-World Rumor Networks (Extended Abstract)
Syed Shafat Ali, Ajay Rastogi, Tarique Anwar, Syed Afzal Murtaza Rizvi, Jian Yang 0001, Jia Wu 0001, Quan Z. Sheng |
ICDE | 4 |
| 2025 | Generalized Local Prominence for Source Detection in Real-World Rumor NetworksabstractThe problem of infection source detection deals with localizing the infection source in a given network. While the problem has been extensively studied in the past, researchers have mainly focused on simulated infection networks which may not be the correct reflection of the dynamics of real-world infections. More significantly, the existing methods assume that a rumor source lies at the center of an infection network (source-centrality), which is not always true in sparse real-world rumor networks. Due to the randomness of infection flow in such networks, the source may lie away from the center (source-skewness). There is also a lack of real-world infection network datasets to provide a true real-world perspective. Therefore, we revisit the source detection problem and contemplate a shift from mainstream simulations to a real-world paradigm. To this end, we generate two novel rumor network datasets, Cov19-RN and Use20-RN, based on COVID-19 and US Elections 2020 misinformation trends on Twitter (currently$\mathbb {X}$). Besides, inspired by the technicalities inherent to real-world rumor networks, we propose a real-world oriented algorithm called Generalized Exoneration and Prominence based Age, GEPA, for rumor source detection. GEPA addresses the problem of source-skewness to detect rumor sources using the concept of generalized local prominence, which we introduce in this study. Our experiments show that GEPA significantly outperforms the state-of-the-art methods, producing detection rates of 73.6% against 61.5% of the closest competing method on Cov19-RN, and 61.5% against 52.6% of the closest competing method on Use20-RN. To the best of our knowledge, this study is the first such work to deal with source detection in real-world rumor networks and address the problem of source-skewness. Our complete source code, benchmark datasets and detailed results are available athttps://github.com/tesla121/GEPA. Syed Shafat Ali, Ajay Rastogi, Tarique Anwar, Syed Afzal Murtaza Rizvi, Jian Yang 0001, Jia Wu 0001, Quan Z. Sheng |
IEEE Trans. Knowl. Data Eng. | 4 |
| 2019 | EPA: Exoneration and Prominence based Age for Infection Source IdentificationabstractInfection source identification is a well-established problem, having gained a substantial scale of research attention over the years. In this paper, we study the problem by exploiting the idea of the source being the oldest node. For the same, we propose a novel algorithm called Exoneration and Prominence based Age (EPA), which calculates the age of an infected node by considering its prominence in terms of its both infected and non-infected neighbors. These non-infected neighbors hold the key in exonerating an infected node from being the infection source. We also propose a computationally inexpensive variant of EPA, called EPA-LW. Extensive experiments are performed on seven datasets, including 5 real-world and 2 synthetic, of different topologies and varying sizes to demonstrate the effectiveness of the proposed algorithms. We consistently outperform the state-of-the-art single source identification methods in terms of average error distance. To the best of our knowledge, this is the largest scale performance evaluation of the considered problem till date. We also extend EPA to identify multiple sources by developing two new algorithms - one based on K-Means, called EPA_K-Means, and another based on successive identification of sources, called EPA_SSI. Our results show that both EPA_K-Means and EPA_SSI outperform the other multi-source heuristic approaches. Syed Shafat Ali, Tarique Anwar, Ajay Rastogi, Syed Afzal Murtaza Rizvi |
CIKM | 4 |
| 2014 | Mining Gene Expression Data Focusing Cancer Therapeutics: A DigestabstractAn understanding towards genetics and epigenetics is essential to cope up with the paradigm shift which is underway. Personalized medicine and gene therapy will confluence the days to come. This review highlights traditional approaches as well as current advancements in the analysis of the gene expression data from cancer perspective. Due to improvements in biometric instrumentation and automation, it has become easier to collect a lot of experimental data in molecular biology. Analysis of such data is extremely important as it leads to knowledge discovery that can be validated by experiments. Previously, the diagnosis of complex genetic diseases has conventionally been done based on the non-molecular characteristics like kind of tumor tissue, pathological characteristics, and clinical phase. The microarray data can be well accounted for high dimensional space and noise. Same were the reasons for ineffective and imprecise results. Several machine learning and data mining techniques are presently applied for identifying cancer using gene expression data. While differences in efficiency do exist, none of the well-established approaches is uniformly superior to others. The quality of algorithm is important, but is not in itself a guarantee of the quality of a specific data analysis. Shaurya Jauhari, Syed Afzal Murtaza Rizvi |
IEEE ACM Trans. Comput. Biol. Bioinform. | 2 |