首页> 外文期刊>Journal of supercomputing >A novel component retrieval method based on weighted facet tree
【24h】

A novel component retrieval method based on weighted facet tree

机译:一种基于加权分面树的成分检索新方法

获取原文
获取原文并翻译 | 示例

摘要

Recently, the computing paradigm has switched from mainframe and desktop computing to ubiquitous computing; one of whose motivations is to provide intelligent, personalized and comprehensive services to users. As a solution of ubiquitous computing, Active Services has proposed to generate such services on demand by retrieving, adapting, and composing of existing service components. As the popularity of this paradigm, and hence the number of service components increases, how to efficiently retrieve components to maximally meet user requirements has become a fundamental and significant problem. However, current service components are stored dispersedly on the Internet, nor classified in a unified specification, so that traditional component retrieval methods often fail to search and rank components among several different repositories. To solve these problems, this paper proposes a novel component retrieval method based on a weighted facet tree. We first formally specify the components and user queries under facet classification space in the form of weighted trees, then design a component retrieval algorithm by matching between the trees of query and component, in which the sum of the weights of all the leaf nodes in Query Tree are calculated, and finally rank the matched components by matching degree. The experimental results show promising results in terms of retrieval accuracy and efficiency.
机译:最近,计算范式已从大型机和台式机转换为普适计算。其动机之一是为用户提供智能,个性化和全面的服务。作为普适计算的解决方案,Active Services已提出通过检索,调整和组成现有服务组件来按需生成此类服务。随着这种范例的普及以及服务组件的数量增加,如何有效地检索组件以最大程度地满足用户需求已成为一个基本而重要的问题。但是,当前的服务组件分散地存储在Internet上,也没有按照统一的规范进行分类,因此传统的组件检索方法通常无法在几个不同的存储库中搜索和排序组件。为了解决这些问题,本文提出了一种新的基于加权分面树的成分检索方法。我们首先以加权树的形式在构面分类空间下正式指定组件和用户查询,然后通过查询树和组件之间的匹配来设计组件检索算法,其中查询中所有叶节点的权重之和计算出树,最后根据匹配度对匹配的组件进行排序。实验结果表明,在检索准确性和效率方面有希望的结果。

著录项

  • 来源
    《Journal of supercomputing》 |2013年第3期|1167-1177|共11页
  • 作者单位

    Tsinghua National Laboratory for Information Science and Technology, Beijing, 100084, China Department of Computer Science and Technology. Tsinghua University. Beijing, 100084, China;

    Tsinghua National Laboratory for Information Science and Technology, Beijing, 100084, China Department of Computer Science and Technology. Tsinghua University. Beijing, 100084, China;

    Tsinghua National Laboratory for Information Science and Technology, Beijing, 100084, China Department of Computer Science and Technology. Tsinghua University. Beijing, 100084, China;

    Department of Computer Science, St Francis Xavier University, Antigonish, NS, B2G 2W5, Canada;

    Tsinghua National Laboratory for Information Science and Technology, Beijing, 100084, China Department of Computer Science and Technology. Tsinghua University. Beijing, 100084, China;

    Department of Computer Science and Technology. Tsinghua University. Beijing, 100084, China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Active services; Component ranking; Weighted tree; Ubiquitous computing;

    机译:主动服务;组件排名;加权树;普适计算;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号