Comparing and consolidating two heuristic metaschemas

  • Authors:
  • Yan Chen;Yehoshua Perl;James Geller;George Hripcsak;Li Zhang

  • Affiliations:
  • New Jersey Institute of Technology, Newark, NJ 07102, USA and Computer Information Systems Department, Borough of Manhattan Community College, CUNY, New York, NY 10007, USA;New Jersey Institute of Technology, Newark, NJ 07102, USA;New Jersey Institute of Technology, Newark, NJ 07102, USA;Department of Medical Informatics, Columbia University, New York, NY 10032, USA;Business and Computer Science Department, College of The Sequoias, Visalia, CA 93277, USA

  • Venue:
  • Journal of Biomedical Informatics
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.