Article ID Journal Published Year Pages File Type
10355618 Journal of Biomedical Informatics 2012 13 Pages PDF
Abstract
► We describe an autocompletion algorithm for snomed ct medical on-tology. ► Our user study proves it saves significantly more keystrokes than baseline algorithm. ► We explain keystrokes savings by pointing at entropy patterns in terms in snomed ct. ► Computationally, computing the shortest successful query for this algorithm is NP-hard.
Related Topics
Physical Sciences and Engineering Computer Science Computer Science Applications
Authors
, , ,