Sarang Kapoor

Mr. Sarang Kapoor


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
9 September 2020 in Data Mining and Knowledge Discovery
Verified
Journal Article
Open access
PDF file
SKSarang Kapoor
Sarang Kapoor
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
MLMatthijs van Leeuwen
Matthijs van Leeuwen
Many real-world phenomena can be represented as dynamic graphs, i.e., networks that change over time. The problem of dynamic graph summarization, i.e., to succinctly describe the evolution of a dynamic graph, has been widely studied. Existing methods typically use objective measures to find fixed structures such as cliques, stars, and cores. Most of the methods, however, do not consider the problem of online summarization, where the summary is incrementally conveyed to the analyst as the graph evolves, and (thus) do not take into account the knowledge of the analyst at a specific moment in time. We address this gap in the literature through a novel, generic framework for subjective interestingness for sequential data. Specifically, we iteratively identify atomic changes, called ‘actions’, that provide most information relative to the current knowledge of the analyst. For this, we introduce a novel information gain measure, which is motivated by the minimum description length (MDL) principle. With this measure, our approach discovers compact summaries without having to decide on the number of patterns. As such, we are the first to combine approaches for data mining based on subjective interestingness (using the maximum entropy principle) with pattern-based summarization (using the MDL principle). We instantiate this framework for dynamic graphs and dense subgraph patterns, and present DSSG, a heuristic algorithm for the online summarization of dynamic graphs by means of informative actions, each of which represents an interpretable change to the connectivity structure of the graph. The experiments on real-world data demonstrate that our approach effectively discovers informative summaries. We conclude with a case study on data from an airline network to show its potential for real-world applications.

4 July 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
SMSukrit Mittal
Sukrit Mittal
SKSarang Kapoor
Sarang Kapoor
Kalyanmoy DebKalyanmoy Deb
Kalyanmoy Deb
The practicality of Pareto-dominance in solving many-objective optimization problems becomes questionable due to its inability to factor the critical Human Decision-making (HDM) elements, including, the number of better objectives, the degree of betterment in objectives, and objectives’ relative preference. Relevant dominance principles are recently proposed to incorporate the first two HDM elements, often with the need for new tunable parameters. This paper proposes a high-fidelity-dominance principle, that factors all the three HDM elements, explicitly and simultaneously, and without requiring tuning of any parameter. This principle has been implemented in a reference vector based framework, leading to a computationally efficient many-objective Evolutionary Algorithm (MaOEA), namely localized high-fidelity-dominance based EA (LHFiD). Critically, LHFiD also has an inbuilt mechanism for on-the-fly determination of the timing for: (a) intermittent nadir point estimation that enables faster convergence, and (b) its self-termination that bears practically utility. This paper is based on an extensive study involving 41,912 experiments, in which the proposed LHFiD approach is compared with existing competitive MaOEAs. The paper reports statistically better performance in about 60% instances, making it practical and worthy of further investigation and application.


16 March 2020 in Machine Learning
Verified
Journal Article
Closed access
PDF file
SKSarang Kapoor
Sarang Kapoor
Dhish Kumar SaxenaDhish Kumar Saxena
Dhish Kumar Saxena
MLMatthijs van Leeuwen
Matthijs van Leeuwen

22 February 2023 in Journal of Graphic Era University
Verified
Journal Article
Open access
PDF file
SKSarang Kapoor
Sarang Kapoor
BJBidisha Jana
Bidisha Jana
In this paper, we study the effectiveness of SIR model (Susceptible- Infected- Removed) in predicting the future development of infectious disease caused by SARS-CoV-2 virus for the Indian state of Odisha. This model helps in checking the effectiveness of controlling measures like lockdown policies and helps in framing new strategies to control the spread of the disease. We formulate a set of differential equations to find the rate of change of susceptible, infected and removed population with respect to time and solve it using Euler’s method. Using the cumulative data of confirmed cases, we try to find the answers to the question of COVID-19 surge. Also, through this we predict the trend in the spread of covid-19 in the state for the next few months. The analysis includes data from March 1 (which is marked as the start of second wave of COVID) to June 28, 2021. We propose predictions on various parameters and factors related to the spread of COVID-19 and on the number of susceptible, infected and removed population until June 2021. By comparing the daily recorded data with the data from our modeling approaches, we conclude that the spread of COVID-19 can be under control in all communities, if proper lockdown restrictions and strong policies are implemented to control the infection rates.