Semantic Similarity Based Ontology Cache
This paper addresses the issue of ontology caching on semantic web. The Semantic Web is an extension of the current web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. Ontology serves as the metadata for defining the information on semantic web. Ontology based semantic information retrieval (semantic retrieval) is becoming more and more important. Many research and industrial works have been made so far on semantic retrieval. Ontology based retrieval improves the performance of search engine and web mining. In semantic retrieval, a great number of accesses to ontologies usually lead the ontology servers to be very low efficient. To address this problem, it is indeed necessary to cache concepts and instances when ontology server is running. Existing caching methods from database community can be used in the ontology cache. However, they are not sufficient for dealing with the problem. In the task of caching in database, usually the most frequently accessed data are cached and the recently less frequently accessed data in the cache are removed from it. Different from that, in ontology base, data are organized as objects and relations between objects. User may request one object, and then request another object according to a relation of that object. He may also possibly request a similar object that has not any relations to the object. Ontology caching should consider more factors and is more difficult. In this paper, ontology caching is formalized as a problem of classification. In this way, ontology caching becomes independent from any specific semantic web application. An approach is proposed by using machine learning methods. When an object (e.g. concept or instance) is requested, we view its similar objects as candidates. A classification model is then used to predict whether each of these candidates should be cached or not. Features in classification models are defined. Experimental results indicate that the proposed methods can significantly outperform the baseline methods for ontology caching. The proposed method has been applied to a research project that is called SWARMS.
KeywordsSemantic Similarity Data Cache Ontology Server Semantic Retrieval Ontology Base
Unable to display preview. Download preview PDF.
- 1.Berners-Lee, T., Fischetti, M., Dertouzos, M.L.: Weaving the Web: The Original Design and Ultimate Destiny of the World Wide Web. Harper San Francisco (1999)Google Scholar
- 2.Calvo, F., Gennari, J.H.: Interoperability of Protege 2.0 beta and OilEd 3.5 in the Domain Knowledge of Osteoporosis. In: EON 2003 (2003)Google Scholar
- 3.Carroll, J.J.: Unparsing RDF/XML. In: Proceedings of the 11th international conference on World Wide Web (2002)Google Scholar
- 6.Davidson, J.: Natural language access to databases: user modeling and focus. In: Proceedings of the CSCSI/SCEIO Conference, Saskatoon, Canada (May 1982)Google Scholar
- 7.Hanson, E.N., Chaabouni, M., Kim, C.H., Wang, Y.W.: A predicate matching algorithm for database rule systems. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ (May 1990)Google Scholar
- 8.Marcel, K., Kai-Uwe, S., Ingolf, G., Hagen, H.: Semantic Caching in Ontology-based Mediator Systems. In: Proc. of Berliner XML Tage, pp. 155–169 (2003)Google Scholar
- 9.Dar, S., Franklin, M.J., Jónsson, B.T., Srivastava, D., Tan, M.: Semantic Data Caching and Replacement. In: proceeding of 22th Int. Conf. on Very Large Data Bases (VLDB 1996), pp. 330–341 (September 1996)Google Scholar
- 10.Zhu, J.: Non-classical Mathematics for Intelligent Systems. HUST Press (2001)Google Scholar