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 servi...
Gespeichert in:
Veröffentlicht in: | The Journal of supercomputing 2013-12, Vol.66 (3), p.1167-1177 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0920-8542 1573-0484 |
DOI: | 10.1007/s11227-011-0665-6 |