Shahid Hussain

Orcid: 0000-0002-1698-2809

Affiliations:
  • King Abdullah University of Science and Technology, Computer, Electrical and Mathematical Sciences and Engineering Division, Thuwal, Saudi Arabia


According to our database1, Shahid Hussain authored at least 30 papers between 2011 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting.
CoRR, 2022

Greedy Algorithms for Decision Trees with Hypotheses.
CoRR, 2022

2021
Decision Rules Derived from Optimal Decision Trees with Hypotheses.
Entropy, 2021

Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses.
Entropy, 2021

Minimizing Depth of Decision Trees with Hypotheses.
Proceedings of the Rough Sets - International Joint Conference, 2021

Minimizing Number of Nodes in Decision Trees with Hypotheses.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES-2021, 2021

Sorting by Decision Trees with Hypotheses (extended abstract).
Proceedings of the 29th International Workshop on Concurrency, 2021

2019
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Intelligent Systems Reference Library 146, Springer, ISBN: 978-3-319-91838-9, 2019

2018
Bi-criteria optimization of decision trees with applications to data analysis.
Eur. J. Oper. Res., 2018

Upper Domination: Towards a Dichotomy Through Boundary Properties.
Algorithmica, 2018

2016
Totally optimal decision trees for Boolean functions.
Discret. Appl. Math., 2016

A Boundary Property for Upper Domination.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015
Diagnosis of constant faults in read-once contact networks over finite bases.
Discret. Appl. Math., 2015

Multi-pruning of decision trees for knowledge representation and classification.
Proceedings of the 3rd IAPR Asian Conference on Pattern Recognition, 2015

2014
Relationships Among Various Parameters for Decision Tree Optimization.
Proceedings of the Innovations in Intelligent Machines-4, 2014

Relationships between Average Depth and Number of Misclassifications for Decision Trees.
Fundam. Informaticae, 2014

Diagnosis of constant faults in iteration-free circuits over monotone basis.
Discret. Appl. Math., 2014

Total Path Length and Number of Terminal Nodes for Decision Trees.
Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

Greedy heuristics for minimization of number of terminal nodes in decision trees.
Proceedings of the 2014 IEEE International Conference on Granular Computing, 2014

A Dichotomy for Upper Domination in Monogenic Classes.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Relationships for Cost and Uncertainty of Decision Trees.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Optimization and analysis of decision trees and rules: dynamic programming approach.
Int. J. Gen. Syst., 2013

Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables.
Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

2012
Relationships between Number of Nodes and Number of Misclassifications for Decision Trees.
Proceedings of the Rough Sets and Current Trends in Computing, 2012

On Cost and Uncertainty of Decision Trees.
Proceedings of the Rough Sets and Current Trends in Computing, 2012

Average Depth and Number of Misclassifications for Decision Trees.
Proceedings of the 21th International Workshop on Concurrency, 2012

2011
Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions.
Proceedings of the International Conference on Computational Science, 2011

Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Relationships between Depth and Number of Misclassifications for Decision Trees.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Sequential Optimization of Binary Search Trees for Multiple Cost Functions.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011


  Loading...