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.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-642-33068-1_20
Chapter PDF
Similar content being viewed by others
References
Wikipedia, http://en.wikipedia.org/wiki/Mashup_web_application_hybrid (accessed by March 21, 2012)
Bouguettaya, A., et al.: End-to-End Service Support for Mashups. IEEE Transactions on Services Computing 3(3), 250–263 (2010)
Bouillet, E., et al.: A tag-based approach for the design and composition of information processing applications. In: Proceedings of the 23rd ACM SIGPLAN Conference on Object-Oriented Programming Systems Languages and Applications. ACM, Nashville (2008)
Bouillet, E., et al.: A Folksonomy-Based Model of Web Services for Discovery and Automatic Composition. In: IEEE International Conference on Services Computing, SCC 2008 (2008)
Bouillet, E., et al.: A Faceted Requirements-Driven Approach to Service Design and Composition. In: IEEE International Conference on Web Services, ICWS 2008 (2008)
Ranganathan, A., Riabov, A., Udrea, O.: Mashup-based information retrieval for domain experts. In: Proceeding of the 18th ACM Conference on Information and Knowledge Management. ACM, Hong Kong (2009)
Riabov, A.V., et al.: Wishful search: interactive composition of data mashups. In: Proceeding of the 17th International Conference on World Wide Web. ACM, Beijing (2008)
Riabov, A., Liu, Z.: Scalable Planning for Distributed Stream Processing Systems. In: Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, Cumbria, UK, June 6-10. AAAI (2006)
Riabov, A., Liu, Z.: Planning for stream processing systems. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol. 3. AAAI Press, Pittsburgh (2005)
Xiao, H., Zou, Y., Tang, R., Ng, J., Nigul, L.: A Framework for Automatically Supporting End-Users in Service Composition. In: Chignell, M., Cordy, J., Ng, J., Yesha, Y. (eds.) The Smart Internet. LNCS, vol. 6400, pp. 115–136. Springer, Heidelberg (2010)
Xiao, H., et al.: An Approach for Context-Aware Service Discovery and Recommendation. In: Proceedings of the 2010 IEEE International Conference on Web Services. IEEE Computer Society (2010)
Hua, X., et al.: An automatic approach for ontology-driven service composition. In: Proceedings of the 2009 IEEE International Conference on Service-Oriented Computing and Applications (2009)
Xiao, H., et al.: Personalized Service Discovery and Composition. In: Pre-proceedings of SITCON: The CAS / NSERC Strategic Workshop in Smart Internet Technologies, Canada (2009)
Advanced Knowledge Technologies, http://www.aktors.org/ontology/ (accessed by December 23, 2010)
Sirin, E., et al.: HTN planning for Web Service composition using SHOP2. Web Semantics: Science, Services and Agents on the World Wide Web 1(4), 377–396 (2004)
Wu, D., Parsia, B., Sirin, E., Hendler, J., Nau, D.S.: Automating DAML-S Web Services Composition Using SHOP2. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 195–210. Springer, Heidelberg (2003)
Wikipedia, http://en.wikipedia.org/wiki/Ontology_information_science (accessed by April 10, 2012)
Hoyer, V., Janner, T., Delchev, I., Fuchsloch, A., López, J., Ortega, S., Fernández, R., Möller, K.H., Rivera, I., Reyes, M., Fradinho, M.: The FAST Platform: An Open and Semantically-Enriched Platform for Designing Multi-channel and Enterprise-Class Gadgets. In: Baresi, L., Chi, C.-H., Suzuki, J. (eds.) ICSOC-ServiceWave 2009. LNCS, vol. 5900, pp. 316–330. Springer, Heidelberg (2009)
Hoyer, V., et al.: Enterprise Mashups: Design Principles towards the Long Tail of User Needs. In: IEEE International Conference on Services Computing (2008)
Rodriguez, M.A., Egenhofer, M.J.: Determining semantic similarity among entity classes from different ontologies. IEEE Transactions on Knowledge and Data Engineering 15(2), 442–456 (2003)
Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for top-k queries. In: Proceedings of the 33rd International Conference on Very Large Data Bases. VLDB Endowment, Vienna (2007)
Wang, J., et al.: TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering 17(5), 652–663 (2005)
Wu, J., et al.: Web Service Discovery Based on Ontology and Similarity of Words. Chinese Journal of Computers 28(4), 595–602 (2005)
Cao, J., et al.: A Goal Driven and Process Reuse Based Web Service Customization Model. Chinese Journal of Computers 28(4), 721–730 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bai, L., Ye, D., Wei, J. (2012). A Goal Decomposition Approach for Automatic Mashup Development. In: van Sinderen, M., Johnson, P., Xu, X., Doumeingts, G. (eds) Enterprise Interoperability. IWEI 2012. Lecture Notes in Business Information Processing, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33068-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-33068-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33067-4
Online ISBN: 978-3-642-33068-1
eBook Packages: Computer ScienceComputer Science (R0)