Anshuman Chhabra

Orcid: 0000-0001-9376-2896

According to our database1, Anshuman Chhabra authored at least 23 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Incentivizing News Consumption on Social Media Platforms Using Large Language Models and Realistic Bot Accounts.
CoRR, 2024

Revisiting Zero-Shot Abstractive Summarization in the Era of Large Language Models from the Perspective of Position Bias.
CoRR, 2024

2023
Robust Fair Clustering: A Novel Fairness Attack and Defense Framework.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
YouTube, The Great Radicalizer? Auditing and Mitigating Ideological Biases in YouTube Recommendations.
CoRR, 2022

On the Robustness of Deep Clustering Models: Adversarial Attacks and Defenses.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Fair Algorithms for Hierarchical Agglomerative Clustering.
Proceedings of the 21st IEEE International Conference on Machine Learning and Applications, 2022

2021
Enabling security for the Industrial Internet of Things using deep learning, blockchain, and coalitions.
Trans. Emerg. Telecommun. Technol., 2021

Fairness Degrading Adversarial Attacks Against Clustering Algorithms.
CoRR, 2021

An Overview of Fairness in Clustering.
IEEE Access, 2021

Moving Target Defense against Adversarial Machine Learning.
Proceedings of the MTD@CCS 2021: Proceedings of the 8th ACM Workshop on Moving Target Defense, 2021

Fair Clustering Using Antidote Data.
Proceedings of the Algorithmic Fairness through the Lens of Causality and Robustness Workshop, 2021

2020
RLProph: a dynamic programming based reinforcement learning approach for optimal routing in opportunistic IoT networks.
Wirel. Networks, 2020

Suspicion-Free Adversarial Attacks on Clustering Algorithms.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Understanding flows in high-speed scientific networks: A Netflow data study.
Future Gener. Comput. Syst., 2019

GMMR: A Gaussian mixture model based unsupervised machine learning approach for optimal routing in opportunistic IoT networks.
Comput. Commun., 2019

A Machine Learning Approach Using Classifier Cascades for Optimal Routing in Opportunistic Internet of Things Networks.
Proceedings of the 16th Annual IEEE International Conference on Sensing, 2019

A moving target defense against adversarial machine learning.
Proceedings of the 4th ACM/IEEE Symposium on Edge Computing, 2019

2018
A fuzzy logic and game theory based adaptive approach for securing opportunistic networks against black hole attacks.
Int. J. Commun. Syst., 2018

An approach to predictively securing critical cloud infrastructures through probabilistic modeling.
CoRR, 2018

An Energy Efficient Routing Protocol for Wireless Internet-of-Things Sensor Networks.
CoRR, 2018

2017
An Elliptic Curve Cryptography Based Encryption Scheme for Securing the Cloud against Eavesdropping Attacks.
Proceedings of the 3rd IEEE International Conference on Collaboration and Internet Computing, 2017

A game theory based secure model against Black hole attacks in Opportunistic Networks.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

SEIR: A Stackelberg game based approach for energy-aware and incentivized routing in selfish Opportunistic Networks.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017


  Loading...