default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZardad Khan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Amjad Ali
, Zardad Khan, Dost Muhammad Khan, Saeed Aldahmani:
An Optimal Random Projection k Nearest Neighbors Ensemble via Extended Neighborhood Rule for Binary Classification. IEEE Access 12: 61401-61409 (2024)- [i6]Zardad Khan, Amjad Ali, Saeed Aldahmani:
Feature Selection via Robust Weighted Score for High Dimensional Binary Class-Imbalanced Gene Expression Data. CoRR abs/2401.12667 (2024) - 2023
- [j15]Amjad Ali, Muhammad Hamraz, Naz Gul, Dost Muhammad Khan, Saeed Aldahmani, Zardad Khan:
A k nearest neighbour ensemble via extended neighbourhood rule and feature subsets. Pattern Recognit. 142: 109641 (2023) - [i5]Amjad Ali, Muhammad Hamraz, Dost Muhammad Khan, Wajdan Deebani, Zardad Khan:
A Random Projection k Nearest Neighbours Ensemble for Classification via Extended Neighbourhood Rule. CoRR abs/2303.12210 (2023) - 2022
- [j14]Neelam Younas, Amjad Ali, Hafsa Hina, Muhammad Hamraz, Zardad Khan, Saeed Aldahmani:
Optimal Causal Decision Trees Ensemble for Improved Prediction and Causal Inference. IEEE Access 10: 13000-13011 (2022) - [j13]Muhammad Hamraz, Zardad Khan, Dost Muhammad Khan, Naz Gul, Amjad Ali, Saeed Aldahmani:
Gene Selection in Binary Classification Problems Within Functional Genomics Experiments via Robust Fisher Score. IEEE Access 10: 51682-51692 (2022) - [j12]Naz Gul, Muhammad Aamir, Saeed Aldahmani, Zardad Khan:
A Weighted k-Nearest Neighbours Ensemble With Added Accuracy and Diversity. IEEE Access 10: 125920-125929 (2022) - [j11]Abdul Wahid, Dost Muhammad Khan, Ijaz Hussain, Sajjad Ahmad Khan, Zardad Khan:
Unsupervised feature selection with robust data reconstruction (UFS-RDR) and outlier detection. Expert Syst. Appl. 201: 117008 (2022) - [j10]Ishfaq Ali, Atiq Ur Rehman, Dost Muhammad Khan, Zardad Khan, Muhammad Shafiq, Jin-Ghoo Choi:
Model Selection Using K-Means Clustering Algorithm for the Symmetrical Segmentation of Remote Sensing Datasets. Symmetry 14(6): 1149 (2022) - [i4]Amjad Ali, Muhammad Hamraz, Naz Gul, Dost Muhammad Khan, Zardad Khan, Saeed Aldahmani:
A k nearest neighbours classifiers ensemble based on extended neighbourhood rule and features subsets. CoRR abs/2205.15111 (2022) - [i3]Amjad Ali, Muhammad Hamraz, Dost Muhammad Khan, Saeed Aldahmani, Zardad Khan:
An Optimal k Nearest Neighbours Ensemble for Classification Based on Extended Neighbourhood Rule with Features subspace. CoRR abs/2211.11278 (2022) - 2021
- [j9]Zardad Khan, Naz Gul, Nosheen Faiz, Asma Gul, Werner Adler, Berthold Lausen:
Optimal Trees Selection for Classification via Out-of-Bag Assessment and Sub-Bagging. IEEE Access 9: 28591-28607 (2021) - [j8]Muhammad Hamraz, Naz Gul, Mushtaq Raza, Dost Muhammad Khan, Umair Khalil, Seema Zubair, Zardad Khan:
Robust proportional overlapping analysis for feature selection in binary classification within functional genomic experiments. PeerJ Comput. Sci. 7: e562 (2021) - [j7]Muhammad Naeem, Jian Yu, Muhammad Aamir, Sajjad Ahmad Khan, Olayinka Adeleye, Zardad Khan:
Comparative analysis of machine learning approaches to analyze and predict the COVID-19 outbreak. PeerJ Comput. Sci. 7: e746 (2021) - [i2]Muhammad Naeem, Jian Yu, Muhammad Aamir, Sajjad Ahmad Khan, Olayinka Adeleye, Zardad Khan:
Comparative Analysis of Machine Learning Approaches to Analyze and Predict the Covid-19 Outbreak. CoRR abs/2102.05960 (2021) - 2020
- [j6]Amjad Ali, Muhammad Hamraz, Poom Kumam, Dost Muhammad Khan, Umair Khalil, Muhammad Sulaiman, Zardad Khan:
A k-Nearest Neighbours Based Ensemble via Optimal Model Selection for Regression. IEEE Access 8: 132095-132105 (2020) - [j5]Zardad Khan, Asma Gul, Aris Perperoglou, Miftahuddin Miftahuddin, Osama Mahmoud, Werner Adler, Berthold Lausen:
Ensemble of optimal trees, random forest and random projection ensemble classification. Adv. Data Anal. Classif. 14(1): 97-116 (2020) - [i1]Zardad Khan, Naz Gul, Nosheen Faiz, Asma Gul, Werner Adler, Berthold Lausen:
Optimal trees selection for classification via out-of-bag assessment and sub-bagging. CoRR abs/2012.15301 (2020)
2010 – 2019
- 2019
- [j4]Zardad Khan, Muhammad Naeem, Umair Khalil, Dost Muhammad Khan, Saeed Aldahmani, Muhammad Hamraz:
Feature Selection for Binary Classification Within Functional Genomics Experiments via Interquartile Range and Clustering. IEEE Access 7: 78159-78169 (2019) - [j3]Dost Muhammad Khan, Anum Yaqoob, Nadeem Iqbal, Abdul Wahid, Umair Khalil, Mukhtaj Khan, Mohd Amiruddin Abd Rahman, Mohd Shafie Mustafa, Zardad Khan:
Variable Selection via SCAD-Penalized Quantile Regression for High-Dimensional Count Data. IEEE Access 7: 153205-153216 (2019) - 2018
- [j2]Asma Gul, Aris Perperoglou, Zardad Khan, Osama Mahmoud, Miftahuddin Miftahuddin, Werner Adler, Berthold Lausen:
Ensemble of a subset of kNN classifiers. Adv. Data Anal. Classif. 12(4): 827-840 (2018) - 2014
- [j1]Osama Mahmoud, Andrew Harrison, Aris Perperoglou, Asma Gul, Zardad Khan, Metodi V. Metodiev, Berthold Lausen:
A feature selection method for classification within functional genomics experiments based on the proportional overlapping score. BMC Bioinform. 15: 274 (2014) - [c3]Osama Mahmoud, Andrew Harrison, Asma Gul, Zardad Khan, Metodi V. Metodiev, Berthold Lausen:
Minimizing Redundancy Among Genes Selected Based on the Overlapping Analysis. ECDA 2014: 275-285 - [c2]Zardad Khan, Asma Gul, Osama Mahmoud, Miftahuddin Miftahuddin, Aris Perperoglou, Werner Adler, Berthold Lausen:
An Ensemble of Optimal Trees for Class Membership Probability Estimation. ECDA 2014: 395-409 - [c1]Asma Gul, Zardad Khan, Aris Perperoglou, Osama Mahmoud, Miftahuddin Miftahuddin, Werner Adler, Berthold Lausen:
Ensemble of Subset of k-Nearest Neighbours Models for Class Membership Probability Estimation. ECDA 2014: 411-421
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-11-11 21:31 CET 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:
