Asoke K. Nandi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Asoke K. Nandi has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Rangaraj Mandayam Rangayyan
Department of Electrical and Computer Engineering, University of Calgary, Calgary, Alberta, Canada
5 shared publications - Sameh Abd El-Rahman Salem
Helwan University
4 shared publications - Tingting Mu
Department of Electrical Engineering and Electronics, University of Liverpool, Brownlow Hill, Liverpool L69 3GJ, UK
4 shared publications - Nancy M. Salem
Biomedical Engineering Department, Helwan University, Cairo, Egypt
3 shared publications Basel Abu-Jamous
Department of Electrical Engineering and Electronics, University of Liverpool, Brownlow Hill, Liverpool L69 3GJ, UK
2 shared publications- David J. Roberts
Biomedical Research Centre Haematology Theme, Radcliffe Department of Medicine, University of Oxford, Oxford, UK; NHS Blood and Transplant, John Radcliffe Hospital, Oxford, UK
2 shared publications
Latest Publications
- Open Access
- 6 April 2013
- Published by The Royal Society in Journal of The Royal Society Interface
- Vol. 10 (81) , 20120990
Yeast gene CMR1/YDL156W is consistently co-expressed with genes participating in DNA-metabolic processes in a variety of stringent clustering experiments
The binarization of consensus partition matrices (Bi-CoPaM) method has, among its unique features, the ability to perform ensemble clustering over the same set of genes from multiple microarray datasets by using various clustering methods in order to generate tunable tight clusters. Therefore, we have used the Bi-CoPaM method to the most synchronized 500 cell-cycle-regulated yeast genes from different microarray datasets to produce four tight, specific and exclusive clusters of co-expressed genes. We found 19 genes formed the tightest of the four clusters and this included the gene CMR1/YDL156W, which was an uncharacterized gene at the time of our investigations. Two very recent proteomic and biochemical studies have independently revealed many facets of CMR1 protein, although the precise functions of the protein remain to be elucidated. Our computational results complement these biological results and add more evidence to their recent findings of CMR1 as potentially participating in many of the DNA-metabolism processes such as replication, repair and transcription. Interestingly, our results demonstrate the close co-expressions of CMR1 and the replication protein A (RPA), the cohesion complex and the DNA polymerases α , δ and ɛ , as well as suggest functional relationships between CMR1 and the respective proteins. In addition, the analysis provides further substantial evidence that the expression of the CMR1 gene could be regulated by the MBF complex. In summary, the application of a novel analytic technique in large biological datasets has provided supporting evidence for a gene of previously unknown function, further hypotheses to test, and a more general demonstration of the value of sophisticated methods to explore new large datasets now so readily generated in biological experiments.
- 6 April 2013
- Published by The Royal Society in Journal of The Royal Society Interface
- Vol. 10 (81) , 20120990
Open AccessYeast gene CMR1/YDL156W is consistently co-expressed with genes participating in DNA-metabolic processes in a variety of stringent clustering experiments
The binarization of consensus partition matrices (Bi-CoPaM) method has, among its unique features, the ability to perform ensemble clustering over the same set of genes from multiple microarray datasets by using various clustering methods in order to generate tunable tight clusters. Therefore, we have used the Bi-CoPaM method to the most synchronized 500 cell-cycle-regulated yeast genes from different microarray datasets to produce four tight, specific and exclusive clusters of co-expressed genes. We found 19 genes formed the tightest of the four clusters and this included the gene CMR1/YDL156W, which was an uncharacterized gene at the time of our investigations. Two very recent proteomic and biochemical studies have independently revealed many facets of CMR1 protein, although the precise functions of the protein remain to be elucidated. Our computational results complement these biological results and add more evidence to their recent findings of CMR1 as potentially participating in many of the DNA-metabolism processes such as replication, repair and transcription. Interestingly, our results demonstrate the close co-expressions of CMR1 and the replication protein A (RPA), the cohesion complex and the DNA polymerases α , δ and ɛ , as well as suggest functional relationships between CMR1 and the respective proteins. In addition, the analysis provides further substantial evidence that the expression of the CMR1 gene could be regulated by the MBF complex. In summary, the application of a novel analytic technique in large biological datasets has provided supporting evidence for a gene of previously unknown function, further hypotheses to test, and a more general demonstration of the value of sophisticated methods to explore new large datasets now so readily generated in biological experiments.
- Open Access
- 11 February 2013
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 8 (2) , e56432
Paradigm of Tunable Clustering Using Binarization of Consensus Partition Matrices (Bi-CoPaM) for Gene Discovery
Clustering analysis has a growing role in the study of co-expressed genes for gene discovery. Conventional binary and fuzzy clustering do not embrace the biological reality that some genes may be irrelevant for a problem and not be assigned to a cluster, while other genes may participate in several biological functions and should simultaneously belong to multiple clusters. Also, these algorithms cannot generate tight clusters that focus on their cores or wide clusters that overlap and contain all possibly relevant genes. In this paper, a new clustering paradigm is proposed. In this paradigm, all three eventualities of a gene being exclusively assigned to a single cluster, being assigned to multiple clusters, and being not assigned to any cluster are possible. These possibilities are realised through the primary novelty of the introduction of tunable binarization techniques. Results from multiple clustering experiments are aggregated to generate one fuzzy consensus partition matrix (CoPaM), which is then binarized to obtain the final binary partitions. This is referred to as Binarization of Consensus Partition Matrices (Bi-CoPaM). The method has been tested with a set of synthetic datasets and a set of five real yeast cell-cycle datasets. The results demonstrate its validity in generating relevant tight, wide, and complementary clusters that can meet requirements of different gene discovery studies.
- 11 February 2013
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 8 (2) , e56432
Open AccessParadigm of Tunable Clustering Using Binarization of Consensus Partition Matrices (Bi-CoPaM) for Gene Discovery
Clustering analysis has a growing role in the study of co-expressed genes for gene discovery. Conventional binary and fuzzy clustering do not embrace the biological reality that some genes may be irrelevant for a problem and not be assigned to a cluster, while other genes may participate in several biological functions and should simultaneously belong to multiple clusters. Also, these algorithms cannot generate tight clusters that focus on their cores or wide clusters that overlap and contain all possibly relevant genes. In this paper, a new clustering paradigm is proposed. In this paradigm, all three eventualities of a gene being exclusively assigned to a single cluster, being assigned to multiple clusters, and being not assigned to any cluster are possible. These possibilities are realised through the primary novelty of the introduction of tunable binarization techniques. Results from multiple clustering experiments are aggregated to generate one fuzzy consensus partition matrix (CoPaM), which is then binarized to obtain the final binary partitions. This is referred to as Binarization of Consensus Partition Matrices (Bi-CoPaM). The method has been tested with a set of synthetic datasets and a set of five real yeast cell-cycle datasets. The results demonstrate its validity in generating relevant tight, wide, and complementary clusters that can meet requirements of different gene discovery studies.
- 10 November 2010
- Published by Wiley in Expert Systems
- Vol. 28 (2) , 167-184
Evolution of superFeatures through genetic programming
- 10 November 2010
- Published by Wiley in Expert Systems
- Vol. 28 (2) , 167-184
Evolution of superFeatures through genetic programming
- 9 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (10) , 966-968
Adaptive Minimum Entropy Equalization Algorithm
We employ minimum entropy deconvolution principle for blind equalization of complex digital signals. In essence, we maximize the output energy, constrain the equalizer output not to exceed certain level and obtain an adaptive solution capable of opening a closed-eye with the recovery of true energy of signal. We provide evidence of good performance in comparison to existing adaptive methods, like CMA and its variants, through simulations.
- 9 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (10) , 966-968
Adaptive Minimum Entropy Equalization Algorithm
We employ minimum entropy deconvolution principle for blind equalization of complex digital signals. In essence, we maximize the output energy, constrain the equalizer output not to exceed certain level and obtain an adaptive solution capable of opening a closed-eye with the recovery of true energy of signal. We provide evidence of good performance in comparison to existing adaptive methods, like CMA and its variants, through simulations.
- 13 May 2009
- Published by Wiley in Expert Systems
- Vol. 26 (2) , 160-175
Automatic tuning of L2‐SVM parameters employing the extended Kalman filter
We show that tuning of multiple parameters for a 2‐norm support vector machine (L2‐SVM) could be viewed as an identification problem of a nonlinear dynamic system. Benefiting from the reachable smooth nonlinearity of an L2‐SVM, we propose to employ the extended Kalman filter to tune the kernel and regularization parameters automatically for the L2‐SVM. The proposed method is validated using three public benchmark data sets and compared with the gradient descent approach as well as the genetic algorithm in measures of classification accuracy and computing time. Experimental results demonstrate the effectiveness of the proposed method in higher classification accuracies, faster training speed and less sensitivity to the initial settings.
- 13 May 2009
- Published by Wiley in Expert Systems
- Vol. 26 (2) , 160-175
Automatic tuning of L2‐SVM parameters employing the extended Kalman filter
We show that tuning of multiple parameters for a 2‐norm support vector machine (L2‐SVM) could be viewed as an identification problem of a nonlinear dynamic system. Benefiting from the reachable smooth nonlinearity of an L2‐SVM, we propose to employ the extended Kalman filter to tune the kernel and regularization parameters automatically for the L2‐SVM. The proposed method is validated using three public benchmark data sets and compared with the gradient descent approach as well as the genetic algorithm in measures of classification accuracy and computing time. Experimental results demonstrate the effectiveness of the proposed method in higher classification accuracies, faster training speed and less sensitivity to the initial settings.
- 2 February 2009
- Published by Wiley in Expert Systems
- Vol. 26 (1) , 8-21
Augmentation of a nearest neighbour clustering algorithm with a partial supervision strategy for biomedical data classification
In this paper, a partial supervision strategy for a recently developed clustering algorithm, the nearest neighbour clustering algorithm (NNCA), is proposed. The proposed method (NNCA‐PS) offers classification capability with a smaller amount of a priori knowledge, where a small number of data objects from the entire data set are used as labelled objects to guide the clustering process towards a better search space. Experimental results show that NNCA‐PS gives promising results of 89% sensitivity at 95% specificity when used to segment retinal blood vessels, and a maximum classification accuracy of 99.5% with 97.2% average accuracy when applied to a breast cancer data set. Comparisons with other methods indicate the robustness of the proposed method in classification. Additionally, experiments on parallel environments indicate the suitability and scalability of NNCA‐PS in handling larger data sets.
- 2 February 2009
- Published by Wiley in Expert Systems
- Vol. 26 (1) , 8-21
Augmentation of a nearest neighbour clustering algorithm with a partial supervision strategy for biomedical data classification
In this paper, a partial supervision strategy for a recently developed clustering algorithm, the nearest neighbour clustering algorithm (NNCA), is proposed. The proposed method (NNCA‐PS) offers classification capability with a smaller amount of a priori knowledge, where a small number of data objects from the entire data set are used as labelled objects to guide the clustering process towards a better search space. Experimental results show that NNCA‐PS gives promising results of 89% sensitivity at 95% specificity when used to segment retinal blood vessels, and a maximum classification accuracy of 99.5% with 97.2% average accuracy when applied to a breast cancer data set. Comparisons with other methods indicate the robustness of the proposed method in classification. Additionally, experiments on parallel environments indicate the suitability and scalability of NNCA‐PS in handling larger data sets.
- 21 October 2008
- Published by Wiley in Expert Systems
- Vol. 25 (5) , 444-459
Feature extraction and dimensionality reduction by genetic programming based on the Fisher criterion
Feature extraction helps to maximize the useful information within a feature vector, by reducing the dimensionality and making the classification effective and simple. In this paper, a novel feature extraction method is proposed: genetic programming (GP) is used to discover features, while the Fisher criterion is employed to assign fitness values. This produces non‐linear features for both two‐class and multiclass recognition, reflecting the discriminating information between classes. Compared with other GP‐based methods which need to generate c discriminant functions for solving c‐class (c>2) pattern recognition problems, only one single feature, obtained by a single GP run, appears to be highly satisfactory in this approach. The proposed method is experimentally compared with some non‐linear feature extraction methods, such as kernel generalized discriminant analysis and kernel principal component analysis. Results demonstrate the capability of the proposed approach to transform information from the high‐dimensional feature space into a single‐dimensional space by automatically discovering the relationships between data, producing improved performance.
- 21 October 2008
- Published by Wiley in Expert Systems
- Vol. 25 (5) , 444-459
Feature extraction and dimensionality reduction by genetic programming based on the Fisher criterion
Feature extraction helps to maximize the useful information within a feature vector, by reducing the dimensionality and making the classification effective and simple. In this paper, a novel feature extraction method is proposed: genetic programming (GP) is used to discover features, while the Fisher criterion is employed to assign fitness values. This produces non‐linear features for both two‐class and multiclass recognition, reflecting the discriminating information between classes. Compared with other GP‐based methods which need to generate c discriminant functions for solving c‐class (c>2) pattern recognition problems, only one single feature, obtained by a single GP run, appears to be highly satisfactory in this approach. The proposed method is experimentally compared with some non‐linear feature extraction methods, such as kernel generalized discriminant analysis and kernel principal component analysis. Results demonstrate the capability of the proposed approach to transform information from the high‐dimensional feature space into a single‐dimensional space by automatically discovering the relationships between data, producing improved performance.
- 1 October 2008
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 38 (10) , 1103-1111
Screening of knee-joint vibroarthrographic signals using the strict 2-surface proximal classifier and genetic algorithm
- 1 October 2008
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 38 (10) , 1103-1111
Screening of knee-joint vibroarthrographic signals using the strict 2-surface proximal classifier and genetic algorithm
- 28 February 2008
- Published by Springer Nature in Journal of Digital Imaging
- Vol. 21 (2) , 153-169
Classification of Breast Masses Using Selected Shape, Edge-sharpness, and Texture Features with Linear and Kernel-based Classifiers
Breast masses due to benign disease and malignant tumors related to breast cancer differ in terms of shape, edge-sharpness, and texture characteristics. In this study, we evaluate a set of 22 features including 5 shape factors, 3 edge-sharpness measures, and 14 texture features computed from 111 regions in mammograms, with 46 regions related to malignant tumors and 65 to benign masses. Feature selection is performed by a genetic algorithm based on several criteria, such as alignment of the kernel with the target function, class separability, and normalized distance. Fisher’s linear discriminant analysis, the support vector machine (SVM), and our strict two-surface proximal (S2SP) classifier, as well as their corresponding kernel-based nonlinear versions, are used in the classification task with the selected features. The nonlinear classification performance of kernel Fisher’s discriminant analysis, SVM, and S2SP, with the Gaussian kernel, reached 0.95 in terms of the area under the receiver operating characteristics curve. The results indicate that improvement in classification accuracy may be gained by using selected combinations of shape, edge-sharpness, and texture features.
- 28 February 2008
- Published by Springer Nature in Journal of Digital Imaging
- Vol. 21 (2) , 153-169
Classification of Breast Masses Using Selected Shape, Edge-sharpness, and Texture Features with Linear and Kernel-based Classifiers
Breast masses due to benign disease and malignant tumors related to breast cancer differ in terms of shape, edge-sharpness, and texture characteristics. In this study, we evaluate a set of 22 features including 5 shape factors, 3 edge-sharpness measures, and 14 texture features computed from 111 regions in mammograms, with 46 regions related to malignant tumors and 65 to benign masses. Feature selection is performed by a genetic algorithm based on several criteria, such as alignment of the kernel with the target function, class separability, and normalized distance. Fisher’s linear discriminant analysis, the support vector machine (SVM), and our strict two-surface proximal (S2SP) classifier, as well as their corresponding kernel-based nonlinear versions, are used in the classification task with the selected features. The nonlinear classification performance of kernel Fisher’s discriminant analysis, SVM, and S2SP, with the Gaussian kernel, reached 0.95 in terms of the area under the receiver operating characteristics curve. The results indicate that improvement in classification accuracy may be gained by using selected combinations of shape, edge-sharpness, and texture features.
- 26 January 2008
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 12 (1) , 79-98
Development of assessment criteria for clustering algorithms
- 26 January 2008
- Published by Springer Nature in Pattern Analysis and Applications
- Vol. 12 (1) , 79-98
Development of assessment criteria for clustering algorithms