Moumita Pramanik

Ms. Moumita Pramanik

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
31 March 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
RPRanjit Panigrahi
Ranjit Panigrahi
Samarjeet BorahSamarjeet Borah
Samarjeet Borah
AKASH KUMAR BHOIAKASH KUMAR BHOI
AKASH KUMAR BHOI
MIMuhammad Fazal Ijaz
Muhammad Fazal Ijaz
MPMoumita Pramanik
Moumita Pramanik
Rutvij JhaveriRutvij Jhaveri
Rutvij Jhaveri
The widespread acceptance and increase of the Internet and mobile technologies have revolutionized our existence. On the other hand, the world is witnessing and suffering due to technologically aided crime methods. These threats, including but not limited to hacking and intrusions and are the main concern for security experts. Nevertheless, the challenges facing effective intrusion detection methods continue closely associated with the researcher’s interests. This paper’s main contribution is to present a host-based intrusion detection system using a C4.5-based detector on top of the popular Consolidated Tree Construction (CTC) algorithm, which works efficiently in the presence of class-imbalanced data. An improved version of the random sampling mechanism called Supervised Relative Random Sampling (SRRS) has been proposed to generate a balanced sample from a high-class imbalanced dataset at the detector’s pre-processing stage. Moreover, an improved multi-class feature selection mechanism has been designed and developed as a filter component to generate the IDS datasets’ ideal outstanding features for efficient intrusion detection. The proposed IDS has been validated with state-of-the-art intrusion detection systems. The results show an accuracy of 99.96% and 99.95%, considering the NSL-KDD dataset and the CICIDS2017 dataset using 34 features.

17 March 2022 in Computer Communications
Verified
Journal Article
Closed access
RPRanjit Panigrahi
Ranjit Panigrahi
Samarjeet BorahSamarjeet Borah
Samarjeet Borah
MPMoumita Pramanik
Moumita Pramanik
AKASH KUMAR BHOIAKASH KUMAR BHOI
AKASH KUMAR BHOI
Paolo BarsocchiPaolo Barsocchi
Paolo Barsocchi
WAWaleed Alnumay
Waleed Alnumay

8 January 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
MPMoumita Pramanik
Moumita Pramanik
RPRatika Pradhan
Ratika Pradhan
PNParvati Nandy
Parvati Nandy
AKASH KUMAR BHOIAKASH KUMAR BHOI
AKASH KUMAR BHOI
Paolo BarsocchiPaolo Barsocchi
Paolo Barsocchi
Biomedical engineers prefer decision forests over traditional decision trees to design state-of-the-art Parkinson’s Detection Systems (PDS) on massive acoustic signal data. However, the challenges that the researchers are facing with decision forests is identifying the minimum number of decision trees required to achieve maximum detection accuracy with the lowest error rate. This article examines two recent decision forest algorithms Systematically Developed Forest (SysFor), and Decision Forest by Penalizing Attributes (ForestPA) along with the popular Random Forest to design three distinct Parkinson’s detection schemes with optimum number of decision trees. The proposed approach undertakes minimum number of decision trees to achieve maximum detection accuracy. The training and testing samples and the density of trees in the forest are kept dynamic and incremental to achieve the decision forests with maximum capability for detecting Parkinson’s Disease (PD). The incremental tree densities with dynamic training and testing of decision forests proved to be a better approach for detection of PD. The proposed approaches are examined along with other state-of-the-art classifiers including the modern deep learning techniques to observe the detection capability. The article also provides a guideline to generate ideal training and testing split of two modern acoustic datasets of Parkinson’s and control subjects donated by the Department of Neurology in Cerrahpaşa, Istanbul and Departamento de Matemáticas, Universidad de Extremadura, Cáceres, Spain. Among the three proposed detection schemes the Forest by Penalizing Attributes (ForestPA) proved to be a promising Parkinson’s disease detector with a little number of decision trees in the forest to score the highest detection accuracy of 94.12% to 95.00%.

