default search action
Md. Nasim Adnan
Person information
- affiliation: Bangladesh Bank, Head Office, Dhaka, Bangladesh
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Ryan H. L. Ip
, Michael Bewong
Estimating the structural diversity introduced by decision forest algorithms : A probabilistic approach. Knowl. Based Syst. 286: 111435 (2024) - 2023
- [j8]Prothama Sardar, Romana Rahman Ema, Sk. Shalauddin Kabir, Md. Nasim Adnan, Syed Md. Galib:
Severity Stage Identification and Pest Detection of Tomato Disease Using Deep Learning. Int. J. Comput. 22(2): 191-201 (2023) - [c13]Md. Nasim Adnan:
Exploration of Stochastic Selection of Splitting Attributes as a Source of Inducing Diversity. ADMA (5) 2023: 237-249 - [c12]Md Apu Hosen
An Innovative Two-way Recommender System for Students and Teachers. ICCCNT 2023: 1-5 - 2022
- [j7]Mustain Billah, Md. Nasim Adnan
Rainfall prediction system for Bangladesh using long short-term memory. Open Comput. Sci. 12(1): 323-331 (2022) - [c11]Md. Nasim Adnan
On Reducing the Bias of Random Forest. ADMA (2) 2022: 187-195 - [i2]Mustain Billah, Md. Mynoddin, Mostafijur Rahman Akhond, Md. Nasim Adnan, Syed Md. Galib, Rizwanur Rahad, M. Nurujjaman Khan:
A Systematic Study and Analysis of Bengali Folklore with Natural Language Processing Systems. CoRR abs/2203.06607 (2022) - 2021
- [j6]Md. Nasim Adnan
BDF: A new decision forest algorithm. Inf. Sci. 569: 687-705 (2021) - 2020
- [j5]Abu Sadat Mohammed Yasin
Localization of Autonomous Robot in an Urban Area Based on SURF Feature Extraction of Images. Int. J. Technol. Diffusion 11(4): 18-45 (2020)
2010 – 2019
- 2018
- [c10]Md. Nasim Adnan
On Improving the Prediction Accuracy of a Decision Tree Using Genetic Algorithm. ADMA 2018: 80-94 - 2017
- [j4]Md. Nasim Adnan, Md Zahidul Islam:
ForEx++: A New Framework for Knowledge Discovery from Decision Forests. Australas. J. Inf. Syst. 21 (2017) - [j3]Md. Nasim Adnan
Forest PA: Constructing a decision forest by penalizing attributes used in previous trees. Expert Syst. Appl. 89: 389-403 (2017) - [c9]Md. Nasim Adnan
Effects of Dynamic Subspacing in Random Forest. ADMA 2017: 303-312 - 2016
- [j2]Md. Nasim Adnan
Optimizing the number of trees in a decision forest to discover a subforest with high ensemble accuracy using a genetic algorithm. Knowl. Based Syst. 110: 86-97 (2016) - [c8]Md. Nasim Adnan, Md Zahidul Islam
On Improving Random Forest for Hard-to-Classify Records. ADMA 2016: 558-566 - [c7]Md. Nasim Adnan
Forest CERN: A New Decision Forest Building Technique. PAKDD (1) 2016: 304-315 - 2015
- [c6]Md. Nasim Adnan, Md Zahidul Islam:
Complement Random Forest. AusDM 2015: 89-97 - [c5]Md. Nasim Adnan, Md Zahidul Islam:
One-vs-all binarization technique in the context of random forest. ESANN 2015 - [c4]Md. Nasim Adnan, Md Zahidul Islam:
Improving the random forest algorithm by randomly varying the size of the bootstrap samples for low dimensional data sets. ESANN 2015 - 2014
- [c3]Md. Nasim Adnan:
On Dynamic Selection of Subspace for Random Forest. ADMA 2014: 370-379 - [c2]Md. Nasim Adnan, Md Zahidul Islam
Extended Space Decision Tree. ICMLC (CCIS volume) 2014: 219-230 - [c1]Md. Nasim Adnan:
Improving the random forest algorithm by randomly varying the size of the bootstrap samples. IRI 2014: 303-308 - 2012
- [i1]Ahmed Mehedi Nizam, Md. Nasim Adnan, Md. Rashedul Islam, Mohammad Akbar Kabir:
Properties of Stochastic Kronecker Graph. CoRR abs/1210.1300 (2012)
2000 – 2009
- 2003
- [j1]Md. Rafiqul Islam, Md. Nasim Adnan, Md. Nur Islam, Shohorab Hossen:
A new external sorting algorithm with no additional disk space. Inf. Process. Lett. 86(5): 229-233 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: