期刊文献+

Ontology-Driven Mashup Auto-Completion on a Data API Network 被引量:3

Ontology-Driven Mashup Auto-Completion on a Data API Network
原文传递
导出
摘要 The building of data mashups is complicated and error-prone, because this process requires not only finding suitable APIs 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 APIs. 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 precisionp of about 80%, recallp of about 60%, and F0.5 of about 70% for predicting links between APIs. Compared with the API network Ne com-posed 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 recallr and discounted cumula-tive 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 APIs rather than using only existing links on the Web. The building of data mashups is complicated and error-prone, because this process requires not only finding suitable APIs 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 APIs. 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 precisionp of about 80%, recallp of about 60%, and F0.5 of about 70% for predicting links between APIs. Compared with the API network Ne com-posed 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 recallr and discounted cumula-tive 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 APIs rather than using only existing links on the Web.
出处 《Tsinghua Science and Technology》 SCIE EI CAS 2010年第6期657-667,共11页 清华大学学报(自然科学版(英文版)
基金 Supported by the National Natural Science Foundation of China(No. 61070156) Special Youth Research and Innovation Programs (Nos.2009QNA5025 and 2010QNA5044) IBM-ZJU Joint Research Projects
关键词 ontology semantic graph template semantic Bayesian network mashup auto-completion ontology semantic graph template semantic Bayesian network mashup auto-completion
  • 相关文献

参考文献14

  • 1Declan B. Mashups mix data into global service. Nature, 2006, 439: 6-7.
  • 2IBM Mashup Center. http://www.ibm.com/software/info/ mashup-center/, 2010.
  • 3Yahoo Pipes!. http://pipes.yahoo.com, 2010.
  • 4Intel Mash Maker. http://mashmaker, intel.com/web/, 2010.
  • 5Lu Bin, Wu Zhaohui, Ni Yuan, et al. sMash: Semantic-based mashup navigation for data API network. In: Proceedings of 2009 World Wide Web Conference. Madrid Spain, 2009.
  • 6Ohad G, Tova M, Neoklis P. Auto-completion for mashups. In: 35th International Conference on Very Large Data Bases (VLDB'09). Lyon, Italy, 2009: 538-549.
  • 7Joshua O, Jon H, Padhraic S. Prediction and ranking algorithms for even-based network data. ACM SIGKDD Ex- plorations Newsletter, 2005, 7(2): 23-30.
  • 8Getoor L, Friedman N, Koller D, et al. Learning probabilistic models of relational structure. In: Proceedings of International Conference on Machine Learning (ICML'01). Williamstown, Massachusetts, USA, 2001.
  • 9Getoor L, Friedman N, Koller D, et al. Learning probabilistic models of link structure. Journal of Machine Learning Research, 2002, 3: 679-707.
  • 10Ben T, Wong Ming-fai, Pieter A, et al. Link prediction in relational data. In: Proceedings of Neural Information Processing Systems Conference. Vancouver, Canada, 2003.

同被引文献13

  • 1Han Hao,Xue Yinming,Oyama K.Mashup technology:beyond open programming interfaces[J].Computer,2013,46(12):96-99.
  • 2Fung B C,Trojer T,Li Xiong.Service-oriented architecture for high-dimensional private data Mashup[J].IEEE Trans on Services Computing,2012,5(3):373-386.
  • 3Guo Junxia,Tokuda T.Description-based Mashup of Web applications[C]//Current Trends in Web Engineering.Berlin:Springer,2010:545-549.
  • 4Tang Xuqing,Zhu Ping.Hierarchical clustering problems and analysis of fuzzy proximity relation on granular space[J].IEEE Trans on Fuzzy Systems,2013,21(5):814-824.
  • 5Porter M F.An algorithm for suffix stripping[J].Program:Electronic Library and Information Systems,2006,40(3):211-218.
  • 6Wood J,Dykes J,Slingsby A.Interactive visual exploration of a large spatio-temporal dataset:reflections on a geovisualization Mashup[J].IEEE Trans on Visualization and Computer Graphics,2007,13(6):1176-1183.
  • 7Gebhardt H,Gaedke M,Daniel F.From Mashups to Telco Mashups:a survey[J].Internet Computing,2012,16(3):70-76.
  • 8Stolee K T,Elbaum S.Identification,impact,and refactoring of smells in pipe-like Web mashups[J].IEEE Trans on Software Engineering,2013,39(12):1654-1679.
  • 9Yu Tianwei,Peng H S.Hierarchical clustering of high-throughput expression data based on general dependences[J].IEEE/ACM Trans on Computational Biology and Bioinformatics,2013,10(4):1080-1085.
  • 10Stirbu V,Yu You,Roimela K.A lightweight platform for Web Mas-hups in immersive mirror worlds[J].Pervasive Computing,2013,12(1):34-41.

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部