计算机科学 ›› 2013, Vol. 40 ›› Issue (3): 86-88.

• 2012多值逻辑专栏 • 上一篇    下一篇

DRR:一种多维案例检索优化算法研究

汪璟玢,胡 烜   

  1. (福州大学数学与计算机科学学院 福州350108)
  • 出版日期:2018-11-16 发布日期:2018-11-16

DDR:A Multidimensional Case Retrieval Optimization Algorithm

  • Online:2018-11-16 Published:2018-11-16

摘要: 基于本体的案例检索系统中,由于数据库中的案例数量随着时间的推移而成倍增加,案例检索的效率不断降低。提出了一种多维案例检索算法—DRR,该算法通过将多维空间案例点降维成二维空间点,利用一个二维空间点来代表类案例点组成的集合,并对此二维空间点建立R树空间索引,通过两级检索的方法,加速了检索效率和准确率。实验证明,该方法不仅提高了案例检索的准确率,还极大地提高了案例检索的效率。

关键词: 案例检索,R树索引,相对点,相对向量

Abstract: In ontology-based case retrieval system,because the number of cases in the database can double increases with time, the efficiency of case retrieval continues lower. This paper presented a multi dimensional case retrieval algorithm-the DRR(Dimensionality Reduction of R-Tree) , the algorithm dimensionality reduces the case point of the multidimensional space to two-dimensional space point, uses a two-dimensional space points to represent the collection on behalf of the class case points, and biulds R-tree spatial index for this two-dimensional space point accelerates the retrieval efficiency and accuracy by the two search methods. It is proved that the method not only improves the accuracy of case retrieval, but also greatly improves the efficiency of case retrieval.

Key words: Case retrieval, R-tree index, Relative point, Relative vector

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!