The Simplified Multielement Least Upper Bounds Algorithm Research
Jun Li · Computer Knowledge and Technology · 2009
For the approximate concept is similar to the query key issues, it's quality decision the approximate inquiries quality. Based on the existing concept of the smallest upper and lower bound of the largest approximate inquiries, only consider the concept of heterogeneous ontology contains between one-to-one relationship, it is impossible to approximate the best concept, Approximate sometimes the quality is unacceptable. First on the approximate minimum conversion to a pluralistic community, among the smallest on the border issue then the least upper bound into the smallest multi-SR on the question of research. This kind of concept for the smallest on the approximate indirect conversion for the sake of the most simple concept of pluralism on the smallest sector, can greatly enhance the smallest on the approximate quality and raise similar inquiries precision and recall rates.