Kishan G. Mehrotra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kishan G. Mehrotra has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Chilukuri Krishna Mohan
Syracuse University
5 shared publications - Chilukuri K. Mohan
Syracuse University
2 shared publications - Zhiruo Zhao
Syracuse University
2 shared publications - Aleksey Panasyuk
Air Force Research Lab
1 shared publication - Ashok Kumar
Syracuse University
1 shared publication Chilukuri K. Mohan
Department of EECS , Syracuse University , Syracuse , NY , USA
1 shared publication
Latest Publications
- 30 May 2022
- Published by Springer Nature
- p. 183-212
Inferring Degree of Localization and Popularity of Twitter Topics and Persons Using Temporal Features
- 30 May 2022
- Published by Springer Nature
- p. 183-212
Inferring Degree of Localization and Popularity of Twitter Topics and Persons Using Temporal Features
- 6 July 2018
- Published by Springer Nature
- p. 169-184
Evolution of Space-Partitioning Forest for Anomaly Detection
- 6 July 2018
- Published by Springer Nature
- p. 169-184
Evolution of Space-Partitioning Forest for Anomaly Detection
- 25 November 2015
- Published by Springer Nature
- p. 175-184
Neural Networks for Fast Estimation of Social Network Centrality Measures
- 25 November 2015
- Published by Springer Nature
- p. 175-184
Neural Networks for Fast Estimation of Social Network Centrality Measures
- 29 May 2015
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 5 (1) , 1-20
Multi-objective optimization to identify key players in large social networks
- 29 May 2015
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 5 (1) , 1-20
Multi-objective optimization to identify key players in large social networks
- 1 May 2015
- Published by Springer Nature
- p. 514-525
Ensemble Algorithms for Unsupervised Anomaly Detection
- 1 May 2015
- Published by Springer Nature
- p. 514-525
Ensemble Algorithms for Unsupervised Anomaly Detection
- 1 May 2015
- Published by Springer Nature
- p. 457-467
Efficient Classification of Binary Data Stream with Concept Drifting Using Conjunction Rule Based Boolean Classifier
- 1 May 2015
- Published by Springer Nature
- p. 457-467
Efficient Classification of Binary Data Stream with Concept Drifting Using Conjunction Rule Based Boolean Classifier
- 1 March 2013
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 83 (3) , 518-531
Rank-based outlier detection
We propose a new approach for outlier detection, based on a ranking measure that focuses on the question of whether a point is ‘central’ for its nearest neighbours. Using our notations, a low cumulative rank implies that the point is central. For instance, a point centrally located in a cluster has a relatively low cumulative sum of ranks because it is among the nearest neighbours of its own nearest neighbours, but a point at the periphery of a cluster has a high cumulative sum of ranks because its nearest neighbours are closer to each other than the point. Use of ranks eliminates the problem of density calculation in the neighbourhood of the point and this improves the performance. Our method performs better than several density-based methods on some synthetic data sets as well as on some real data sets.
- 1 March 2013
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 83 (3) , 518-531
Rank-based outlier detection
We propose a new approach for outlier detection, based on a ranking measure that focuses on the question of whether a point is ‘central’ for its nearest neighbours. Using our notations, a low cumulative rank implies that the point is central. For instance, a point centrally located in a cluster has a relatively low cumulative sum of ranks because it is among the nearest neighbours of its own nearest neighbours, but a point at the periphery of a cluster has a high cumulative sum of ranks because its nearest neighbours are closer to each other than the point. Use of ranks eliminates the problem of density calculation in the neighbourhood of the point and this improves the performance. Our method performs better than several density-based methods on some synthetic data sets as well as on some real data sets.
- 24 May 2011
- Published by IGI Global Scientific Publishing
- p. 208-238
Multi-Objective Evolutionary Algorithms for Sensor Network Design
Many sensor network design problems are characterized by the need to optimize multiple conflicting objectives. However, existing approaches generally focus on a single objective (ignoring the others), or combine multiple objectives into a single function to be optimized, to facilitate the application of classical optimization algorithms. This restricts their ability and constrains their usefulness to the network designer. A much more appropriate and natural approach is to address multiple objectives simultaneously, applying recently developed multi-objective evolutionary algorithms (MOEAs) in solving sensor network design problems. This chapter describes and illustrates this approach by modeling two sensor network design problems (mobile agent routing and sensor placement), as multi-objective optimization problems, developing the appropriate objective functions and discussing the tradeoffs between them. Simulation results using two recently developed MOEAs, viz., EMOCA (Rajagopalan, Mohan, Mehrotra, & Varshney, 2006) and NSGA-II (Deb, Pratap, Agarwal, & Meyarivan, 2000), show that these MOEAs successfully discover multiple solutions characterizing the tradeoffs between the objectives.
- 24 May 2011
- Published by IGI Global Scientific Publishing
- p. 208-238
Multi-Objective Evolutionary Algorithms for Sensor Network Design
Many sensor network design problems are characterized by the need to optimize multiple conflicting objectives. However, existing approaches generally focus on a single objective (ignoring the others), or combine multiple objectives into a single function to be optimized, to facilitate the application of classical optimization algorithms. This restricts their ability and constrains their usefulness to the network designer. A much more appropriate and natural approach is to address multiple objectives simultaneously, applying recently developed multi-objective evolutionary algorithms (MOEAs) in solving sensor network design problems. This chapter describes and illustrates this approach by modeling two sensor network design problems (mobile agent routing and sensor placement), as multi-objective optimization problems, developing the appropriate objective functions and discussing the tradeoffs between them. Simulation results using two recently developed MOEAs, viz., EMOCA (Rajagopalan, Mohan, Mehrotra, & Varshney, 2006) and NSGA-II (Deb, Pratap, Agarwal, & Meyarivan, 2000), show that these MOEAs successfully discover multiple solutions characterizing the tradeoffs between the objectives.
- 1 January 2010
- Published by Springer Nature
- p. 49-63
A Force-Directed Layout for Community Detection with Automatic Clusterization
- 1 January 2010
- Published by Springer Nature
- p. 49-63
A Force-Directed Layout for Community Detection with Automatic Clusterization
- Open Access
Approximation of Average Run Length of Moving Sum Algorithms Using Multivariate Probabilities
Among the various procedures used to detect potential changes in a stochastic process the moving sum algorithms are very popular due to their intuitive appeal and good statistical performance. One of the important design parameters of a change detection algorithm is the expected interval between false positives, also known as the average run length (ARL). Computation of the ARL usually involves numerical procedures but in some cases it can be approximated using a series involving multivariate probabilities. In this paper, we present an analysis of this series approach by providing sufficient conditions for convergence and derive an error bound. Using simulation studies, we show that the series approach is applicable to moving average and filtered derivative algorithms. For moving average algorithms, we compare our results with previously known bounds. We use two special cases to illustrate our observations.
Open AccessApproximation of Average Run Length of Moving Sum Algorithms Using Multivariate Probabilities
Among the various procedures used to detect potential changes in a stochastic process the moving sum algorithms are very popular due to their intuitive appeal and good statistical performance. One of the important design parameters of a change detection algorithm is the expected interval between false positives, also known as the average run length (ARL). Computation of the ARL usually involves numerical procedures but in some cases it can be approximated using a series involving multivariate probabilities. In this paper, we present an analysis of this series approach by providing sufficient conditions for convergence and derive an error bound. Using simulation studies, we show that the series approach is applicable to moving average and filtered derivative algorithms. For moving average algorithms, we compare our results with previously known bounds. We use two special cases to illustrate our observations.