Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

3/10/2014

IEEE Xplore Abstract - Ontology-driven mashup auto-completion on a data API network

IEEE.org | IEEE Xplore Digital Library | IEEE Standards | IEEE Spectrum | More Sites

C art (0) | C reate Account | Sign In

For Institutional Users:


Institutional Sign In
Athe ns/Shibbole th

Open Access

Brow se Journals & Magazines > Tsinghua Science and Technolo ...> Volum e:15 Issue:6

Ontology-driven mashup autocompletion on a data API network


5

Author(s)

Back to Results

Full Text as PDF

Zhou, Chunying ; College of Computer Science, Zhejiang University, Hangzhou 310027, China ; Chen, Huajun ; Peng, Zhipeng ; Ni, Yuan
more authors

Abstract

Authors

References

Cited By

Keywords

Metrics

Similar

The building of data mashups is complicated and error-prone, because this process requires not only
finding suitable APls but also combining them in an appropriate way to get the desired result. This paper
describes an ontology-driven mashup auto-completion approach for a data API network to facilitate this
task. First, a microformats-based ontology was defined to describe the attributes and activities of the
data APls. A semantic Bayesian network (sBN) and a semantic graph template were used for the link
prediction on the Semantic Web and to construct a data API network denoted as Np. The performance
is improved by a semi-supervised learning method which uses both labeled and unlabeled data. Then,
this network is used to build an ontology-driven mashup auto-completion system to help users build
mashups by providing three kinds of recommendations. Tests demonstrate that the approach has a

0
Tw eet

0
Share

precisionp of about 80%, recallp of about 60%, and FO.5 of about 70% for predicting links between
APls. Compared with the API network Ne composed of existing links on the current Web, Np contains
more links including those that should but do not exist. The ontology-driven mashup auto-completion
system gives a much better recall, and discounted cumulative gain (DCG) on Np than on Ne. The tests
suggest that this approach gives users more creativity by constructing the API network through
predicting mashup APls rather than using only existing links on the Web.
Published in:
Tsinghua Science and Technology (Volume:15 , Issue: 6 )
Date of Publication:
Dec. 2010
Page(s):
657 - 667

Date of Current Version :


17 January 2012

Digital Object Identifier :


10.1016/S1007-0214(10)70113-9

Issue Date :
Dec. 2010
Sponsored by :
Tsinghua University Press (TUP)

Sign In | C reate Account

IEEE Account

Purchase Details

Profile Information

Need Help?

C hange Username/Password

Payment Options

C ommunications Preferences

US & Canada: +1 800 678 4333

Update Address

Order History

Profession and Education

Worldwide: +1 732 981 0060

Access Purchased Documents

Technical Interests

C ontact & Support

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6077916&queryText%3DData+API

1/2

3/10/2014

IEEE Xplore Abstract - Ontology-driven mashup auto-completion on a data API network

About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
C opyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6077916&queryText%3DData+API

2/2

You might also like