Anil K. Ghosh

Anil K. Ghosh

Auto-generated profile, based on publicly available information

Anil K. Ghosh

Theoretical Statistics and Mathematics Unit Indian Statistical Institute Kolkata India

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
23 October 2014 in Biometrika
Verified
Journal Article
Closed access
PDF file
MBMunmun Biswas
Munmun Biswas
MMMinerva Mukhopadhyay
Minerva Mukhopadhyay
AGAnil K. Ghosh
Anil K. Ghosh
We propose a multivariate generalization of the univariate two-sample run test based on the shortest Hamiltonian path. The proposed test is distribution-free in finite samples. While most existing two-sample tests perform poorly or are even inapplicable to high-dimensional data, our test can be conveniently used in high-dimension, low-sample-size situations. We investigate its power when the sample size remains fixed and the dimension of the data grows to infinity. Simulated and real datasets demonstrate our method’s superiority over existing nonparametric two-sample tests.

31 March 2011 in Annals of the Institute of Statistical Mathematics
Verified
Journal Article
Closed access
PDF file
SDSubhajit Dutta
Subhajit Dutta
AGAnil K. Ghosh
Anil K. Ghosh

23 April 2019 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
SSSoham Sarkar
Soham Sarkar
AGAnil K. Ghosh
Anil K. Ghosh
Popular clustering algorithms based on usual distance functions (e.g., the Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances and violation of neighborhood structure have adverse effects on their performance. In this article, we use a new data-driven dissimilarity measure, called MADD, which takes care of these problems. MADD uses the distance concentration phenomenon to its advantage, and as a result, clustering algorithms based on MADD usually perform well for high dimensional data. We establish it using theoretical as well as numerical studies. We also address the problem of estimating the number of clusters. This is a challenging problem in cluster analysis, and several algorithms are available for it. We show that many of these existing algorithms have superior performance in high dimensions when they are constructed using MADD. We also construct a new estimator based on a penalized version of the Dunn index and prove its consistency in the HDLSS asymptotic regime. Several simulated and real data sets are analyzed to demonstrate the usefulness of MADD for cluster analysis of high dimensional data.