2017
DOI: 10.1093/jamia/ocw175
|View full text |Cite
|
Sign up to set email alerts
|

Mining non-lattice subgraphs for detecting missing hierarchical relations and concepts in SNOMED CT

Abstract: Objective: Quality assurance of large ontological systems such as SNOMED CT is an indispensable part of the terminology management lifecycle. We introduce a hybrid structural-lexical method for scalable and systematic discovery of missing hierarchical relations and concepts in SNOMED CT. Material and Methods: All non-lattice subgraphs (the structural part) in SNOMED CT are exhaustively extracted using a scalable MapReduce algorithm. Four lexical patterns (the lexical part) are identified among the extracted no… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
42
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 43 publications
(42 citation statements)
references
References 21 publications
0
42
0
Order By: Relevance
“…Hybrid techniques hold promise for better performance. For example, Cui et al 126 combined the structural technique of nonlattice with the natural language processing technique. Others combine structural and lexical techniques.…”
Section: Discussionmentioning
confidence: 99%
“…Hybrid techniques hold promise for better performance. For example, Cui et al 126 combined the structural technique of nonlattice with the natural language processing technique. Others combine structural and lexical techniques.…”
Section: Discussionmentioning
confidence: 99%
“…DCM, for example, takes co-occurrence patterns as suggestive complex matches, where a large-sized data is required for mining such patterns. Additionally, complex mappings combing multiple classes and properties across ontologies may indicate the absence of a class representing that complex semantic meaning within ontology, thus can be used for quality assurance of large, real-world biomedical ontologies [ 43 ].…”
Section: Discussionmentioning
confidence: 99%
“…A lattice is a specific type of DAG such that any two nodes (or concepts) have a unique maximal shared descendant and a unique minimal shared ancestor. A pair of concepts is called a non-lattice pair , if the two concepts have more than one maximal shared common descendant [13, 14, 15]. For example, in Fig.…”
Section: Introductionmentioning
confidence: 99%
“…1), separately analyzing each such non-lattice pair would be redundant. Therefore, a notion of non-lattice subgraph is further introduced to avoid redundant analysis [15]. Given a non-lattice pair p = ( c 1 , c 2 ) and its maximal common descendants mcd ( p ), the corresponding non-lattice subgraph can be obtained by first computing the minimal common ancestors of the maximal common descendants, mca ( mcd ( p )); then aggregating the concepts and the IS-A edges between (including) any concept in mca ( mcd ( p )) and any concept in mcd ( p ).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation