Anil K. Ghosh
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
Research Subjects
Anil K. Ghosh has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Soham Sarkar
Institut de Mathématiques Ecole Polytechnique mail Fédérale de Lausanne e
10 shared publications - Angshuman Roy
Applied Statistics Unit, Indian Statistical Institute, Kolkata, India
4 shared publications - Subhajit Dutta
Indian Institute of Technology Kanpur
4 shared publications - Alok Goswami
Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Kolkata, India
3 shared publications - Munmun Biswas
Department of Statistics, Brahmananda Keshab Chandra College, Kolkata, India
3 shared publications - Analabha Basu
National Institute of Biomedical Genomics, Kalyani, India
2 shared publications
Latest Publications
Nearest Neighbour Classification Based on Imbalanced Data: A Statistical Approach
When the competing classes in a classification problem are not of comparable sizes, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbour classifier is no exception. To take care of this problem, we develop a statistical method for nearest neighbour classification based on such imbalanced datasets. We first construct a classifier for the binary classification problem and then extend it to classification problems involving more than two classes. Unlike the existing oversampling or undersampling methods, our proposed classifiers do not need to generate pseudo observations or remove existing observations; hence, the results are exactly reproducible. We establish the Bayes risk consistency of these classifiers under appropriate regularity conditions. Their superior performance over the existing methods is amply demonstrated by analysing several simulated and benchmark datasets.
Nearest Neighbour Classification Based on Imbalanced Data: A Statistical Approach
When the competing classes in a classification problem are not of comparable sizes, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbour classifier is no exception. To take care of this problem, we develop a statistical method for nearest neighbour classification based on such imbalanced datasets. We first construct a classifier for the binary classification problem and then extend it to classification problems involving more than two classes. Unlike the existing oversampling or undersampling methods, our proposed classifiers do not need to generate pseudo observations or remove existing observations; hence, the results are exactly reproducible. We establish the Bayes risk consistency of these classifiers under appropriate regularity conditions. Their superior performance over the existing methods is amply demonstrated by analysing several simulated and benchmark datasets.
- Open Access
On High-Dimensional Change-Point Detection Based on Pairwise Distances
In change-point analysis, one aims at finding the locations of abrupt distributional changes (if any) in a sequence of multivariate observations. In this article, we propose some nonparametric methods based on averages of pairwise distances for this purpose. These distance-based methods can be conveniently used for high-dimensional data even when the dimension is much larger than the sample size (i.e., the length of the sequence). We carry out some theoretical investigations on the behaviour of these methods not only when the dimension of the data remains fixed and the sample size grows to infinity, but also in situations where the dimension diverges to infinity while the sample size may or may not grow with the dimension. Several high-dimensional datasets are analyzed to compare the empirical performance of these proposed methods against some state-of-the-art methods.
Open AccessOn High-Dimensional Change-Point Detection Based on Pairwise Distances
In change-point analysis, one aims at finding the locations of abrupt distributional changes (if any) in a sequence of multivariate observations. In this article, we propose some nonparametric methods based on averages of pairwise distances for this purpose. These distance-based methods can be conveniently used for high-dimensional data even when the dimension is much larger than the sample size (i.e., the length of the sequence). We carry out some theoretical investigations on the behaviour of these methods not only when the dimension of the data remains fixed and the sample size grows to infinity, but also in situations where the dimension diverges to infinity while the sample size may or may not grow with the dimension. Several high-dimensional datasets are analyzed to compare the empirical performance of these proposed methods against some state-of-the-art methods.
- Open Access
User-UAV Association for Dynamic User in mmWave Communication for eMBB and URLLC
In unmanned aerial vehicle (UAV) assisted millimeter wave (mmWave) communication, appropriate user-UAV association is crucial for improving system performance. In mmWave communication, user throughput largely depends on the line of sight (LoS) connectivity with the UAV, which in turn depends on the mobility pattern of the users. Moreover, different traffic types like enhanced mobile broadband (eMBB) and ultra reliable low latency communication (URLLC) may require different types of LoS connectivity. Existing user-UAV association policies do not consider the user mobility during a time interval and different LoS requirements of different traffic types. In this paper, we consider both of them and develop a user association policy in the presence of building blockages. First, considering a simplified scenario, we have analytically established the LoS area, which is the region where users will experience seamless LoS connectivity for eMBB traffic, and the LoS radius, which is the radius of the largest circle within which the user gets uninterrupted LoS services for URLLC traffic. Then, for a more complex scenario, we present a geometric shadow polygon-based method to compute LoS area and LoS radius. Finally, we associate eMBB and URLLC users, with the UAVs from which they get the maximum average throughput based on LoS area and maximum LoS radius respectively. We show that our approach outperforms the existing discretization based and maximum throughput based approaches.
Open AccessUser-UAV Association for Dynamic User in mmWave Communication for eMBB and URLLC
In unmanned aerial vehicle (UAV) assisted millimeter wave (mmWave) communication, appropriate user-UAV association is crucial for improving system performance. In mmWave communication, user throughput largely depends on the line of sight (LoS) connectivity with the UAV, which in turn depends on the mobility pattern of the users. Moreover, different traffic types like enhanced mobile broadband (eMBB) and ultra reliable low latency communication (URLLC) may require different types of LoS connectivity. Existing user-UAV association policies do not consider the user mobility during a time interval and different LoS requirements of different traffic types. In this paper, we consider both of them and develop a user association policy in the presence of building blockages. First, considering a simplified scenario, we have analytically established the LoS area, which is the region where users will experience seamless LoS connectivity for eMBB traffic, and the LoS radius, which is the radius of the largest circle within which the user gets uninterrupted LoS services for URLLC traffic. Then, for a more complex scenario, we present a geometric shadow polygon-based method to compute LoS area and LoS radius. Finally, we associate eMBB and URLLC users, with the UAVs from which they get the maximum average throughput based on LoS area and maximum LoS radius respectively. We show that our approach outperforms the existing discretization based and maximum throughput based approaches.
- 27 November 2023
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 33 (2) , 448-462
On Exact Feature Screening in Ultrahigh-Dimensional Binary Classification
- 27 November 2023
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 33 (2) , 448-462
On Exact Feature Screening in Ultrahigh-Dimensional Binary Classification
- Open Access
Nearest Neighbor Classification based on Imbalanced Data: A Statistical Approach
When the competing classes in a classification problem are not of comparable size, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbor classifier is no exception. To take care of this problem, we develop a statistical method for nearest neighbor classification based on such imbalanced data sets. First, we construct a classifier for the binary classification problem and then extend it for classification problems involving more than two classes. Unlike the existing oversampling or undersampling methods, our proposed classifiers do not need to generate any pseudo observations or remove any existing observations, hence the results are exactly reproducible. We establish the Bayes risk consistency of these classifiers under appropriate regularity conditions. Their superior performance over the existing methods is amply demonstrated by analyzing several benchmark data sets.
Open AccessNearest Neighbor Classification based on Imbalanced Data: A Statistical Approach
When the competing classes in a classification problem are not of comparable size, many popular classifiers exhibit a bias towards larger classes, and the nearest neighbor classifier is no exception. To take care of this problem, we develop a statistical method for nearest neighbor classification based on such imbalanced data sets. First, we construct a classifier for the binary classification problem and then extend it for classification problems involving more than two classes. Unlike the existing oversampling or undersampling methods, our proposed classifiers do not need to generate any pseudo observations or remove any existing observations, hence the results are exactly reproducible. We establish the Bayes risk consistency of these classifiers under appropriate regularity conditions. Their superior performance over the existing methods is amply demonstrated by analyzing several benchmark data sets.
- Open Access
On Generalizations of Some Distance Based Classifiers for HDLSS Data
In high dimension, low sample size (HDLSS) settings, classifiers based on Euclidean distances like the nearest neighbor classifier and the average distance classifier perform quite poorly if differences between locations of the underlying populations get masked by scale differences. To rectify this problem, several modifications of these classifiers have been proposed in the literature. However, existing methods are confined to location and scale differences only, and often fail to discriminate among populations differing outside of the first two moments. In this article, we propose some simple transformations of these classifiers resulting into improved performance even when the underlying populations have the same location and scale. We further propose a generalization of these classifiers based on the idea of grouping of variables. The high-dimensional behavior of the proposed classifiers is studied theoretically. Numerical experiments with a variety of simulated examples as well as an extensive analysis of real data sets exhibit advantages of the proposed methods.
Open AccessOn Generalizations of Some Distance Based Classifiers for HDLSS Data
In high dimension, low sample size (HDLSS) settings, classifiers based on Euclidean distances like the nearest neighbor classifier and the average distance classifier perform quite poorly if differences between locations of the underlying populations get masked by scale differences. To rectify this problem, several modifications of these classifiers have been proposed in the literature. However, existing methods are confined to location and scale differences only, and often fail to discriminate among populations differing outside of the first two moments. In this article, we propose some simple transformations of these classifiers resulting into improved performance even when the underlying populations have the same location and scale. We further propose a generalization of these classifiers based on the idea of grouping of variables. The high-dimensional behavior of the proposed classifiers is studied theoretically. Numerical experiments with a variety of simulated examples as well as an extensive analysis of real data sets exhibit advantages of the proposed methods.
- 4 February 2021
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 91 (9) , 1890-1906
Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours
Testing mutual independence among several random vectors of arbitrary dimensions is a challenging problem in Statistics, and it has gained considerable interest in recent years. In this article, we propose some nonparametric tests based on different notions of ranks of nearest neighbour. These proposed tests can be conveniently used for high dimensional data, even when the dimensions of the random vectors are larger than the sample size. We investigate the performance of these tests on several simulated and real data sets and also use them in identifying causal relationships among the random vectors. Our numerical results show that they can outperform state-of-the-art tests in a wide variety of examples.
- 4 February 2021
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 91 (9) , 1890-1906
Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours
Testing mutual independence among several random vectors of arbitrary dimensions is a challenging problem in Statistics, and it has gained considerable interest in recent years. In this article, we propose some nonparametric tests based on different notions of ranks of nearest neighbour. These proposed tests can be conveniently used for high dimensional data, even when the dimensions of the random vectors are larger than the sample size. We investigate the performance of these tests on several simulated and real data sets and also use them in identifying causal relationships among the random vectors. Our numerical results show that they can outperform state-of-the-art tests in a wide variety of examples.
- 28 August 2020
- Published by Springer Nature in Statistics and Computing
- Vol. 30 (6) , 1707-1723
On some consistent tests of mutual independence among several random vectors of arbitrary dimensions
- 28 August 2020
- Published by Springer Nature in Statistics and Computing
- Vol. 30 (6) , 1707-1723
On some consistent tests of mutual independence among several random vectors of arbitrary dimensions
- 15 July 2020
- Published by Springer Nature in Sankhya A
- Vol. 84 (2) , 556-596
Some New Copula Based Distribution-free Tests of Independence among Several Random Variables
- 15 July 2020
- Published by Springer Nature in Sankhya A
- Vol. 84 (2) , 556-596
Some New Copula Based Distribution-free Tests of Independence among Several Random Variables
- Open Access
Some New Copula Based Distribution-free Tests of Independence among Several Random Variables
Over the last couple of decades, several copula based methods have been proposed in the literature to test for the independence among several random variables. But these existing tests are not invariant under monotone transformations of the variables, and they often perform poorly if the dependence among the variables is highly non-monotone in nature. In this article, we propose a copula based measure of dependency and use it to construct some new distribution-free tests of independence. The proposed measure and the resulting tests, all are invariant under permutations and monotone transformations of the variables. Our dependency measure involves a kernel function, and we use the Gaussian kernel for that purpose. We adopt a multi-scale approach, where we look at the results obtained for several choices of the bandwidth parameter associated with the Gaussian kernel and aggregate them judiciously. Large sample properties of the dependency measure and the resulting tests are derived under appropriate regularity conditions. Several simulated and real data sets are analyzed to compare the performance of the proposed tests with some popular tests available in the literature.
Open AccessSome New Copula Based Distribution-free Tests of Independence among Several Random Variables
Over the last couple of decades, several copula based methods have been proposed in the literature to test for the independence among several random variables. But these existing tests are not invariant under monotone transformations of the variables, and they often perform poorly if the dependence among the variables is highly non-monotone in nature. In this article, we propose a copula based measure of dependency and use it to construct some new distribution-free tests of independence. The proposed measure and the resulting tests, all are invariant under permutations and monotone transformations of the variables. Our dependency measure involves a kernel function, and we use the Gaussian kernel for that purpose. We adopt a multi-scale approach, where we look at the results obtained for several choices of the bandwidth parameter associated with the Gaussian kernel and aggregate them judiciously. Large sample properties of the dependency measure and the resulting tests are derived under appropriate regularity conditions. Several simulated and real data sets are analyzed to compare the performance of the proposed tests with some popular tests available in the literature.