A goal decomposition approach for automatic mashup development

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Automatic mashup aims to discover desired mashlets according to user goals automatically and combine them into an entirely new application. However, the user goals are usually high-level and coarse-grained while the mashlets are low-level and fine-grained. How to fill in the gap becomes a challenge when addressing automatic mashup development. This paper proposes a novel goal decomposition and refinement approach to handle this problem. We defined a goal model based on which we proposed a history heuristic based algorithm to build a Mashup Goal Ontology repository to enable the auto-decomposition of user goals. Then mashlets which are matching with the refined user goals can be found out and mashed up. We evaluate our approach through experimental results which demonstrate acceptable performance of the decomposition. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Bai, L., Ye, D., & Wei, J. (2012). A goal decomposition approach for automatic mashup development. In Lecture Notes in Business Information Processing (Vol. 122 LNBIP, pp. 20–33). Springer Verlag. https://doi.org/10.1007/978-3-642-33068-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free