Demo Data from EDBT 2026 / reviewers in the wild / expert
Sharmishtha Dutta
dblp:267/9855
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0001-7620-3427ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers |
Knowledge graphs · 100% | |
| Network and information security
1 paper |
Malware analysis · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge graphs › link prediction
inductive link prediction |
0.9 | 1 | 2025 | Replacing Paths with Connection-Biased Attention for Knowledge Graph Completion · AAAI 2025 |
Knowledge graphs
link prediction |
0.9 | 1 | 2025 | Replacing Paths with Connection-Biased Attention for Knowledge Graph Completion · AAAI 2025 |
Knowledge graphs › link prediction
relation prediction |
0.9 | 1 | 2025 | Replacing Paths with Connection-Biased Attention for Knowledge Graph Completion · AAAI 2025 |
Malware analysis
malware intelligence |
0.5 | 1 | 2021 | An Ontology-driven Knowledge Graph for Android Malware · CCS 2021 |
Malware analysis
android malware |
0.1 | 1 | 2021 | An Ontology-driven Knowledge Graph for Android Malware · CCS 2021 |
Methods — techniques the papers use, named apart from their topics
triple extraction · 1.0ontology engineering · 1.0transformer · 0.9subgraph encoding · 0.9attention mechanism · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Replacing Paths with Connection-Biased Attention for Knowledge Graph CompletionabstractKnowledge graph (KG) completion aims to identify additional facts that can be inferred from the existing facts in the KG. Recent developments in this field have explored this task in the inductive setting, where at test time one sees entities that were not present during training; the most performant models in the inductive setting have employed path encoding modules in addition to standard subgraph encoding modules. This work similarly focuses on KG completion in the inductive setting, without the explicit use of path encodings, which can be time-consuming and introduces several hyperparameters that require costly hyperparameter optimization. Our approach uses a Transformer-based subgraph encoding module only; we introduce connection-biased attention and entity role embeddings into the subgraph encoding module to eliminate the need for an expensive and time-consuming path encoding module. Evaluations on standard inductive KG completion benchmark datasets demonstrate that our Connection-Biased Link Prediction (CBLiP) model has superior performance to models that do not use path information. Compared to models that utilize path information, CBLiP shows competitive or superior performance while being faster. Additionally, to show that the effectiveness of connection-biased attention and entity role embeddings also holds in the transductive setting, we compare CBLiP's performance on the relation prediction task in the transductive setting. Sharmishtha Dutta, Alex Gittens, Mohammed J. Zaki, Charu C. Aggarwal |
AAAI | 1 |
| 2022 | TINKER: A framework for Open source Cyberthreat IntelligenceabstractThreat intelligence on malware attacks and campaigns is increasingly being shared with other security experts for a cost or for free. Other security analysts use this intelligence to inform them of indicators of compromise, attack techniques, and preventative actions. Security analysts prepare threat analysis reports after investigating an attack, an emerging cyber threat, or a recently discovered vulnerability. Collectively known as cyber threat intelligence (CTI), the reports are typically in an unstructured format and, therefore, challenging to integrate seamlessly into existing intrusion detection systems. This paper proposes a framework that uses the aggregated CTI for analysis and defense at scale. The information is extracted and stored in a structured format using knowledge graphs such that the semantics of the threat intelligence can be preserved and shared at scale with other security analysts. Specifically, we propose the first semi-supervised open-source knowledge graph-based framework, TINKER, to capture cyber threat information and its context. Following TINKER, we generate a Cyberthreat Intelligence Knowledge Graph (CTI-KG) and demonstrate the usage using different use cases. Nidhi Rastogi, Sharmishtha Dutta, Alex Gittens, Mohammed J. Zaki, Charu C. Aggarwal |
TrustCom | 2 |
| 2021 | An Ontology-driven Knowledge Graph for Android MalwareabstractWe present MalONT2.0 -- an ontology for malware threat intelligence [4]. New classes (attack patterns, infrastructural resources to enable attacks, malware analysis to incorporate static analysis, and dynamic analysis of binaries) and relations have been added following a broadened scope of core competency questions. MalONT2.0 allows researchers to extensively capture all requisite classes and relations that gather semantic and syntactic characteristics of an android malware attack. This ontology forms the basis for the malware threat intelligence knowledge graph, MalKG, which we exemplify using three different, non-overlapping demonstrations. Malware features have been extracted from openCTI reports on android threat intelligence shared on the Internet and written in the form of unstructured text. Some of these sources are blogs, threat intelligence reports, tweets, and news articles. The smallest unit of information that captures malware features is written as triples comprising head and tail entities, each connected with a relation. In the poster and demonstration, we discuss MalONT2.0 and MalKG. Christian Ryan, Sharmishtha Dutta, Youngja Park, Nidhi Rastogi |
CCS | 2 |