Md. Nasim Adnan

According to our database1, Md. Nasim Adnan authored at least 14 papers between 2003 and 2018.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
On Improving the Prediction Accuracy of a Decision Tree Using Genetic Algorithm.
Proceedings of the Advanced Data Mining and Applications - 14th International Conference, 2018

2017
Forest PA: Constructing a decision forest by penalizing attributes used in previous trees.
Expert Syst. Appl., 2017

ForEx++: A New Framework for Knowledge Discovery from Decision Forests.
Australasian J. of Inf. Systems, 2017

Effects of Dynamic Subspacing in Random Forest.
Proceedings of the Advanced Data Mining and Applications - 13th International Conference, 2017

2016
Optimizing the number of trees in a decision forest to discover a subforest with high ensemble accuracy using a genetic algorithm.
Knowl.-Based Syst., 2016

Forest CERN: A New Decision Forest Building Technique.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016

On Improving Random Forest for Hard-to-Classify Records.
Proceedings of the Advanced Data Mining and Applications - 12th International Conference, 2016

2015
Improving the random forest algorithm by randomly varying the size of the bootstrap samples for low dimensional data sets.
Proceedings of the 23rd European Symposium on Artificial Neural Networks, 2015

One-vs-all binarization technique in the context of random forest.
Proceedings of the 23rd European Symposium on Artificial Neural Networks, 2015

Complement Random Forest.
Proceedings of the Thirteenth Australasian Data Mining Conference, 2015

2014
Improving the random forest algorithm by randomly varying the size of the bootstrap samples.
Proceedings of the 15th IEEE International Conference on Information Reuse and Integration, 2014

Extended Space Decision Tree.
Proceedings of the Machine Learning and Cybernetics, 2014

On Dynamic Selection of Subspace for Random Forest.
Proceedings of the Advanced Data Mining and Applications - 10th International Conference, 2014

2003
A new external sorting algorithm with no additional disk space.
Inf. Process. Lett., 2003


  Loading...