21 August 2021 in Journal of Healthcare Engineering
Verified
Journal Article
Open access
PDF file
MPMoumita Pramanik
Moumita Pramanik
RPRatika Pradhan
Ratika Pradhan
PNParvati Nandy
Parvati Nandy
Saeed Mian QaisarSaeed Mian Qaisar
Saeed Mian Qaisar
AKASH KUMAR BHOIAKASH KUMAR BHOI
AKASH KUMAR BHOI
This article presents a machine learning approach for Parkinson’s disease detection. Potential multiple acoustic signal features of Parkinson’s and control subjects are ascertained. A collaborated feature bank is created through correlated feature selection, Fisher score feature selection, and mutual information-based feature selection schemes. A detection model on top of the feature bank has been developed using the traditional Naïve Bayes, which proved state of the art. The Naïve Bayes detector on collaborative acoustic features can detect the presence of Parkinson’s magnificently with a detection accuracy of 78.97% and precision of 0.926, under the hold-out cross validation. The collaborative feature bank on Naïve Bayes revealed distinguishable results as compared to many other recently proposed approaches. The simplicity of Naïve Bayes makes the system robust and effective throughout the detection process.

10 February 2022 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Open access
PDF file
MPMoumita Pramanik
Moumita Pramanik
RPRatika Pradhan
Ratika Pradhan
PNParvati Nandy
Parvati Nandy
AKASH KUMAR BHOIAKASH KUMAR BHOI
AKASH KUMAR BHOI
Paolo BarsocchiPaolo Barsocchi
Paolo Barsocchi
The progressive reduction of dopaminergic neurons in the human brain, especially at the substantia nigra is one of the principal causes of Parkinson’s Disease (PD). Voice alteration is one of the earliest symptoms found in PD patients. Therefore, the impaired PD subjects’ acoustic voice signal plays a crucial role in detecting the presence of Parkinson's. This manuscript presents four distinct decision tree ensemble methods of PD detection on a trailblazing ForEx++ rule-based framework. The Systematically Developed Forest (SysFor) and a Penalizing Attributes Decision Forest (ForestPA) ensemble approaches has been used for PD detection. The proposed detection schemes efficiently identify positive subjects using primary voice signal features, viz., baseline, vocal fold, and time–frequency. A novel feature selection scheme termed Feature Ranking to Feature Selection (FRFS) has also been proposed to combine filter and wrapper strategies. The proposed FRFS scheme encompasses Gel’s normality test to rank and selects outstanding features from baseline, time–frequency, and vocal fold feature groups. The SysFor and ForestPA decision forests underneath the ForEx++ rule-based framework on both FRFS feature ranking and subset selection represents Parkinson’s detection approaches, which expedite a better overall impact on segregating PD from control subjects. It has been observed that the ForestPA decision forest in the ForEx++ framework on FRFS ranked features proved to be a robust Parkinson’s detection scheme. The proposed models deliver the highest accuracy of 94.12% and a lowest mean absolute error of 0.25, resulting in an Area Under Curve (AUC) value of 0.97.

8 December 2025 in IEEE Access
Verified
Journal Article
Open access
DGDiksha Giri
Diksha Giri
RPRanjit Panigrahi
Ranjit Panigrahi
SBSamrat Bhandari
Samrat Bhandari
HSHareesh Siddaramappa
Hareesh Siddaramappa
MPMoumita Pramanik
Moumita Pramanik
AKASH KUMAR BHOIAKASH KUMAR BHOI
AKASH KUMAR BHOI
Purpose of the Study: Neurodegenerative diseases such as Parkinson’s, Alzheimer’s, and Huntington’s progressively impair motor and cognitive functions, making early detection essential for timely intervention and improved quality of life. This study introduces the Optimized Predictive Technique for Intelligent Classification (OPTIC), a novel decision tree ensemble framework, designed to enhance the accuracy and robustness of gait-based neurodegenerative disease detection. Methodology: OPTIC employs a modular ensemble architecture that partitions the feature space into subsets, trains separate decision tree modules, and integrates their outputs through collaborative feedback and dynamic weighting based on classifier complexity and performance. The model was evaluated on a publicly available gait dataset using multiple validation strategies, including holdout, stratified k-fold, and Monte Carlo cross-validation. Key Results: OPTIC consistently outperformed traditional decision trees and standard ensemble methods. Under stratified k-fold validation, it achieved 78.98% accuracy in multiclass classification, 91.48% accuracy in one-vs-rest settings, and up to 99.13% accuracy in pairwise disease-versus-control classification. Performance improvements were consistent across validation schemes, with OPTIC demonstrating superior precision and recall in all cases. Conclusions: The OPTIC framework effectively addresses limitations of conventional decision trees, such as overfitting and instability, through modular specialization and collaborative learning. Its high accuracy and robustness suggest strong potential as a reliable tool for early detection of neurodegenerative diseases, with practical applicability in clinical decision-making and patient monitoring.