1 code implementation • 20 Dec 2023 • Aritra Bhowmick, Mert Kosan, Zexi Huang, Ambuj Singh, Sourav Medya
Graph clustering is a fundamental and challenging task in the field of graph mining where the objective is to group the nodes into clusters taking into consideration the topology of the graph.
no code implementations • 3 Oct 2023 • Mert Kosan, Samidha Verma, Burouj Armgaan, Khushbu Pahwa, Ambuj Singh, Sourav Medya, Sayan Ranu
Motivated by this need, we present a benchmarking study on perturbation-based explainability methods for GNNs, aiming to systematically evaluate and compare a wide range of explainability techniques.
no code implementations • 25 May 2023 • Mert Kosan, Arlei Silva, Ambuj Singh
Explaining the decisions made by machine learning models for high-stakes applications is critical for increasing transparency and guiding improvements to these decisions.
3 code implementations • 23 May 2023 • Zexi Huang, Mert Kosan, Arlei Silva, Ambuj Singh
Link prediction, which consists of predicting edges based on graph features, is a fundamental task in many graph applications.
1 code implementation • 21 Oct 2022 • Mert Kosan, Zexi Huang, Sourav Medya, Sayan Ranu, Ambuj Singh
One way to address this is counterfactual reasoning where the objective is to change the GNN prediction by minimal changes in the input graph.
1 code implementation • 23 Oct 2021 • Mert Kosan, Arlei Silva, Sourav Medya, Brian Uzzi, Ambuj Singh
In this paper, we propose DyGED, a simple yet novel deep learning model for event detection on dynamic graphs.
no code implementations • 9 Sep 2021 • Debajyoti Kar, Mert Kosan, Debmalya Mandal, Sourav Medya, Arlei Silva, Palash Dey, Swagato Sanyal
Ensuring fairness in machine learning algorithms is a challenging and essential task.