Mashup Service Recommendation based on User Interest and Service Network Buqing Cao ICWS2013, IJWSR.

Slides:



Advertisements
Similar presentations
17th April Presented by: Prof Mark Baker ACET, University of Reading Tel:
Advertisements

Chapter 5: Introduction to Information Retrieval
1 Autocompletion for Mashups Ohad Greenshpan, Tova Milo, Neoklis Polyzotis Tel-Aviv University UCSC.
TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets Chun Chen 1, Feng Li 2, Beng Chin Ooi 2, and Sai Wu 2 1 Zhejiang University, 2 National.
Linking Named Entity in Tweets with Knowledge Base via User Interest Modeling Date : 2014/01/22 Author : Wei Shen, Jianyong Wang, Ping Luo, Min Wang Source.
Pete Bohman Adam Kunk.  Introduction  Related Work  System Overview  Indexing Scheme  Ranking  Evaluation  Conclusion.
Automatically Annotating and Integrating Spatial Datasets Chieng-Chien Chen, Snehal Thakkar, Crail Knoblock, Cyrus Shahabi Department of Computer Science.
Safeguarding and Charging for Information on the Internet Hector Garcia-Molina, Steven P. Ketchpel, Narayanan Shivakumar Stanford University Presented.
Sean Blong Presents: 1. What are they…?  “[…] specific type of information filtering (IF) technique that attempts to present information items (movies,
GENERATING AUTOMATIC SEMANTIC ANNOTATIONS FOR RESEARCH DATASETS AYUSH SINGHAL AND JAIDEEP SRIVASTAVA CS DEPT., UNIVERSITY OF MINNESOTA, MN, USA.
A New Suffix Tree Similarity Measure for Document Clustering Hung Chim, Xiaotie Deng City University of Hong Kong WWW 2007 Session: Similarity Search April.
A New Learning Tools. Topic Maps is a standard for the representation and interchange of knowledge, with an emphasis on the findability of information.
ITEC810 Project By: P. M. Mathindri Nilushika Pathiraja 1.
Xiaomeng Su & Jon Atle Gulla Dept. of Computer and Information Science Norwegian University of Science and Technology Trondheim Norway June 2004 Semantic.
Memoplex Browser: Searching and Browsing in Semantic Networks CPSC 533C - Project Update Yoel Lanir.
Federated Search of Text Search Engines in Uncooperative Environments Luo Si Language Technology Institute School of Computer Science Carnegie Mellon University.
Chapter 5: Information Retrieval and Web Search
Digital Image Processing Lecture3: Introduction to MATLAB.
1 Mashroom: End-User Mashup Programming Using Nested Tables Guiling Wang, Shaohua Yang, Yanbo Han Institute of Computing Technology (ICT) Chinese Academy.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Focused Matrix Factorization for Audience Selection in Display Advertising BHARGAV KANAGAL, AMR AHMED, SANDEEP PANDEY, VANJA JOSIFOVSKI, LLUIS GARCIA-PUEYO,
Web Mashups -Nirav Shah.
Ihr Logo Chapter 7 Web Content Mining DSCI 4520/5240 Dr. Nick Evangelopoulos Xxxxxxxx.
Introduction to Web Mining Spring What is data mining? Data mining is extraction of useful patterns from data sources, e.g., databases, texts, web,
Web Mashups Presented By: Saket Goel Uni: sg2679.
When Experts Agree: Using Non-Affiliated Experts To Rank Popular Topics Meital Aizen.
Thanks to Bill Arms, Marti Hearst Documents. Last time Size of information –Continues to grow IR an old field, goes back to the ‘40s IR iterative process.
Exploring Online Social Activities for Adaptive Search Personalization CIKM’10 Advisor : Jia Ling, Koh Speaker : SHENG HONG, CHUNG.
1 Computer Programming (ECGD2102 ) Using MATLAB Instructor: Eng. Eman Al.Swaity Lecture (1): Introduction.
© 2001 Business & Information Systems 2/e1 Chapter 8 Personal Productivity and Problem Solving.
Lead Black Slide Powered by DeSiaMore1. 2 Chapter 8 Personal Productivity and Problem Solving.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
McLean HIGHER COMPUTER NETWORKING Lesson 7 Search engines Description of search engine methods.
Improving Web Search Results Using Affinity Graph Benyu Zhang, Hua Li, Yi Liu, Lei Ji, Wensi Xi, Weiguo Fan, Zheng Chen, Wei-Ying Ma Microsoft Research.
2005/12/021 Fast Image Retrieval Using Low Frequency DCT Coefficients Dept. of Computer Engineering Tatung University Presenter: Yo-Ping Huang ( 黃有評 )
Introduction to the Semantic Web and Linked Data
Chittampally Vasanth Raja 10IT05F vasanthexperiments.wordpress.com.
Chittampally Vasanth Raja vasanthexperiments.wordpress.com.
Semantic web Bootstrapping & Annotation Hassan Sayyadi Semantic web research laboratory Computer department Sharif university of.
Suggestions for Galaxy Workflow Design Using Semantically Annotated Services Alok Dhamanaskar, Michael E. Cotterell, Jessica C. Kissinger, and John Miller.
Instance Discovery and Schema Matching With Applications to Biological Deep Web Data Integration Tantan Liu, Fan Wang, Gagan Agrawal {liut, wangfa,
Bringing Order to the Web : Automatically Categorizing Search Results Advisor : Dr. Hsu Graduate : Keng-Wei Chang Author : Hao Chen Susan Dumais.
Week 1: Basic Internet Concepts By: Kim Peterman 08/19/2012.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
The Web Web Design. 3.2 The Web Focus on Reading Main Ideas A URL is an address that identifies a specific Web page. Web browsers have varying capabilities.
Development of Open API for Micro-scale
Recommendation in Scholarly Big Data
Web Mashups -Nirav Shah.
Designing Cross-Language Information Retrieval System using various Techniques of Query Expansion and Indexing for Improved Performance  Hello everyone,
WSRec: A Collaborative Filtering Based Web Service Recommender System
MATLAB Basics Nafees Ahmed Asstt. Professor, EE Deptt DIT, DehraDun.
Parallel Density-based Hybrid Clustering
The Improvement of PaaS Platform ZENG Shu-Qing, Xu Jie-Bin 2010 First International Conference on Networking and Distributed Computing SQUARE.
Yusmadi Yah Jusoh
Hansheng Xue School of Computer Science and Technology
Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie1, Shenglin Zhao2, Zibin Zheng3, Jieming Zhu2 and Michael.
Web Data Integration Using Approximate String Join
Graduation Project Kick-off presentation - SET
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
An Efficient method to recommend research papers and highly influential authors. VIRAJITHA KARNATAPU.
How to write in DITA Anindita Basu.
Efficient Evaluation of k-NN Queries Using Spatial Mashups
CS & CS Capstone Project & Software Development Project
Frontiers of Computer Science, 2015, 9(6):980–989
Topic Oriented Semi-supervised Document Clustering
Digital Image Processing
PROJECTS SUMMARY PRESNETED BY HARISH KUMAR JANUARY 10,2018.
A novel Web usage mining approach for search engines
WSExpress: A QoS-Aware Search Engine for Web Services
Presentation transcript:

Mashup Service Recommendation based on User Interest and Service Network Buqing Cao ICWS2013, IJWSR

16:16 Introduction(1) With the emergence of Web2.0 and its related technologies, mashups, which are Web applications created by combining two or more services, are becoming a hot research topic. Mashup technology has many advantages (such as easier programming, shorter development time, higher quality plans, and more interested outputs, which make it becomes increasingly popular. For example, to June 2013, Programmableweb.com has published more than 7099 mashup services. Moreover, several mashup tools have been developed, such as Microsoft Popfly, Google Mashup Editor and IBM Mashup Center. Typical mashup applications include Map, Video and Image, Search and Shopping, News, Microblog Mashup, etc. Mashup Service Recommendation based on User Interest and Social Network B Cao, J Liu, M Tang, Z Zheng, G Wang

Search,Shopping mashup 16:16 Introduction(2) Map mashup Video,Photo mashup Search,Shopping mashup Moreover, several mashup tools have been developed, such as Microsoft Popfly, Google Mashup Editor and IBM Mashup Center. Typical mashup applications include Map, Video and Image, Search and Shopping, News, Microblog Mashup, etc. Mashup Service Recommendation based on User Interest and Social Network B Cao, J Liu, M Tang, Z Zheng, G Wang

Introduction(3) Research issue Idea 16:16 Introduction(3) Research issue With the rapid growth in the number of available mashup services, how to recommend suitable Mashup services to users is a challenging problem. Idea focus on Mashup service recommendation which is seldom addressed by previous work. (Most existing works focus on Web service recommendation.) propose a novel Mashup service recommendation approach which takes both users’ personal interest and relationship between Mashups into consideration. This method can achieve a good balance between recommendation accuracy and diversity. conduct a set of experiments on a real-world mashup dataset to evaluate the performance of our recommendation approach. A prototype system is developed to implement our Mashup service recommendation approach. Mashup Service Recommendation based on User Interest and Social Network B Cao, J Liu, M Tang, Z Zheng, G Wang

Framework of Our Approach 16:16 Framework of Our Approach Mashup Service Recommendation based on User Interest and Social Network B Cao, J Liu, M Tang, Z Zheng, G Wang

Prototype Implementation (1) 16:16 Prototype Implementation (1) A Mashup service recommendation prototype system is developed to implement the proposed method. The Mashup service recommendation prototype system has functionalities of Mashup service crawling and registration, Mashup service search and management, TextSimilarity and SRSimilarity computing, Mashup service recommendation, and so on. Its framework is as shown in Figure 6. Crawl and Registration of Mashup Services, Web APIs and Tags ProgrammableWeb.com is the leading directory of mashup services applications and open Web APIs, has published 7580 Web APIs and 6798 mashup services as of October 2012.We crawl and register these mashup services, Web APIs and tags from programmableweb.com as the origin data, and then store them to local database using the forms as Mashup<Id, Name, APIs, tags …>, API<Id, Name, tags…>, and Tag<Id, Name, tags …>. User History on Mashup Services After a user has searched and used some mashup services of the system recently, we will preprocess, save and integrate these historical, used mashup services documents which are consist of mashup service name, description, their Web APIs and tags, and their developer information, and so on. User Interest Model By the user history on mashup services, a user interest vector will be built by the system. Meanwhile, a preprocessing will be performed for each mashup service document in this system and then form a mashup service vector. Finally, the system will calculate the text similarity between user interest vector and mashup service vector, and finish the construction of user interest model. Service Network Model The system extracts the social calling relationship between mashup services and Web APIs, and the social marking relationship between mashup services and tags, or Web APIs and tags. By integrating these two relationships, the system computes the social relationship similarity among mashup services, and then generates mashup service network. Mashup Service Recommendation Based on user interest model and social relationship network model, the system will realize mashup service recommendation. When a user searches a mashup service, the system will perform the total similarity computing, and then execute Top-K mashup service recommendation algorithm, and finally can find the top-K similar mashup services or mashup services composition paths with the total similarity more than threshold . Mashup Service Recommendation based on User Interest and Social Network B Cao, J Liu, M Tang, Z Zheng, G Wang

Prototype Implementation (2/2) 16:16 Prototype Implementation (2/2) http://125.221.225.2:8080/Mashup/ Mashup Service Recommendation based on User Interest and Social Network B Cao, J Liu, M Tang, Z Zheng, G Wang