Patent ID: 9104755
Filing Date: 2015-08-11
Classification: G06F

Abstract:
1. An ontology enhancement method, comprising: step A: receiving at least an input information request; step B: based on a base ontology, expanding each input information request to produce at least an expanded information request of each corresponding input information request; step C: based on a searching model, according to each expanded information request, searching a file collection to obtain searching results of each corresponding expanded information request; step D: according to each searching result, extracting a plurality of candidate knowledge concepts of each corresponding searching result; and step E: selectively adding the candidate knowledge concepts of each searching result into the base ontology to enhance the base ontology, wherein the base ontology being enhanced is denoted as an enhanced ontology; wherein the step E comprises: step E1: selecting a lowest non-selected one from the expanding information requests; step E2: selecting an i step E3: checking whether the selected candidate knowledge concept has been added in the base ontology; step E4: if the selected candidate knowledge concept has not been added in the base ontology, checking whether the selected candidate knowledge concept is the same as the i step E5: if the selected candidate knowledge concept is not the same as the i step E6: if the selected candidate knowledge concept is the same as the i step E7: if the rank of the selected candidate knowledge concept in its father node's expanding information request is larger than the rank of the other same candidate knowledge concept in its father node's expanding information request, adding the selected candidate knowledge concept into the base ontology, and increasing i by 1; step E8: if the selected candidate knowledge concept has been added in the base ontology, increasing i by 1; step E9: checking whether i is larger than K, wherein K is a number which the candidate knowledge concepts of the selected expanding information request are in top ranks; step E10: if i is not larger than K, going back to execute the step E2; step E11: if i is larger than K, going back to execute step E2, checking whether any non-selected expanding information request exists; step E12: if at least one non-selected expanding information request exists, going back to execute the step E1; and step E13: if all of the expanding information requests have been selected, ending the step E.