Partitioning a vocabulary's IS-A hierarchy into trees

نویسندگان

  • Huanying Gu
  • Yehoshua Perl
  • James Geller
  • Michael Halper
  • James J. Cimino
  • Mansnimar Singh
چکیده

Controlled medical vocabularies are useful in application areas such as medical information-systems and decision-support. However, such vocabularies are large and complex, and working with them can be daunting. It is important to provide a means for orienting users to the vocabulary's contents. This paper introduces a methodology for partitioning a vocabulary into small, meaningful pieces. The partitioning is done with respect to the vocabulary's IS-A hierarchy. The methodology, based on a set of rules for refining the IS-A hierarchy, is a process carried out by a user in conjunction with the computer. The methodology is demonstrated on a complex portion of a vocabulary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A methodology for partitioning a vocabulary hierarchy into trees

Controlled medical vocabularies are useful in application areas such as medical information systems and decision-support systems. However, such vocabularies are large and complex, and working with them can be daunting. It is important to provide a means for orienting vocabulary designers and users to the vocabulary's contents. We describe a methodology for partitioning a vocabulary based on an ...

متن کامل

Using Convex Differences in Hierarchical Representations of Polygonal Maps

We discuss adaptive. hierarchical. spatial subdivisions of planar polygonal maps. These maps are extensively used in cartography. GIS. computer graphics and computer vision. Our results are applicable to many subdivision schemes. including quad trees. k-d trees. and binary space partitioning (ESP). We focus on cell splitting rules and leaf organization methods. introducing and comparing three o...

متن کامل

Faster Algorithms for Rigidity in the Plane

In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G = (V,E) with n vertices it runs in O(n) time assuming that a partition of G + e, e ∈ E into two spanning trees is given. We show that a simple modification reduces the running time to O(n log n). The total running time can be reduced O(n √ n log...

متن کامل

Wavelet Compression of ECG Signals by the Set Partitioning in Hierarchical Trees (SPIHT) Algorithm

A wavelet ECG data codec based on the Set Partitioning In Hierarchical Trees (SPIHT) compression algorithm is proposed in this paper. The SPIHT algorithm [1] has achieved notable success in still image coding. We modified the algorithm for the one-dimensional (1-D) case and applied it to compression of ECG data. Experiments on selected records from the MIT-BIH arrhythmia database revealed that ...

متن کامل

Identifying a Forest Hierarchy in an OODB Specification Hierarchy Satisfying Disciplined Modeling

Our work is motivated by the desire to develop methods to comprehend large vocabularies and large schemas of Object-Oriented Databases. The ability of a user of a database participating in a federated system to retrieve information from the other database systems will be greatly enhanced by acquiring a better comprehension of these systems. We are trying to develop both a theoretical paradigm a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings : a conference of the American Medical Informatics Association. AMIA Fall Symposium

دوره   شماره 

صفحات  -

تاریخ انتشار 1997