首页 | 本学科首页   官方微博 | 高级检索  
     检索      

An Aggregation Cache Replacement Algorithm Based on Ontology Clustering
作者姓名:ZHU  Jiang  SHEN  Qingguo  TANG  Tang  LI  Yongqiang
作者单位:Institute of Communications Engineering, PLAUniversity of Science and Technology, Nanjing. 210007,Jiangsu, China
摘    要:This paper describes the theory, implementation, and experimental evaluation of an Aggregation Cache Replacement ( ACR ) algorithm. By considering application background, carefully choosing weight values, using a special formula to calculate the similarity, and clustering ontologies by similarity for getting more embedded deep relations, ACR combines the ontology similarity with the value of object and decides which object is to be replaced. We demonstrate the usefulness of ACR through experiments. (a) It is found that the aggregation tree is created wholly differently according to the application cases. Therefore, clustering can direct the content adaptation more accurately according to the user perception and can satisfy the user with different preferences. (b) After comparing this new method with widely-used algorithm Last-Recently-Used (LRU) and First-in-First-out (FIFO) method, it is found that ACR outperforms the later two in accuracy and usability. (c) It has a better semantic explanation and makes adaptation more personalized and more precise.

关 键 词:本体相似  置换算法  文本匹配  语义Web
文章编号:1007-1202(2006)05-1141-06
收稿时间:2006-01-22

An Aggregation Cache Replacement algorithm based on ontology clustering
ZHU Jiang SHEN Qingguo TANG Tang LI Yongqiang.An Aggregation Cache Replacement Algorithm Based on Ontology Clustering[J].Wuhan University Journal of Natural Sciences,2006,11(5):1141-1146.
Authors:Zhu Jiang  Shen Qingguo  Tang Tang  Li Yongqiang
Institution:(1) Institute of Communications Engineering, PLA, University of Science and Technology, 210007 Nanjing, Jiangsu, China
Abstract:This paper describes the theory, implementation, and experimental evaluation of an Aggregation Cache Replacement (ACR) algorithm. By considering application background, carefully choosing weight values, using a special formula to calculate the similarity, and clustering ontologies by similarity for getting more embedded deep relations, ACR combines the ontology similarity with the value of object and decides which object is to be replaced. We demonstrate the usefulness of ACR through experiments. @ It is found that the aggregation tree is created wholly differently according to the application cases. Therefore, clustering can direct the content adaptation more accurately according to the user perception and can satisfy the user with different preferences. ß After comparing this new method with widely-used algorithm Last-Recently-Used (LRU) and First-in-First-out (FIFO) method, it is found that ACR outperforms the later two in accuracy and usability. © It has a better semantic explanation and makes adaptation more personalized and more precise.
Keywords:ontology similarity  replacement algorithm  content adaptation  semantic Web
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号