C. A. Murthy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
C. A. Murthy has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Sankar Kumar Pal
Center for Soft Computing Research, ISI, Kolkata, India
3 shared publications - Alok Goswami
Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, Kolkata, India
2 shared publications - Angshuman Roy
Applied Statistics Unit, Indian Statistical Institute, Kolkata, India
2 shared publications - Anil K. Ghosh
Theoretical Statistics and Mathematics Unit Indian Statistical Institute Kolkata India
2 shared publications - Malay Kumar Kundu
Indian Statistical Institute
2 shared publications S. Bandyopadhyay
Machine Intelligent Unit, Indian Stat. Inst., Calcutta, India
2 shared publications
Latest Publications
- 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.
- Open Access
A new estimate of mutual information based measure of dependence between two variables: properties and fast implementation
This article proposes a new method to estimate an existing mutual information based dependence measure using histogram density estimates. Finding a suitable bin length for histogram is an open problem. We propose a new way of computing the bin length for histogram using a function of maximum separation between points. The chosen bin length leads to consistent density estimates for histogram method. The values of density thus obtained are used to calculate an estimate of an existing dependence measure. The proposed estimate is named as Mutual Information Based Dependence Index (MIDI). Some important properties of MIDI have also been stated. The performance of the proposed method has been compared to generally accepted measures like Distance Correlation (dcor), Maximal Information Coefficient (MINE) in terms of accuracy and computational complexity with the help of several artificial data sets with different amounts of noise. The proposed method is able to detect many types of relationships between variables, without making any assumption about the functional form of the relationship. The power statistics of proposed method illustrate their effectiveness in detecting non linear relationship. Thus, it is able to achieve generality without a high rate of false positive cases. MIDI is found to work better on a real life data set than competing methods. The proposed method is found to overcome some of the limitations which occur with dcor and MINE. Computationally, MIDI is found to be better than dcor and MINE, in terms of time and memory, making it suitable for large data sets.
Open AccessA new estimate of mutual information based measure of dependence between two variables: properties and fast implementation
This article proposes a new method to estimate an existing mutual information based dependence measure using histogram density estimates. Finding a suitable bin length for histogram is an open problem. We propose a new way of computing the bin length for histogram using a function of maximum separation between points. The chosen bin length leads to consistent density estimates for histogram method. The values of density thus obtained are used to calculate an estimate of an existing dependence measure. The proposed estimate is named as Mutual Information Based Dependence Index (MIDI). Some important properties of MIDI have also been stated. The performance of the proposed method has been compared to generally accepted measures like Distance Correlation (dcor), Maximal Information Coefficient (MINE) in terms of accuracy and computational complexity with the help of several artificial data sets with different amounts of noise. The proposed method is able to detect many types of relationships between variables, without making any assumption about the functional form of the relationship. The power statistics of proposed method illustrate their effectiveness in detecting non linear relationship. Thus, it is able to achieve generality without a high rate of false positive cases. MIDI is found to work better on a real life data set than competing methods. The proposed method is found to overcome some of the limitations which occur with dcor and MINE. Computationally, MIDI is found to be better than dcor and MINE, in terms of time and memory, making it suitable for large data sets.
- 1 January 2014
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 130 (3) , 317-342
Centrality Measures, Upper Bound, and Influence Maximization in Large Scale Directed Social Networks
The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose two new centrality measures, Diffusion Degree for independent cascade model of information diffusion and Maximum Influence Degree. Unlike other existing centrality measures, diffusion degree considers neighbors' contributions in addition to the degree of a node. The measure also works flawlessly with non uniform propagation probability distributions. On the other hand, Maximum Influence Degree provides the maximum theoretically possible influence (Upper Bound) for a node. Extensive experiments are performed with five different real life large scale directed social networks. With independent cascade model, we perform experiments for both uniform and non uniform propagation probabilities. We use Diffusion Degree Heuristic (DiDH) and Maximum Influence Degree Heuristic (MIDH), to find the top k influential individuals. k seeds obtained through these for both the setups show superior influence compared to the seeds obtained by high degree heuristics, degree discount heuristics, different variants of set covering greedy algorithms and Prefix excluding Maximum Influence Arborescence (PMIA) algorithm. The superiority of the proposed method is also found to be statistically significant as per T-test.
- 1 January 2014
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 130 (3) , 317-342
Centrality Measures, Upper Bound, and Influence Maximization in Large Scale Directed Social Networks
The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose two new centrality measures, Diffusion Degree for independent cascade model of information diffusion and Maximum Influence Degree. Unlike other existing centrality measures, diffusion degree considers neighbors' contributions in addition to the degree of a node. The measure also works flawlessly with non uniform propagation probability distributions. On the other hand, Maximum Influence Degree provides the maximum theoretically possible influence (Upper Bound) for a node. Extensive experiments are performed with five different real life large scale directed social networks. With independent cascade model, we perform experiments for both uniform and non uniform propagation probabilities. We use Diffusion Degree Heuristic (DiDH) and Maximum Influence Degree Heuristic (MIDH), to find the top k influential individuals. k seeds obtained through these for both the setups show superior influence compared to the seeds obtained by high degree heuristics, degree discount heuristics, different variants of set covering greedy algorithms and Prefix excluding Maximum Influence Arborescence (PMIA) algorithm. The superiority of the proposed method is also found to be statistically significant as per T-test.
- 18 July 2013
- Published by Springer Nature in Machine Vision and Applications
- Vol. 25 (2) , 477-487
Generation of new points for training set and feature-level fusion in multimodal biometric identification
- 18 July 2013
- Published by Springer Nature in Machine Vision and Applications
- Vol. 25 (2) , 477-487
Generation of new points for training set and feature-level fusion in multimodal biometric identification
- 1 January 2013
- Published by IACSIT Press in International Journal of Computer Theory and Engineering
- p. 850-855
Application of Pattern Recognition Techniques to Predict Severe Thunderstorms
- 1 January 2013
- Published by IACSIT Press in International Journal of Computer Theory and Engineering
- p. 850-855
Application of Pattern Recognition Techniques to Predict Severe Thunderstorms
- 1 January 2013
- Published by Journal of Pattern Recognition Research in Journal of Pattern Recognition Research
- Vol. 8 (1) , 66-84
CUES: A New Hierarchical Approach for Document Clustering
The Journal of Pattern Recognition Research (JPRR) provides an open access forum for the publication of research articles in areas of pattern recognition, machine learning, artificial intelligence, computational algorithms, and fuzzy learning
- 1 January 2013
- Published by Journal of Pattern Recognition Research in Journal of Pattern Recognition Research
- Vol. 8 (1) , 66-84
CUES: A New Hierarchical Approach for Document Clustering
The Journal of Pattern Recognition Research (JPRR) provides an open access forum for the publication of research articles in areas of pattern recognition, machine learning, artificial intelligence, computational algorithms, and fuzzy learning
- 1 November 2012
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 120 (2) , 145-164
Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model
Genetic Algorithm (GA) has now become one of the leading mechanisms in providing solution to complex optimization problems. Although widely used, there are very few theoretical guidelines for determining when to stop the algorithm. This article establishes theoretically that the variance of the best fitness values obtained in the iterations can be considered as a measure to decide the termination criterion of a GA with elitist model (EGA). The criterion automatically takes into account the inherent characteristics of the objective function. Implementation issues of the proposed stopping criterion are explained. Its difference with some other stopping criteria is also critically analyzed.
- 1 November 2012
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 120 (2) , 145-164
Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model
Genetic Algorithm (GA) has now become one of the leading mechanisms in providing solution to complex optimization problems. Although widely used, there are very few theoretical guidelines for determining when to stop the algorithm. This article establishes theoretically that the variance of the best fitness values obtained in the iterations can be considered as a measure to decide the termination criterion of a GA with elitist model (EGA). The criterion automatically takes into account the inherent characteristics of the objective function. Implementation issues of the proposed stopping criterion are explained. Its difference with some other stopping criteria is also critically analyzed.
- 14 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 11 (4) , 402-409
Extracting Gene-Gene Interactions Through Curve Fitting
This paper presents a simple and novel curve fitting approach for generating simple gene regulatory subnetworks from time series gene expression data. Microarray experiments simultaneously generate massive data sets and help immensely in the large-scale study of gene expression patterns. Initial biclustering reduces the search space in the high-dimensional microarray data. The least-squares error between fitting of gene pairs is minimized to extract a set of gene-gene interactions, involving transcriptional regulation of genes. The higher error values are eliminated to retain only the strong interacting gene pairs in the resultant gene regulatory subnetwork. Next the algorithm is extended to a generalized framework to enhance its capability. The methodology takes care of the higher-order dependencies involving multiple genes co-regulating a single gene, while eliminating the need for user-defined parameters. It has been applied to the time-series Yeast data, and the experimental results biologically validated using standard databases and literature.
- 14 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 11 (4) , 402-409
Extracting Gene-Gene Interactions Through Curve Fitting
This paper presents a simple and novel curve fitting approach for generating simple gene regulatory subnetworks from time series gene expression data. Microarray experiments simultaneously generate massive data sets and help immensely in the large-scale study of gene expression patterns. Initial biclustering reduces the search space in the high-dimensional microarray data. The least-squares error between fitting of gene pairs is minimized to extract a set of gene-gene interactions, involving transcriptional regulation of genes. The higher error values are eliminated to retain only the strong interacting gene pairs in the resultant gene regulatory subnetwork. Next the algorithm is extended to a generalized framework to enhance its capability. The methodology takes care of the higher-order dependencies involving multiple genes co-regulating a single gene, while eliminating the need for user-defined parameters. It has been applied to the time-series Yeast data, and the experimental results biologically validated using standard databases and literature.