{"title":"Learning web-service task descriptions from traces","authors":"Thomas J. Walsh, M. Littman, Alexander Borgida","doi":"10.3233/WIA-2012-0254","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of learning task specific web-service descriptions from traces of users successfully completing a task. Unlike prior approaches, we take a traditional machine-learning perspective to the construction of web-service models from data. Our representation models both syntactic features of web-service schemas including lists and optional elements, as well as semantic relations between objects in the task. Together, these learned models form a full schematic model of the dataflow. Our theoretical results, which are the main novelty in the paper, show that this structure can be learned efficiently: the number of traces required for learning grows polynomially with the size of the task. We also present real-world task descriptions mined from tasks using online services from Amazon and Google.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"205 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Web Intell. Agent Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/WIA-2012-0254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper considers the problem of learning task specific web-service descriptions from traces of users successfully completing a task. Unlike prior approaches, we take a traditional machine-learning perspective to the construction of web-service models from data. Our representation models both syntactic features of web-service schemas including lists and optional elements, as well as semantic relations between objects in the task. Together, these learned models form a full schematic model of the dataflow. Our theoretical results, which are the main novelty in the paper, show that this structure can be learned efficiently: the number of traces required for learning grows polynomially with the size of the task. We also present real-world task descriptions mined from tasks using online services from Amazon and Google.