Abstract
Ontology-based information system can increase the precise and recall of information retrieval and filtering on the Web but faces the problem of Ontology heterogeneity. The approximate information filtering approach rewrites queries with their approximations to suit specific ontology-based information sources. The core of the approach is to find approximations of concepts. The current methods find least upper bounds and greatest lower bounds of a concept and then use them to get upper and lower approximations of the concept. However, they consider the bounds only containing separate concepts, so the quality of approximations is not very acceptable. This paper defines multielement least upper bounds and multielement greatest lower bounds that contain not only separate concepts but also disjunctions or conjunctions of concepts. It can be proved that the approximations based on them can be better approximations of concepts than the current methods.
This work was supported in part by the NSFC (60373066, 60303024), National Grand Fundamental Research 973 Program of China (2002CB312000), and National Research Foundation for the Doctoral Program of Higher Education of China (20020286004).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Shah, U., Finin, T., Joshi, A., Cost, R.S., Mayfield, J.: Information Retrieval on the Semantic Web. In: The 10th International Conference on Information and Knowledge Management, pp. 461–468. ACM Press, McLean (2002)
Tzitzikas, Y.: Collaborative Ontology-based Information Indexing and retrieval. Doctoral Dissertation, Heraklion (2002)
Visser, P.R.S., Jones, D.M., Bench-Capon, T.J.M., Shave, M.J.R.: An analysis of ontological mismatches: Heterogeneity versus interoperability. In: AAAI 1997 Spring Symposium on Ontological Engineering, Stanford, USA (1997)
Wache, H., Vogele, T., Visser, U., et al.: Ontology-based integration of information—a survey of existing approaches. In: IJCAI Workshop on Ontologies and Information Sharing, pp. 108–117. AAAI Press, California (2001)
Stuckenschmidt, H.: Approximate information filtering with multiple classification hierarchies. International Journal of Computational Intelligence and Applications 2(3), 295–302 (2002)
Akahani, J., Hiramatsu, K., Satoh, T.: Approximate Query Reformulation based on Hierarchical Ontology Mapping. In: International Workshop on Semantic Web Foundations and Application Technologies, SWFAT 2003 (2003)
Stuckenschmidt, H.: Ontology-Based Information Sharing in Weakly Structured Environments. PhD thesis, AI Department, Vrije Universiteit Amsterdam (2002)
Goasdoué, F., Rousset, M.C.: Answering Queries using Views: a KRDB Perspective for the Semantic Web. ACM Transactions on Internet Technology 4(3), 255–288 (2004)
Chang, C., Garcia-Molina, H.: Approximate query mapping: Accounting for translation closeness. The VLDB Journal 10(2-3), 155–181 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, J., Xu, B., Kang, D., Li, Y., Wang, P. (2005). Approximations of Concept Based on Multielement Bounds. In: Andersen, K.V., Debenham, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2005. Lecture Notes in Computer Science, vol 3588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546924_66
Download citation
DOI: https://doi.org/10.1007/11546924_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28566-3
Online ISBN: 978-3-540-31729-6
eBook Packages: Computer ScienceComputer Science (R0)