Tanmoy Chakraborty

Tanmoy Chakraborty

Auto-generated profile, based on publicly available information

Tanmoy Chakraborty

Indian Institute of Technology Delhi

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
22 August 2024 in Nature Machine Intelligence
Verified
Journal Article
Closed access
PDF file
IAIsabelle Augenstein
Isabelle Augenstein
TBTimothy Baldwin
Timothy Baldwin
MCMeeyoung Cha
Meeyoung Cha
TCTanmoy Chakraborty
Tanmoy Chakraborty
GCGiovanni Luca Ciampaglia
Giovanni Luca Ciampaglia
GZGiovanni Zagni
Giovanni Zagni

30 August 2017 in ACM Computing Surveys
Verified
Journal Article
Open access
PDF file
TCTanmoy Chakraborty
Tanmoy Chakraborty
ADAyushi Dalmia
Ayushi Dalmia
AMAnimesh Mukherjee
Animesh Mukherjee
NGNiloy Ganguly
Niloy Ganguly
Detecting and analyzing dense groups or communities from social and information networks has attracted immense attention over the last decade due to its enormous applicability in different domains. Community detection is an ill-defined problem , as the nature of the communities is not known in advance. The problem has turned even more complicated due to the fact that communities emerge in the network in various forms such as disjoint, overlapping, and hierarchical. Various heuristics have been proposed to address these challenges, depending on the application in hand. All these heuristics have been materialized in the form of new metrics , which in most cases are used as optimization functions for detecting the community structure, or provide an indication of the goodness of detected communities during evaluation. Over the last decade, a large number of such metrics have been proposed. Thus, there arises a need for an organized and detailed survey of the metrics proposed for community detection and evaluation. Here, we present a survey of the start-of-the-art metrics used for the detection and the evaluation of community structure. We also conduct experiments on synthetic and real networks to present a comparative analysis of these metrics in measuring the goodness of the underlying community structure.

13 July 2023 in ACM Computing Surveys
Verified
Journal Article
Open access
TGTanmay Garg
Tanmay Garg
SMSarah Masud
Sarah Masud
TSTharun Suresh
Tharun Suresh
TCTanmoy Chakraborty
Tanmoy Chakraborty
Detecting online toxicity has always been a challenge due to its inherent subjectivity. Factors such as the context, geography, socio-political climate, and background of the producers and consumers of the posts play a crucial role in determining if the content can be flagged as toxic. Adoption of automated toxicity detection models in production can thus lead to a sidelining of the various groups they aim to help in the first place. It has piqued researchers’ interest in examining unintended biases and their mitigation. Due to the nascent and multi-faceted nature of the work, complete literature is chaotic in its terminologies, techniques, and findings. In this article, we put together a systematic study of the limitations and challenges of existing methods for mitigating bias in toxicity detection. We look closely at proposed methods for evaluating and mitigating bias in toxic speech detection. To examine the limitations of existing methods, we also conduct a case study to introduce the concept of bias shift due to knowledge-based bias mitigation. The survey concludes with an overview of the critical challenges, research gaps, and future directions. While reducing toxicity on online platforms continues to be an active area of research, a systematic study of various biases and their mitigation strategies will help the research community produce robust and fair models. 1

26 May 2021 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
MBManjot Bedi
Manjot Bedi
SKShivani Kumar
Shivani Kumar
SAShad Akhtar
Shad Akhtar
TCTanmoy Chakraborty
Tanmoy Chakraborty
Sarcasm detection and humor classification are inherently subtle problems, primarily due to their dependence on the contextual and non-verbal information. Furthermore, existing studies in these two topics are usually constrained in non-English languages such as Hindi, due to the unavailability of qualitative annotated datasets. In this work, we make two major contributions considering the above limitations: (1) we develop a Hindi-English code-mixed dataset, MaSaC, for the multi-modal sarcasm detection and humor classification in conversational dialog, which to our knowledge is the first dataset of its kind; (2) we propose MSH-COMICS, a novel attention-rich neural architecture for the utterance classification. We learn efficient utterance representation utilizing a hierarchical attention mechanism that attends to a small portion of the input sentence at a time. Further, we incorporate dialog-level contextual attention mechanism to leverage the dialog history for the multi-modal classification. We perform extensive experiments for both the tasks by varying multi-modal inputs and various submodules of MSH-COMICS. We also conduct comparative analysis against existing approaches. We observe that MSH-COMICS attains superior performance over the existing models by >1 F1-score point for the sarcasm detection and 10 F1-score points in humor classification. We diagnose our model and perform thorough analysis of the results to understand the superiority and pitfalls.

1 January 2023
Verified
Conference Paper
Open access
PDF file
ETEshaan Tanwar
Eshaan Tanwar
SDSubhabrata Dutta
Subhabrata Dutta
MBManish Borthakur
Manish Borthakur
TCTanmoy Chakraborty
Tanmoy Chakraborty
Eshaan Tanwar, Subhabrata Dutta, Manish Borthakur, Tanmoy Chakraborty. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023.

21 August 2017 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
TCTanmoy Chakraborty
Tanmoy Chakraborty
FPFabio Pierazzi
Fabio Pierazzi
VSV. S. Subrahmanian
V. S. Subrahmanian
As the most widely used mobile platform, Android is also the biggest target for mobile malware. Given the increasing number of Android malware variants, detecting malware families is crucial so that security analysts can identify situations where signatures of a known malware family can be adapted as opposed to manually inspecting behavior of all samples. We present EC2 ( E nsemble C lustering and C lassification), a novel algorithm for discovering Android malware families of varying sizes —ranging from very large to very small families (even if previously unseen). We present a performance comparison of several traditional classification and clustering algorithms for Android malware family identification on DREBIN, the largest public Android malware dataset with labeled families. We use the output of both supervised classifiers and unsupervised clustering to design EC2 . Experimental results on both the DREBIN and the more recent Koodous malware datasets show that EC2 accurately detects both small and large families, outperforming several comparative baselines. Furthermore, we show how to automatically characterize and explain unique behaviors of specific malware families, such as FakeInstaller , MobileTx , Geinimi . In short, EC2 presents an early warning system for emerging new malware families, as well as a robust predictor of the family (when it is not new) to which a new malware sample belongs, and the design of novel strategies for data-driven understanding of malware behaviors.