skip to main content
10.1145/2076006.2076015acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmashupsConference Proceedingsconference-collections
research-article

Simplifying mashup component selection with a combined similarity- and social-based technique

Published: 14 September 2011 Publication History

Abstract

Web mashups are becoming the main approach to build Web applications. Current approaches to enable component selection include description-based techniques and socially generated metadata. The explosive growth of APIs makes increasingly harder selecting appropriate components for each mashup. Unfortunately, description-based techniques rely heavily on the quality of authors' information, and social-based approaches suffer problems like "cold-start" and "preferential attachment". This article proposes (1) two new measures of socially ranked fitness of candidate components, (2) an API functional taxonomy using Formal Concept Analysis based on descriptions, and (3) a combined approach that improves description-based techniques with these social ranking measures. We use social rankings based on past (co-)utilization of APIs: WAR (Web API Rank) measures API utilization over time, and CAR (Co-utilization API Rank) measures its co-utilization with other APIs. The measures and the combined approach are illustrated with a case study using the well-known Web APIs catalog ProgrammableWeb. A prototype tool allows iterative discovery of APIs and assists the mashup creation process.

References

[1]
C. Carpineto and G. Romano. Exploiting the potential of concept lattices for information retrieval with credo. J. UCS, pages 985--1013, 2004.
[2]
H. Elmeleegy, A. Ivan, R. Akkiraju, and R. Goodwin. Mashup advisor: A recommendation tool for mashup development. In Web Services, 2008. ICWS '08. IEEE International Conference on, pages 337--344, sept. 2008.
[3]
K. Goarany, G. Kulczycki, and M. B. Blake. Mining social tags to predict mashup patterns. In Proceedings of the 2nd international workshop on Search and mining user-generated contents, SMUC '10, pages 71--78, New York, NY, USA, 2010. ACM.
[4]
O. Greenshpan, T. Milo, and N. Polyzotis. Autocompletion for mashups. Proc. VLDB Endow., 2:538--549, August 2009.
[5]
C. Lindig. Fast concept analysis. In Working with Conceptual Structures - Contributions to ICCS 2000, pages 152--161. Shaker Verlag, 2000.
[6]
G. R. G. Michael Weiss. Modeling the mashup ecosystem: Structure and growth. In R & D Management, pages 40--49, 2010.
[7]
M. F. Porter. An algorithm for suffix stripping. Program, 14(3):130--137, 1980.
[8]
A. Ranabahu, M. Nagarajan, A. P. Sheth, and K. Verma. A faceted classification based approach to search and rank web apis. In Proceedings of the 2008 IEEE International Conference on Web Services, pages 177--184, Washington, DC, USA, 2008. IEEE Computer Society.
[9]
C. Roth and P. Bourgine. Lattice-based dynamic and overlapping taxonomies: The case of epistemic communities. Scientometrics, 69(2):429--447, 2006.
[10]
J. W. Shuli Yu. Innovation in the programmable web: Characterizing the mashup ecosystem. In ICSOC 2008, LNCS 5472, pages 136--147. Springer-Verlag, 2009.
[11]
R. Torres, B. Tapia, and H. Astudillo. Improving web api discovery by leveraging social information. to appear in the proceedings of the 9th IEEE International Conference on Web Services, 2011.
[12]
M. Weiss and S. Sari. Evolution of the mashup ecosystem by copying. In Proceedings of the 3rd and 4th International Workshop on Web APIs and Services Mashups, Mashups '09/'10, pages 11:1--11:7, New York, NY, USA, 2010. ACM.
[13]
Q. Wu, A. Iyengar, R. Subramanian, I. Rouvellou, I. Silva-Lepe, and T. Mikalsen. Combining quality of service and social information for ranking services. In Proceedings of the 7th International Joint Conference on Service-Oriented Computing, ICSOC-ServiceWave '09, pages 561--575, Berlin, Heidelberg, 2009. Springer-Verlag.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
Mashups '11: Proceedings of the 5th International Workshop on Web APIs and Service Mashups
September 2011
81 pages
ISBN:9781450308236
DOI:10.1145/2076006
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 September 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. formal concept analysis
  2. mashup
  3. recommendation system
  4. social network

Qualifiers

  • Research-article

Funding Sources

  • UTFSM DGIP
  • FONDEF
  • CCTVal

Conference

Mashups '11

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media