Md. Nasim Adnan

dblp:120/7598 · DBLP profile ↗
← Back
15ranked-venue papers
12as first author
5since 2021 · last 2026
0000-0001-9210-2896ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 12 · 10 first-author · 4 since 2021Databases, data management, data science and information retrieval · 9 · 8 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1
YearPublicationVenuePosition
2026 LiteAugNet: A Lightweight Semantic-Guided Augmentation Network for Efficient Edge-Level Image Classification
Mohammad Shahedur Rahman, Mohammad Tahmid Bari, Md. Nasim Adnan, Arshad Parvez
ICPR (5)3
2024 Estimating the structural diversity introduced by decision forest algorithms : A probabilistic approach
abstract
Structurally diverse decision trees are important for knowledge discovery and classification/prediction accuracy. Over the years, researchers have devoted much effort to the development of algorithms to increase diversity among the trees within an ensemble. While Kappa is commonly used to measure diversity among the decision trees, it does not measure the ability of the tree building algorithms to introduce diversity. Further, Kappa does not consider the structural diversity amongst the trees. Instead, Kappa measures the diversity of the predictions made from the trees produced, and are dependent on the datasets used. This paper presents a novel data-independent metric, called R index, for measuring the diversity that can be introduced by a decision forest algorithm without building the entire decision forest. The proposed measure is applied to five well-known algorithms that involve bagging and random subspacing. An efficient practical approach for calculating the R index empirically - R finder - is also proposed, and is implemented. Both R finder and Kappa were applied to thirty-two publicly available benchmark datasets under various algorithms to estimate the resulting diversity. The results indicate a generally strong negative correlation between R finder and Kappa, implying that R finder is effective at estimating the diversity of trees without the added computational costs associated with calculating Kappa.
Ryan H. L. Ip, Michael Bewong, Md. Nasim Adnan, Md Zahidul Islam 0001
Knowl. Based Syst.3
2023 Exploration of Stochastic Selection of Splitting Attributes as a Source of Inducing Diversity
Md. Nasim Adnan
ADMA (5)1
2022 On Reducing the Bias of Random Forest
Md. Nasim Adnan
ADMA (2)1
2021 BDF: A new decision forest algorithm
Md. Nasim Adnan, Ryan H. L. Ip, Michael Bewong, Md Zahidul Islam 0001
Inf. Sci.1
2018 On Improving the Prediction Accuracy of a Decision Tree Using Genetic Algorithm
Md. Nasim Adnan, Md Zahidul Islam 0001, Md. Mostofa Akbar
ADMA1
2017 Effects of Dynamic Subspacing in Random Forest
Md. Nasim Adnan, Md Zahidul Islam 0001
ADMA1
2017 Forest PA: Constructing a decision forest by penalizing attributes used in previous trees
Md. Nasim Adnan, Md Zahidul Islam 0001
Expert Syst. Appl.1
2016 On Improving Random Forest for Hard-to-Classify Records
Md. Nasim Adnan, Md Zahidul Islam 0001
ADMA1
2016 Forest CERN: A New Decision Forest Building Technique
Md. Nasim Adnan, Md Zahidul Islam 0001
PAKDD (1)1
2016 Optimizing the number of trees in a decision forest to discover a subforest with high ensemble accuracy using a genetic algorithm
Md. Nasim Adnan, Md Zahidul Islam 0001
Knowl. Based Syst.1
2015 One-vs-all binarization technique in the context of random forest
Md. Nasim Adnan, Md Zahidul Islam 0001
ESANN1
2015 Improving the random forest algorithm by randomly varying the size of the bootstrap samples for low dimensional data sets
Md. Nasim Adnan, Md Zahidul Islam 0001
ESANN1
2014 On Dynamic Selection of Subspace for Random Forest
Md. Nasim Adnan
ADMA1
2003 A new external sorting algorithm with no additional disk space
Md. Rafiqul Islam 0002, Md. Nasim Adnan, Md. Nur Islam, Shohorab Hossen
Inf. Process. Lett.2