Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Methods and metrics for cold-start recommendations
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Web Page Recommender System based on Folksonomy Mining for ITNG '06 Submissions
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
Syntactic Rule Based Approach toWeb Service Composition
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Possible Ontologies: How Reality Constrains the Development of Relevant Ontologies
IEEE Internet Computing
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Restful web services vs. "big"' web services: making the right architectural decision
Proceedings of the 17th international conference on World Wide Web
What do we "mashup" when we make mashups?
Proceedings of the 4th international workshop on End-user software engineering
Improved recommendation based on collaborative tagging behaviors
Proceedings of the 13th international conference on Intelligent user interfaces
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Predicting Service Mashup Candidates Using Enhanced Syntactical Message Management
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
A Folksonomy-Based Model of Web Services for Discovery and Automatic Composition
SCC '08 Proceedings of the 2008 IEEE International Conference on Services Computing - Volume 1
The long tail of recommender systems and how to leverage it
Proceedings of the 2008 ACM conference on Recommender systems
Mashup Advisor: A Recommendation Tool for Mashup Development
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
Semantic Grounding of Tag Relatedness in Social Bookmarking Systems
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Tagommenders: connecting users to items through tags
Proceedings of the 18th international conference on World wide web
What's in a mashup? And why? Studying the perceptions of web-active end users
VLHCC '08 Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing
Mining user behavior pattern in mashup community
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
A survey of automated web service composition methods
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Simplifying mashup component selection with a combined similarity- and social-based technique
Proceedings of the 5th International Workshop on Web APIs and Service Mashups
A model for multi-label classification and ranking of learning objects
Expert Systems with Applications: An International Journal
Socially-Enriched semantic mashup of web APIs
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
Hi-index | 0.00 |
In the past few years, tagging has gained large momentum as a user-driven approach for categorizing and indexing content on the Web. Mashups have recently joined the list of Web resources targeted for social tagging. In the context of the social Web, a mashup is a lightweight technique for integrating applications and data over the Web. Crafting new mashups is largely a subjective process motivated by the users' initial inspiration. In this paper, we propose a tag-based approach for predicting mashup patterns, thus deriving inspiration for potential new mashups from the community's consensus. Our approach applies association rule mining techniques to discover relationships between APIs and mashups based on their annotated tags. We also advocate the importance of the mined relationships as a valuable source for recommending mashup candidates while mitigating for common problems in recommender systems. We evaluate our methodology through experimentation using real-life dataset. Our results show that our approach achieves high prediction accuracy and outperforms a direct string matching approach that lacks the mining information.