Earticle

초록

영어

Discovery of loose data linkages between data services can help on-demand Web data integration in accordance with situation changes. However, we met the uncertainty challenge when discovering such data linkages with current automatic matchers. To handle the uncertainty problem, this paper develops a synthesized matching algorithm to combine the matching results from multiple automatic matchers with user feedbacks. It also proposes a service hyperlink model to encapsulate such data linkages for further reuse. Experiments show our approach can effectively improve the correctness of discovered data linkages.

목차

Abstract
 1. Introduction
 2. Discovery of Uncertain Service Hyperlinks
  2.1. Definitions of Service Hyperlink
  2.2. Discovery of Service Hyperlink with Multiple Matchers
  2.3. Improvements with User Feedbacks
 3. Evaluation
  3.1. Experiment Data and Process
  3.2. Experiment Results and Analyses
 4. Related Work
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Chen Liu [ Cloud Computing Research Center, North China University of Technology, Beijing, China ]
• Jianwu Wang [ San Diego Supercomputer Center, University of California, San Diego, U.S.A ]
• MeilingZhu [ Cloud Computing Research Center, North China University of Technology, Beijing, China, School of Computer Science and Technology, Tianjin University, Tianjin, China ]
• Yanbo Han [ Cloud Computing Research Center, North China University of Technology, Beijing, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605