SSShashank Sheshar Singh

Shashank Sheshar Singh

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Toward quantum fuzziness: A survey on social media analysis through SNA and linguistic perspectives

    by Shashank Sheshar Singh, Rohit Ahuja, Sumit Kumar, Gourav Bathla, Jayendra Barua

  • PPWCS: A Strategy for Enhancing Caching Performance in Content-Centric Networking Enabled Consumer IoT Systems

    by Sumit Kumar, Rajeev Tiwari, Shashank Sheshar Singh, Harish Shakya, Gyanendra Kumar, Ali Kashif Bashir

    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.

  • Top Cited Papers
    Open Access

    Exploring Influence Maximization: State-of-the-Art Methods, Taxonomies, and Trends

    by Sunil Kumar Meena, Shashank Sheshar Singh, Kuldeep Singh

    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

    Leveraging similarity and community-based features for link prediction in temporal social networks using attention-enabled LSTM

    by Rohit Ahuja, Simranjit Kaur, Harish Kumar Shakya, Shashank Sheshar Singh

    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.


  • TKHN: efficient mining of top-K high utility itemsets with negative item values

    by Kuldeep Singh, Rajiv Kumar, Shashank Sheshar Singh, Dharmendra Prasad Mahato


  • Open Access

    Influence Maximization on Signed Social Networks: A Survey

    by Shashank Sheshar Singh, Vishal Srivastava, Avadh Kishor, Jayendra Barua, Neeraj Kumar

    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.


  • Quantum‐Inspired Genetic Algorithm for Influence Maximization on Social Networks

    by Shashank Sheshar Singh, Sunil Kumar Meena, Kuldeep Singh, Sumit Kumar, Dharmendra Kumar, Ram Kishan Dewangan

    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.

  • Achieving Fair Influence Maximization: Integrating Privacy, Diversity, and Temporal Fairness

    by Sunil Kumar Meena, Shashank Sheshar Singh, Kuldeep Singh

    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.


  • Advancing Sustainability Through Social Media: A Comprehensive Survey

    by Shashank Sheshar Singh, Sumit Kumar, Avadh Kishor, Albert Y. Zomaya

    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.