Comparing and consolidating two heuristic metaschemas

Citations of this article
Mendeley users who have this article in their library.


A metaschema is an Abstraction Network of the UMLS's Semantic Network (SN) obtained from a connected partition into its collections of semantic types. A metaschema can support comprehension, visualization and navigation of the SN. In this paper, a methodology is presented to evaluate and compare two given metaschemas, based on their structural properties. This methodology was applied to the top-down metaschema and the bottom-up metaschema, derived from two studies involving two groups of UMLS experts. By the Cronbach alpha estimate, the bottom-up metaschema is reliable, while the top-down metaschema is not. An algorithm was designed to yield a consolidated metaschema enjoying the best and avoiding the worst of the two given metaschemas. The consolidation algorithm was applied to the above two metaschemas, The resulting consolidated metaschema has better structural properties than either of the two metaschemas and better supports user orientation visualization, and navigation of the Semantic Network. © 2007 Elsevier Inc. All rights reserved.




Chen, Y., Perl, Y., Geller, J., Hripcsak, G., & Zhang, L. (2008). Comparing and consolidating two heuristic metaschemas. Journal of Biomedical Informatics, 41(2), 293–317.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free