earticle

논문검색

Semantic Query Routing for Ontological Knowledge Chain

초록

영어

With a large quantity of data and services existing in virtual organization, query routing is an efficient approach to satisfy entities on community for their requirements of knowledge. The entities, which are organized according to the semantic relationship of each other, together with the query routing method under the guidance of semantics, endeavor to meet the querist with the most relevant answer. This paper proposes an extended query routing method that draws on the relationships between different concepts on Domain Ontology to mine the relationship between the knowledge querist holds and the knowledge querist wants. Through Related Segmentation of Ontology Algorithm, this paper tries to explore a cognitive chain to get the querist to fully understand how the knowledge in answer comes about, and to infer the answer querist wants to know.

목차

Abstract
 1. Introduction
 2. Ontology Partition method
  2.1. Relations of concepts in ontology
  2.2. Related segmentation of ontology
  2.3. Rationality of ontology partition for query routing
 3. Abstract system model
  3.1. Organization
  3.2. Message model
  3.3. Domain ontology and extensible
  3.4. Mechanism
 4. Routing algorithm
  4.1. Existence checking
  4.2. Necessary Consideration
  4.3. Heuristic rule
  4.4. Ontology Partition based Routing Algorithm (OPBR)
  4.5. Route Selection
 5. Experiment Evaluation
  5.1. Algorithm complexity analysis
  5.2. Routing example and semantic relevancy of the chain for the original concept and the target one
 6. Discussion
 7. Related Work
 8. Conclusion and future work
 References

저자정보

  • Rui Wang College of Computer and Software, Taiyuan University of Technology
  • Xueli Yu College of Computer and Software, Taiyuan University of Technology
  • Yingjie Li College of Computer and Software, Taiyuan University of Technology

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.