default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhuqi Miao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Yajun Lu
, Thanh Duong, Zhuqi Miao, Thanh Thieu, Jivan Lamichhane, Abdulaziz Ahmed, Dursun Delen:
A novel hyperparameter search approach for accuracy and simplicity in disease prediction risk scoring. J. Am. Medical Informatics Assoc. 31(8): 1763-1773 (2024)- 2023
- [j7]Zhuqi Miao, Meghan D. Sealey, Shrie Raam Sathyanarayanan, Dursun Delen, Lan Zhu, Scott Shepherd:
A data preparation framework for cleaning electronic health records and assessing cleaning outcomes for secondary analysis. Inf. Syst. 111: 102130 (2023) - [j6]Yajun Lu, Zhuqi Miao, Parisa Sahraeian, Balabhaskar Balasundaram:
On atomic cliques in temporal graphs. Optim. Lett. 17(4): 813-828 (2023) - [i1]Tuan-Dung Le, Zhuqi Miao, Samuel Alvarado, Brittany Smith, William Paiva, Thanh Thieu:
Leveraging deep active learning to identify low-resource mobility functioning information in public clinical notes. CoRR abs/2311.15946 (2023) - 2021
- [j5]Yajun Lu, Suhao Chen, Zhuqi Miao, Dursun Delen, Andrew Gin:
Clustering temporal disease networks to assist clinical decision support systems in visual analytics of comorbidity progression. Decis. Support Syst. 148: 113583 (2021) - [c2]Suhao Chen, Tuan-Dung Le, Thanh Thieu, Zhuqi Miao, Phuong D. Nguyen, Andrew Gin:
Computer-assisted medical billing information extraction: comparing rule-based and end-to-end transfer learning approaches. CHASE 2021: 132-133 - 2020
- [j4]Zhuqi Miao, Balabhaskar Balasundaram:
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph. INFORMS J. Comput. 32(3): 763-778 (2020)
2010 – 2019
- 2017
- [j3]Zhuqi Miao, Balabhaskar Balasundaram:
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection. Networks 69(4): 388-407 (2017) - 2014
- [j2]Foad Mahdavi Pajouh, Zhuqi Miao, Balabhaskar Balasundaram:
A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Res. 216(1): 145-161 (2014) - [j1]Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao:
An exact algorithm for the maximum probabilistic clique problem. J. Comb. Optim. 28(1): 105-120 (2014) - 2010
- [c1]Zhuqi Miao, Zhou-Jing Wang, Weiyao Lan:
Reliability evaluation of mine ventilation systems based on multi-state system theory. ICCA 2010: 1092-1097
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:20 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:
