Research Article
Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms
Algorithm 3
B
UILDN
EWO
NTO(cohesion_matrix,
,
).
push into queue ; | while do | ; | if then | make as a subtree of rooted at ; is a sub tree of rooted at | else if then | make as a subtree of rooted at ; is a sub tree of rooted at | else | let and make a child of on ; | ; | ; | ; | if && then | push matching results of with into ; | else if then | push matching results of with into ; | else | push matching results of with into ; | end if | end if | end while | return ; |
|