Nikhil Ranjan Pal

Nikhil Ranjan Pal

Auto-generated profile, based on publicly available information

Nikhil Ranjan Pal

Indian Statistical Institute

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
16 January 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HZHuaqing Zhang
Huaqing Zhang
JWJian Wang
Jian Wang
ZSZhanquan Sun
Zhanquan Sun
JZJacek M. Zurada
Jacek M. Zurada
NPNikhil R. Pal
Nikhil R. Pal
We propose an embedded/integrated feature selection method based on neural networks with Group Lasso penalty. Group Lasso regularization is considered to produce sparsity on the inputs to the network, i.e., for selection of useful features. Lasso based feature selection using a multi-layer perceptron usually requires an additional set of weights, while our Group Lasso formulation does not require that. However, Group Lasso penalty is non-differentiable at the origin. This may lead to oscillations in numerical simulations and make it difficult to analyze theoretically. To address this issue, four smoothing Group Lasso penalties are introduced. A rigorous proof for the convergence of the proposed algorithm is presented under suitable assumptions. To verify the effectiveness, a three-step algorithmic architecture is adopted in implementation. Experimental results on several datasets validate the theoretical results and demonstrate the competitive performance of the proposed method.

10 November 2022 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
GXGuangdong Xue
Guangdong Xue
QCQin Chang
Qin Chang
JWJian Wang
Jian Wang
Kai ZhangKai Zhang
Kai Zhang
NPNikhil Ranjan Pal
Nikhil Ranjan Pal
A major limitation of fuzzy or neuro-fuzzy systems is their failure to deal with high-dimensional datasets. This happens primarily due to the use of T-norm, particularly, product or minimum (or a softer version of it). Thus, there are hardly any work dealing with datasets having features more than hundred or so. Here, we propose a neuro-fuzzy framework that can handle datasets with even more than 7000 features! In this context, we propose an adaptive softmin (Ada-softmin) which effectively overcomes the drawbacks of “numeric underflow” and “fake minimum” that arise for existing fuzzy systems while dealing with high-dimensional problems. We call it an Adaptive Takagi-Sugeno-Kang (AdaTSK) fuzzy system. We then equip the AdaTSK system to perform feature selection and rule extraction in an integrated manner. In this context, a novel gate function is introduced and embedded only in the consequent parts, which can determine the useful features and rules, in two successive phases of learning. Unlike conventional fuzzy rule bases, we design an enhanced fuzzy rule base (En-FRB), which maintains adequate rules but does not grow the number of rules exponentially with features that typically happens for fuzzy neural networks. The integrated Feature Selection and Rule Extraction AdaTSK (FSRE-AdaTSK) system consists of three sequential phases: (i) feature selection, (ii) rule extraction, and (iii) fine tuning. The effectiveness of the FSRE-AdaTSK is demonstrated on 19 datasets of which five are in more than 2000 dimension including two with more than 7000 features. This may be the first attempt to develop fuzzy rule based classifiers that can directly deal with more than 7000 features without requiring separate selection of features or any other dimensionality reduction method.

11 May 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
JWJian Wang
Jian Wang
HZHuaqing Zhang
Huaqing Zhang
JWJunze Wang
Junze Wang
Yi-Fei PuYi-Fei Pu
Yi-Fei Pu
NPNikhil R. Pal
Nikhil R. Pal
We propose a neural network-based feature selection (FS) scheme that can control the level of redundancy in the selected features by integrating two penalties into a single objective function. The Group Lasso penalty aims to produce sparsity in features in a grouped manner. The redundancy-control penalty, which is defined based on a measure of dependence among features, is utilized to control the level of redundancy among the selected features. Both the penalty terms involve the L2,1-norm of weight matrix between the input and hidden layers. These penalty terms are nonsmooth at the origin, and hence, one simple but efficient smoothing technique is employed to overcome this issue. The monotonicity and convergence of the proposed algorithm are specified and proved under suitable assumptions. Then, extensive experiments are conducted on both artificial and real data sets. Empirical results explicitly demonstrate the ability of the proposed FS scheme and its effectiveness in controlling redundancy. The empirical simulations are observed to be consistent with the theoretical results.

10 March 2022 in Neural Networks
Verified
Journal Article
Closed access
XGXiaoling Gong
Xiaoling Gong
LYLing Yu
Ling Yu
JWJian Wang
Jian Wang
Kai ZhangKai Zhang
Kai Zhang
XBXiao Bai
Xiao Bai
NPNikhil R. Pal
Nikhil R. Pal

26 January 2017 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
YLYuting Liu
Yuting Liu
NPNikhil R. Pal
Nikhil R. Pal
AMAmar R. Marathe
Amar R. Marathe
CLChin-Teng Lin
Chin-Teng Lin
This study proposes an architecture based on a weighted fuzzy Dempster-Shafer framework (WFDSF), which can adjust weights associated with inconsistent evidence obtained by different classification approaches, to realize a fusion system for integrating multimodal information. The Dempster-Shafer theory (D-S theory) of evidence enables us to integrate heterogeneous information from multiple sources to obtain collaborative inferences for a given problem. To conquer various uncertainties associated with the collected information, our system assigns beliefs and plausibilities to possible hypotheses of each decision maker and uses a combination rule to fuse multimodal information. For information fusion, an important step in D-S aggregation is to find an appropriate basic probability assignment scheme for allocating support to each possible hypothesis/class, which remains an arduous and unsolved problem. Here, we propose a mathematical structure to aggregate weighted evidence extracted from two different types of approaches: fuzzy Naïve Bayes and nearest mean classification rule. Further, an intuitionistic belief assignment is employed to address uncertainties between hypotheses/classes. Finally, 12 benchmark problems from the UCI machine learning repository for classification are employed to validate the proposed WFDSF-based scheme. In addition, an application of WFDSF to a practical brain-computer interface problem involving multimodal data fusion is demonstrated in this study. The experimental results show that the WFDSF is superior to several existing methods.

6 January 2007 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
NPNikhil R Pal
Nikhil R Pal
KAKripamoy Aguan
Kripamoy Aguan
ASAnimesh Sharma
Animesh Sharma
SAShun-Ichi Amari
Shun-Ichi Amari
The four heterogeneous childhood cancers, neuroblastoma, non-Hodgkin lymphoma, rhabdomyosarcoma, and Ewing sarcoma present a similar histology of small round blue cell tumor (SRBCT) and thus often leads to misdiagnosis. Identification of biomarkers for distinguishing these cancers is a well studied problem. Existing methods typically evaluate each gene separately and do not take into account the nonlinear interaction between genes and the tools that are used to design the diagnostic prediction system. Consequently, more genes are usually identified as necessary for prediction. We propose a general scheme for finding a small set of biomarkers to design a diagnostic system for accurate classification of the cancer subgroups. We use multilayer networks with online gene selection ability and relational fuzzy clustering to identify a small set of biomarkers for accurate classification of the training and blind test cases of a well studied data set. Our method discerned just seven biomarkers that precisely categorized the four subgroups of cancer both in training and blind samples. For the same problem, others suggested 19–94 genes. These seven biomarkers include three novel genes (NAB2, LSP1 and EHD1 – not identified by others) with distinct class-specific signatures and important role in cancer biology, including cellular proliferation, transendothelial migration and trafficking of MHC class antigens. Interestingly, NAB2 is downregulated in other tumors including Non-Hodgkin lymphoma and Neuroblastoma but we observed moderate to high upregulation in a few cases of Ewing sarcoma and Rabhdomyosarcoma, suggesting that NAB2 might be mutated in these tumors. These genes can discover the subgroups correctly with unsupervised learning, can differentiate non-SRBCT samples and they perform equally well with other machine learning tools including support vector machines. These biomarkers lead to four simple human interpretable rules for the diagnostic task. Although the proposed method is tested on a SRBCT data set, it is quite general and can be applied to other cancer data sets. Our scheme takes into account the interaction between genes as well as that between genes and the tool and thus is able find a very small set and can discover novel genes. Our findings suggest the possibility of developing specialized microarray chips or use of real-time qPCR assays or antibody based methods such as ELISA and western blot analysis for an easy and low cost diagnosis of the subgroups.