Anubha Kabra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anubha Kabra has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Alan Ritter
School of Interactive Computing, Georgia Institute of Technology, Atlanta, Georgia, USA
1 shared publication - Anil Singh Parihar
Machine Learning Research Laboratory, Department of Computer Science and Engineering, Delhi Technological University, Delhi, India
1 shared publication - Anil Singh Parihar
Department of Computer Science Delhi Technological University
1 shared publication - Anu Agarwal
Department of Computer Science and Engineering, Machine Learning Research Laboratory, Delhi Technological University, New Delhi, India
1 shared publication - Anu Agarwal
Department of Computer Science Delhi Technological University
1 shared publication - Arushi Sharma
Department of Food Science and Technology, College of Horticulture and Forestry, Dr. YS Parmar University of Horticulture and Forestry, Hamirpur, India
1 shared publication
Latest Publications
- Open Access
- 2 May 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Human-Computer Interaction
- Vol. 9 (2) , 1-31
Measuring, Modeling, and Helping People Account for Privacy Risks in Online Self-Disclosures with AI
In pseudonymous online fora like Reddit, the benefits of self-disclosure are often apparent to users (e.g., I can vent about my in-laws to understanding strangers), but the privacy risks are more abstract (e.g., will my partner be able to tell that this is me?). Prior work has sought to develop natural language processing (NLP) tools that help users identify potentially risky self-disclosures in their text, but none have been designed for or evaluated with the users they hope to protect. Absent this assessment, these tools will be limited by the social-technical gap: users need assistive tools that help them make informed decisions, not paternalistic tools that tell them to avoid self-disclosure altogether. To bridge this gap, we conducted a study with N =21 Reddit users; we had them use a state-of-the-art NLP disclosure detection model on two of their authored posts and asked them questions to understand if and how the model helped, where it fell short, and how it could be improved to help them make more informed decisions. Despite its imperfections, users responded positively to the model and highlighted its use as a tool that can help them catch mistakes, inform them of risks they were unaware of, and encourage self-reflection. However, our work also shows how, to be useful and usable, AI for supporting privacy decision-making must account for posting context, disclosure norms, and users' lived threat models, and provide explanations that help contextualize detected risks.
- 2 May 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Human-Computer Interaction
- Vol. 9 (2) , 1-31
Open AccessMeasuring, Modeling, and Helping People Account for Privacy Risks in Online Self-Disclosures with AI
In pseudonymous online fora like Reddit, the benefits of self-disclosure are often apparent to users (e.g., I can vent about my in-laws to understanding strangers), but the privacy risks are more abstract (e.g., will my partner be able to tell that this is me?). Prior work has sought to develop natural language processing (NLP) tools that help users identify potentially risky self-disclosures in their text, but none have been designed for or evaluated with the users they hope to protect. Absent this assessment, these tools will be limited by the social-technical gap: users need assistive tools that help them make informed decisions, not paternalistic tools that tell them to avoid self-disclosure altogether. To bridge this gap, we conducted a study with N =21 Reddit users; we had them use a state-of-the-art NLP disclosure detection model on two of their authored posts and asked them questions to understand if and how the model helped, where it fell short, and how it could be improved to help them make more informed decisions. Despite its imperfections, users responded positively to the model and highlighted its use as a tool that can help them catch mistakes, inform them of risks they were unaware of, and encourage self-reflection. However, our work also shows how, to be useful and usable, AI for supporting privacy decision-making must account for posting context, disclosure norms, and users' lived threat models, and provide explanations that help contextualize detected risks.
- 10 September 2021
- Published by Springer Nature
- p. 365-380
Feature Enhanced Capsule Networks for Robust Automatic Essay Scoring
- 10 September 2021
- Published by Springer Nature
- p. 365-380
Feature Enhanced Capsule Networks for Robust Automatic Essay Scoring
- 5 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 9 (2) , 581-593
Potent Real-Time Recommendations Using Multimodel Contextual Reinforcement Learning
Widespread digitalization has led to almost all utilities and services thrive on an online medium. A real-time, personalized, and trend grasping recommendation system is necessary to enhance user experience and boost business on E-commerce platforms. We propose the Multi-Model Contextual Reinforcement Learning (MMCR) constituting three novel features for real-time and customized recommendations. The first feature is user-item interactive state embedding which uses not only item information but also assigns weightage to this information according to its usage history. It gives higher importance to the newly clicked items by the users than the older ones. Second, we devised Contextual Cluster Exploration (CCE) strategy. This strategy enhances the item-choice recommendations by consistently reducing the randomness during exploration. The third novelty is an item-based multi-agent framework that can tackle the case of sparsely chosen items. Generally, such items are disregarded in a single agent model as the more popular items take supremacy. Our technique ensures that the user-item history per item is learned separately; thus, no item is neglected. MMCR has shown an average of 5% increase in CTR rate. Moreover, CCE exploration gives a considerably higher score than state-of-the-art exploration strategies. Thorough experimentation demonstrates that our proposed strategy has shown significantly improved results over various state-of-the-art strategies.
- 5 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 9 (2) , 581-593
Potent Real-Time Recommendations Using Multimodel Contextual Reinforcement Learning
Widespread digitalization has led to almost all utilities and services thrive on an online medium. A real-time, personalized, and trend grasping recommendation system is necessary to enhance user experience and boost business on E-commerce platforms. We propose the Multi-Model Contextual Reinforcement Learning (MMCR) constituting three novel features for real-time and customized recommendations. The first feature is user-item interactive state embedding which uses not only item information but also assigns weightage to this information according to its usage history. It gives higher importance to the newly clicked items by the users than the older ones. Second, we devised Contextual Cluster Exploration (CCE) strategy. This strategy enhances the item-choice recommendations by consistently reducing the randomness during exploration. The third novelty is an item-based multi-agent framework that can tackle the case of sparsely chosen items. Generally, such items are disregarded in a single agent model as the more popular items take supremacy. Our technique ensures that the user-item history per item is learned separately; thus, no item is neglected. MMCR has shown an average of 5% increase in CTR rate. Moreover, CCE exploration gives a considerably higher score than state-of-the-art exploration strategies. Thorough experimentation demonstrates that our proposed strategy has shown significantly improved results over various state-of-the-art strategies.
- Open Access
Cluster Based Deep Contextual Reinforcement Learning for top-k Recommendations
Rapid advancements in the E-commerce sector over the last few decades have led to an imminent need for personalised, efficient and dynamic recommendation systems. To sufficiently cater to this need, we propose a novel method for generating top-k recommendations by creating an ensemble of clustering with reinforcement learning. We have incorporated DB Scan clustering to tackle vast item space, hence in-creasing the efficiency multi-fold. Moreover, by using deep contextual reinforcement learning, our proposed work leverages the user features to its full potential. With partial updates and batch updates, the model learns user patterns continuously. The Duelling Bandit based exploration provides robust exploration as compared to the state-of-art strategies due to its adaptive nature. Detailed experiments conducted on a public dataset verify our claims about the efficiency of our technique as com-pared to existing techniques.
Open AccessCluster Based Deep Contextual Reinforcement Learning for top-k Recommendations
Rapid advancements in the E-commerce sector over the last few decades have led to an imminent need for personalised, efficient and dynamic recommendation systems. To sufficiently cater to this need, we propose a novel method for generating top-k recommendations by creating an ensemble of clustering with reinforcement learning. We have incorporated DB Scan clustering to tackle vast item space, hence in-creasing the efficiency multi-fold. Moreover, by using deep contextual reinforcement learning, our proposed work leverages the user features to its full potential. With partial updates and batch updates, the model learns user patterns continuously. The Duelling Bandit based exploration provides robust exploration as compared to the state-of-art strategies due to its adaptive nature. Detailed experiments conducted on a public dataset verify our claims about the efficiency of our technique as com-pared to existing techniques.