Guangming Xing
ABSTRACT
With the wide adaption of EMR systems in healthcare, patient questionnaires become more relevant for data collection like pre-visit notes. In this paper, we introduce questionnaire directed acyclic graph(QDAG) to model a questionnaire. Based on QDAG, we studied optimizing the sequence of questions to be presented to the patient to reduce the number of needed answers by using greedy topological sorting. Our solution not only reduces the time needed to complete a questionnaire, but also may lead to results with better quality by reducing user fatigues. Experimental studies on synthesized data set indicated a 15% reduction on the numbers of answers needed.
- Hornberger, J., Thom, D., & MaCurdy, T. (1997). Effects of a Self-Administered Previsit Questionnaire to Enhance Awareness of Patients' Concerns in Primary Care. Journal of General Internal Medicine, 12(10), 597--606.Google Scholar
Cross Ref
- http://blog.himss.org/2014/02/12/electronic-pre-visit-questionnaires-improve-workflow-and-encourage-engagement/Google Scholar
- Hickson Ryan, Talbert Jeffery, Thornbury William C., Perin Nathan R., and Goodin Amie J.. Online Medical Care: The Current State of eVisits in Acute Primary Care Delivery, Telemedicine and e-Health. February 2015, 21(2): 90--96. doi:10.1089/tmj.2014.0022.Google Scholar
- Greenberg, H., Morgenstern, M., MacSaveny, A., Batemarco, T., Mungroo, K. A., Del Olmo, M., & Schottenfeld, R. (2014). SNORE: A Branching Logic, Computerized Sleep Disorder Screening Tool. Chest, 146(4), 961A-961A.Google Scholar
Index Terms
- Greedy topological sorting on questionnaire directed acyclic graph and its application in patient surveys
Recommendations
Topological orderings of weighted directed acyclic graphs
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological orderings of ...
The nucleolus of arborescence games in directed acyclic graphs
In this paper, we consider the problem of finding the nucleolus of arborescence games. We prove that the nucleolus of arborescence games in directed acyclic graphs can be found in linear time.
A framework for the greedy algorithm
Perhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A natural question is for which optimization problems does the greedy algorithm produce an optimal solution? In a sense this question is answered by a classical ...
Comments