Shashank Sheshar Singh
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
Shashank Sheshar Singh has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Kuldeep Singh
Department of Computer Science, University of Delhi, New Delhi, India
25 shared publications - Ajay Kumar
Indian Institute of Technology (BHU)
19 shared publications Bhaskar Biswas
Department of Computer Science and Engineering, Indian Institute of Technology (Banaras Hindu University), Varanasi, India
15 shared publications- Harish Kumar Shakya
Department of Artificial Intelligence and Machine Learning, Manipal University Jaipur, Jaipur, India
8 shared publications - Sunil Kumar Meena
Department of Computer Science, University of Delhi, New Delhi, India
8 shared publications - Bhaskar Biswas
Indian Institute of Technology (BHU)
7 shared publications
Latest Publications
- 12 June 2026
- Published by Elsevier in Information Sciences
- Vol. 755
Toward quantum fuzziness: A survey on social media analysis through SNA and linguistic perspectives
- 12 June 2026
- Published by Elsevier in Information Sciences
- Vol. 755
Toward quantum fuzziness: A survey on social media analysis through SNA and linguistic perspectives
- 22 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. PP  (00983063) , 1
PPWCS: A Strategy for Enhancing Caching Performance in Content-Centric Networking Enabled Consumer IoT Systems
The exponential increase in smart consumer devices and bandwidth-intensive applications is accelerating the integration of 5G and 6G technologies in Internet-of-Things (IoT) ecosystems. Content-Centric Networking (CCN) has gained prominence as a future-oriented Internet architecture for the growing needs of consumer device applications with its in-network caching capability. It offers a scalable solution for efficient content retrieval. However, consumer-grade router nodes have substantially smaller caching capacity, which presents challenges in maintaining Quality-of-Service (QoS). In this direction, this paper proposes a Partitioning and Dynamic Popularity Window-based Caching Strategy (PPWCS) that combines partition-aware collaboration with an adaptive popularity window to optimize content placement in consumer IoT systems. In contrast to prior approaches, PPWCS divides the network nodes into non-overlapping partitions based on the proposed heuristic and takes collaborative caching decisions by identifying frequently requested contents. Comprehensive evaluations on Abilene-based and US-26-based network topologies demonstrate that PPWCS consistently outperforms existing strategies. It achieves up to 10% higher cache hit ratio, 23% lower hop count, 17% lower delay, 20% less traffic, and 17% lower energy consumption in Abilene. Similarly, in US-26 topology, the proposed scheme achieves up to 9% higher cache hit ratio, 21% lower hop count, 20% lower delay, and 18% lower energy consumption. These improvements validate PPWCS as a technically innovative and practically viable solution for consumer IoT networks operating over next-generation network infrastructure.
- 22 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. PP  (00983063) , 1
PPWCS: A Strategy for Enhancing Caching Performance in Content-Centric Networking Enabled Consumer IoT Systems
The exponential increase in smart consumer devices and bandwidth-intensive applications is accelerating the integration of 5G and 6G technologies in Internet-of-Things (IoT) ecosystems. Content-Centric Networking (CCN) has gained prominence as a future-oriented Internet architecture for the growing needs of consumer device applications with its in-network caching capability. It offers a scalable solution for efficient content retrieval. However, consumer-grade router nodes have substantially smaller caching capacity, which presents challenges in maintaining Quality-of-Service (QoS). In this direction, this paper proposes a Partitioning and Dynamic Popularity Window-based Caching Strategy (PPWCS) that combines partition-aware collaboration with an adaptive popularity window to optimize content placement in consumer IoT systems. In contrast to prior approaches, PPWCS divides the network nodes into non-overlapping partitions based on the proposed heuristic and takes collaborative caching decisions by identifying frequently requested contents. Comprehensive evaluations on Abilene-based and US-26-based network topologies demonstrate that PPWCS consistently outperforms existing strategies. It achieves up to 10% higher cache hit ratio, 23% lower hop count, 17% lower delay, 20% less traffic, and 17% lower energy consumption in Abilene. Similarly, in US-26 topology, the proposed scheme achieves up to 9% higher cache hit ratio, 21% lower hop count, 20% lower delay, and 18% lower energy consumption. These improvements validate PPWCS as a technically innovative and practically viable solution for consumer IoT networks operating over next-generation network infrastructure.
- 16 January 2026
- Published by Elsevier in Information Fusion
- Vol. 131
Fusion of quantum computing with smart agriculture: A systematic review of methods, implementation, applications, and challenges
- 16 January 2026
- Published by Elsevier in Information Fusion
- Vol. 131
Fusion of quantum computing with smart agriculture: A systematic review of methods, implementation, applications, and challenges
- Top Cited PapersOpen Access
- 13 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20  (2) , 1-50
Exploring Influence Maximization: State-of-the-Art Methods, Taxonomies, and Trends
Influence maximization (IM) is a key problem in social network analysis, with numerous applications in areas such as viral marketing, advertising, public health, and more. Current surveys in IM primarily focus on traditional algorithms while overlooking leading advanced IM algorithms such as signed IM, fairness-enabled IM, and diversity-based IM. This survey paper seeks to address the existing gap by providing a thorough review of both classical and advanced IM algorithms. It discusses classical techniques like simulation-based, path-based, and so on, and mainly focuses on recent advanced IM algorithms. In this detailed discussion of advanced algorithms, the work analyzes various aspects, including complexity, network types, properties (monotonicity, sub-modularity), diffusion models, and comparative algorithms, along with their advantages and disadvantages. This work includes an analysis of classical and advanced algorithms, as well as experimental evaluations of 20 state-of-the-art algorithms across 10 datasets. The chosen state-of-the-art algorithms utilize various approaches like simulation-based, evolutionary-based, fairness-based, and path-based methods. This work also addresses the challenges associated with IM and highlights emerging trends and future directions. Overall, this survey serves as a comprehensive guide to the latest developments in IM while proposing new avenues for future research in this field.
- 13 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20  (2) , 1-50
Top Cited PapersOpen AccessExploring Influence Maximization: State-of-the-Art Methods, Taxonomies, and Trends
Influence maximization (IM) is a key problem in social network analysis, with numerous applications in areas such as viral marketing, advertising, public health, and more. Current surveys in IM primarily focus on traditional algorithms while overlooking leading advanced IM algorithms such as signed IM, fairness-enabled IM, and diversity-based IM. This survey paper seeks to address the existing gap by providing a thorough review of both classical and advanced IM algorithms. It discusses classical techniques like simulation-based, path-based, and so on, and mainly focuses on recent advanced IM algorithms. In this detailed discussion of advanced algorithms, the work analyzes various aspects, including complexity, network types, properties (monotonicity, sub-modularity), diffusion models, and comparative algorithms, along with their advantages and disadvantages. This work includes an analysis of classical and advanced algorithms, as well as experimental evaluations of 20 state-of-the-art algorithms across 10 datasets. The chosen state-of-the-art algorithms utilize various approaches like simulation-based, evolutionary-based, fairness-based, and path-based methods. This work also addresses the challenges associated with IM and highlights emerging trends and future directions. Overall, this survey serves as a comprehensive guide to the latest developments in IM while proposing new avenues for future research in this field.
- Open Access
- 27 December 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15  (1)
Leveraging similarity and community-based features for link prediction in temporal social networks using attention-enabled LSTM
Link prediction refers to predicting future or missing links within the social network. Static social networks, with their fixed topology, require less data analysis, making predicting future or missing links relatively easier than in dynamic social networks. Dynamic social networks change over time, which makes link prediction challenging. Modern similarity-based features look at the topological structure of the network but only use a single snapshot to calculate, so they miss important patterns and changes in the network over time. Community features, which divide the whole network into communities, help to improve the prediction by focusing on links between the intra-communities. Our proposed framework, SimCom-AN-LSTM, shows that combining structural and community features can leverage the strengths of both approaches. The sequence-based Long Short-Term Memory (LSTM) model processes the snapshot sequences to capture the networkâs temporal dependencies. These features help the model learn temporal patterns and predict future links by capturing local interaction between the nodes, the overall network topology, and community structure. The attention mechanism enhances the performance of the LSTM model by giving more weight to the feature that yields the best results. Results indicate that the proposed framework surpasses the individual state-of-the-art algorithms.
- 27 December 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15  (1)
Open AccessLeveraging similarity and community-based features for link prediction in temporal social networks using attention-enabled LSTM
Link prediction refers to predicting future or missing links within the social network. Static social networks, with their fixed topology, require less data analysis, making predicting future or missing links relatively easier than in dynamic social networks. Dynamic social networks change over time, which makes link prediction challenging. Modern similarity-based features look at the topological structure of the network but only use a single snapshot to calculate, so they miss important patterns and changes in the network over time. Community features, which divide the whole network into communities, help to improve the prediction by focusing on links between the intra-communities. Our proposed framework, SimCom-AN-LSTM, shows that combining structural and community features can leverage the strengths of both approaches. The sequence-based Long Short-Term Memory (LSTM) model processes the snapshot sequences to capture the networkâs temporal dependencies. These features help the model learn temporal patterns and predict future links by capturing local interaction between the nodes, the overall network topology, and community structure. The attention mechanism enhances the performance of the LSTM model by giving more weight to the feature that yields the best results. Results indicate that the proposed framework surpasses the individual state-of-the-art algorithms.
- 12 December 2025
- Published by Springer Nature in Soft Computing
- Vol. 30  (1) , 209-225
TKHN: efficient mining of top-K high utility itemsets with negative item values
- 12 December 2025
- Published by Springer Nature in Soft Computing
- Vol. 30  (1) , 209-225
TKHN: efficient mining of top-K high utility itemsets with negative item values
- Open Access
- 8 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58  (4) , 1-32
Influence Maximization on Signed Social Networks: A Survey
Influence maximization (IM) problem widely motivated researchers due to its application potential in computer science and social sciences. Most recent advances focus on positive relations (friends, trust, etc.) in unsigned social networks. IM is not explored well in signed networks by adopting positive and negative associations (foe, distrust, etc.). Therefore, this study surveys the IM problem in signed social networks. This is the first survey to explore the polarity-related IM problem in networks to the best of our knowledge. First, we discussed the social networkâs fundamentals and polarity to build the foundation for the IM problem. Then, we described the information propagation process and models for signed social networks. After, we will present a discussion and comparison of the polarity-based IM state-of-the-art algorithms with performance evaluations. At last, we have explored the research challenges of signed networks and discussed future directions. Finally, we also discuss some open problems.
- 8 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58  (4) , 1-32
Open AccessInfluence Maximization on Signed Social Networks: A Survey
Influence maximization (IM) problem widely motivated researchers due to its application potential in computer science and social sciences. Most recent advances focus on positive relations (friends, trust, etc.) in unsigned social networks. IM is not explored well in signed networks by adopting positive and negative associations (foe, distrust, etc.). Therefore, this study surveys the IM problem in signed social networks. This is the first survey to explore the polarity-related IM problem in networks to the best of our knowledge. First, we discussed the social networkâs fundamentals and polarity to build the foundation for the IM problem. Then, we described the information propagation process and models for signed social networks. After, we will present a discussion and comparison of the polarity-based IM state-of-the-art algorithms with performance evaluations. At last, we have explored the research challenges of signed networks and discussed future directions. Finally, we also discuss some open problems.
- 22 October 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37  (25-26)
QuantumâInspired Genetic Algorithm for Influence Maximization on Social Networks
The influence maximization (IM) problem focuses on identifying key nodes in social networks to maximize influence spread. IM is crucial in various applications such as viral marketing, information diffusion, advertisements, political campaigns, etc. Quantumâinspired approaches enable the faster exploration of solutions. This work presents a quantumâinspired genetic algorithm (QiGA) to address the IM problem. It maps the QiGA principles to solve the IM problem and proposes a novel strategy for encoding the influence diffusion rules using quantum circuits. This work evaluates the performance of the proposed algorithm against benchmark algorithms on synthetic and realâworld data sets. Experimental results demonstrate that the proposed algorithm outperforms existing algorithms on smaller networks and remains competitive in largeâscale networks. The execution time is acceptable, considering the quantum code is simulated on classical hardware. Thus, this research introduces quantumâcomputingâbased QiGA algorithm to solve IM problem. Future research directions include implementing the algorithm on real quantum hardware and addressing IM using quantum computingâbased heuristics, such as node ranking, for further improvements.
- 22 October 2025
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 37  (25-26)
QuantumâInspired Genetic Algorithm for Influence Maximization on Social Networks
The influence maximization (IM) problem focuses on identifying key nodes in social networks to maximize influence spread. IM is crucial in various applications such as viral marketing, information diffusion, advertisements, political campaigns, etc. Quantumâinspired approaches enable the faster exploration of solutions. This work presents a quantumâinspired genetic algorithm (QiGA) to address the IM problem. It maps the QiGA principles to solve the IM problem and proposes a novel strategy for encoding the influence diffusion rules using quantum circuits. This work evaluates the performance of the proposed algorithm against benchmark algorithms on synthetic and realâworld data sets. Experimental results demonstrate that the proposed algorithm outperforms existing algorithms on smaller networks and remains competitive in largeâscale networks. The execution time is acceptable, considering the quantum code is simulated on classical hardware. Thus, this research introduces quantumâcomputingâbased QiGA algorithm to solve IM problem. Future research directions include implementing the algorithm on real quantum hardware and addressing IM using quantum computingâbased heuristics, such as node ranking, for further improvements.
- 13 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 1676-1688
Achieving Fair Influence Maximization: Integrating Privacy, Diversity, and Temporal Fairness
Influence maximization (IM) is a well-known problem that changed the way to spread influence in the network. IM aims to find the most influential nodes, called the seed set, that maximize influence in the network. The existing algorithms solve IM with different approaches and diffusion models. The proposed work defines and addresses three fairness principles in IM. First, to ensure privacy concerns in the diffusion process, this work proposes a new diffusion model that preserves privacy on the sensitive attribute while the existing work ignores it. Second, the proposed work suggests an objective function to achieve diversified influence with an equitable distribution among the clusters. Third, this work analyses the impact of the temporal change of the network on the seed set and the number of influenced nodes, and suggests a novel adaptive algorithm that finds the seed set effectively and efficiently with respect to the temporal change in the network. Further, experiment results on five datasets show that the proposed algorithm is comparable and has even better results than the benchmark algorithms.
- 13 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 1676-1688
Achieving Fair Influence Maximization: Integrating Privacy, Diversity, and Temporal Fairness
Influence maximization (IM) is a well-known problem that changed the way to spread influence in the network. IM aims to find the most influential nodes, called the seed set, that maximize influence in the network. The existing algorithms solve IM with different approaches and diffusion models. The proposed work defines and addresses three fairness principles in IM. First, to ensure privacy concerns in the diffusion process, this work proposes a new diffusion model that preserves privacy on the sensitive attribute while the existing work ignores it. Second, the proposed work suggests an objective function to achieve diversified influence with an equitable distribution among the clusters. Third, this work analyses the impact of the temporal change of the network on the seed set and the number of influenced nodes, and suggests a novel adaptive algorithm that finds the seed set effectively and efficiently with respect to the temporal change in the network. Further, experiment results on five datasets show that the proposed algorithm is comparable and has even better results than the benchmark algorithms.
- 22 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 10  (6) , 1128-1146
Advancing Sustainability Through Social Media: A Comprehensive Survey
In recent years, social media has emerged as a powerful tool for sustainability marketing. It leverages its extensive reach and interactive characteristics to raise awareness of environmental issues, promote community engagement, and influence policy development. This paper comprehensively analyzes different strategies used on social media platforms to support sustainability goals. We have classified these strategies into six broad categories: campaigns and education to increase awareness; activities that engage and build communities; efforts to advocate and influence policies; initiatives related to corporate social responsibility and branding; projects that use crowdsourcing and collaboration; and behavior change campaigns. We assess the effectiveness of these strategies based on case studies and key performance metrics for sustainable practices, public behaviors, and corporate marketing. Additionally, the presented survey highlights issues such as misinformation, engagement fatigue, and authenticity, necessitating solutions to address these concerns. This study highlights the vital role of social media in achieving sustainability objectives and outlines future research directions to improve its effectiveness in supporting these goals. Therefore, this research offers valuable insights for practitioners, policymakers, and scholars aiming to leverage social media platforms to advance sustainability goals.
- 22 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Computing
- Vol. 10  (6) , 1128-1146
Advancing Sustainability Through Social Media: A Comprehensive Survey
In recent years, social media has emerged as a powerful tool for sustainability marketing. It leverages its extensive reach and interactive characteristics to raise awareness of environmental issues, promote community engagement, and influence policy development. This paper comprehensively analyzes different strategies used on social media platforms to support sustainability goals. We have classified these strategies into six broad categories: campaigns and education to increase awareness; activities that engage and build communities; efforts to advocate and influence policies; initiatives related to corporate social responsibility and branding; projects that use crowdsourcing and collaboration; and behavior change campaigns. We assess the effectiveness of these strategies based on case studies and key performance metrics for sustainable practices, public behaviors, and corporate marketing. Additionally, the presented survey highlights issues such as misinformation, engagement fatigue, and authenticity, necessitating solutions to address these concerns. This study highlights the vital role of social media in achieving sustainability objectives and outlines future research directions to improve its effectiveness in supporting these goals. Therefore, this research offers valuable insights for practitioners, policymakers, and scholars aiming to leverage social media platforms to advance sustainability goals.