default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuhammad Umar Chaudhry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Hassaan Malik
, Tayyaba Anees, Muhammad Umar Chaudhry, Radomír Gono, Michal Jasiñski, Zbigniew Leonowicz, Petr Bernat:
A Novel Fusion Model of Hand-Crafted Features With Deep Convolutional Neural Networks for Classification of Several Chest Diseases Using X-Ray Images. IEEE Access 11: 39243-39268 (2023)- [j7]Hassaan Malik, Tayyaba Anees, Muhammad Faheem, Muhammad Umar Chaudhry, Aatka Ali, Muhammad Nabeel Asghar:
Blockchain and Internet of Things in smart cities and drug supply management: Open issues, opportunities, and future directions. Internet Things 23: 100860 (2023) - 2022
- [j6]Muhammad Yasir, Ali Haidar, Muhammad Umar Chaudhry, Muhammad Asif Habib, Aamir Hussain, Elzbieta Jasinska, Zbigniew Leonowicz, Michal Jasiñski:
Performing in-situ analytics: Mining frequent patterns from big IoT data at network edge with D-HARPP. Eng. Appl. Artif. Intell. 116: 105480 (2022) - 2020
- [j5]Muhammad Yasir, Muhammad Asif Habib, Muhammad Ashraf, Shahzad Sarwar, Muhammad Umar Chaudhry, Hamayoun Shahwani, Mudassar Ahmad, Chaudhry Muhammad Nadeem Faisal:
D-GENE: Deferring the GENEration of Power Sets for Discovering Frequent Itemsets in Sparse Big Data. IEEE Access 8: 27375-27392 (2020) - [j4]Muhammad Umar Chaudhry, Muhammad Yasir, Muhammad Nabeel Asghar, Jee-Hyong Lee:
Monte Carlo Tree Search-Based Recursive Algorithm for Feature Selection in High-Dimensional Datasets. Entropy 22(10): 1093 (2020)
2010 – 2019
- 2019
- [j3]Muhammad Yasir, Muhammad Asif Habib, Muhammad Ashraf, Shahzad Sarwar, Muhammad Umar Chaudhry, Hamayoun Shahwani, Mudassar Ahmad, Chaudhry Muhammad Nadeem Faisal:
TRICE: Mining Frequent Itemsets by Iterative TRimmed Transaction LattICE in Sparse Big Data. IEEE Access 7: 181688-181705 (2019) - 2018
- [j2]Muhammad Umar Chaudhry, Jee-Hyong Lee:
Feature Selection for High Dimensional Data Using Monte Carlo Tree Search. IEEE Access 6: 76036-76048 (2018) - [j1]Muhammad Umar Chaudhry, Jee-Hyong Lee:
MOTiFS: Monte Carlo Tree Search Based Feature Selection. Entropy 20(5): 385 (2018) - 2017
- [c2]Muhammad Umar Chaudhry, Sang-Wook Kim, Jee-Hyong Lee:
An Effective Feature Selection method using Monte Carlo Search. RACS 2017: 44-45 - 2016
- [c1]Jamshaid Iqbal Janjua, Aatka Ali, Muhammad Umar Chaudhry:
OPENTCQ: Towards Change Management in Hybrid Agile Model. ICCCNT 2016: 38:1-38:8
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-04-25 05:50 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:
