Number of the records: 1  

Learning Task Specific Web Services Compositions with Loops and Conditional Branches from Example Executions

  1. 1.
    SYSNO ASEP0359201
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleLearning Task Specific Web Services Compositions with Loops and Conditional Branches from Example Executions
    Author(s) Veeraraghavan, H. (US)
    Vaculín, Roman (UIVT-O)
    Veloso, M. (US)
    Source TitleWeb Intelligence and Intelligent Agent Technology. - Los Alamitos : IEEE Computer Society, 2010 / Hoeber O. ; Li Y. ; Huang X.J. - ISBN 978-0-7695-4191-4
    Pagess. 581-588
    Number of pages8 s.
    Publication formOnline - E
    ActionWI 2010. IEEE/WIC/ACM International Conference on Web Intelligence
    Event date31.08.2010-03.09.2010
    VEvent locationToronto
    CountryCA - Canada
    Event typeWRD
    Languageeng - English
    CountryUS - United States
    Keywordslearning by demonstration ; plan learning ; task specific plan learning ; web services ; workflow learning
    Subject RIVIN - Informatics, Computer Science
    R&D ProjectsGPP202/10/P604 GA ČR - Czech Science Foundation (CSF)
    ME08095 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    EID SCOPUS78649830825
    DOI10.1109/WI-IAT.2010.292
    AnnotationMajority of the existing approaches to service composition, including the widely popular planning based techniques, are not able to automatically compose practical workflows that include complex repetitive behaviors (loops), taking into account possibility of failures and nondeterminism of web service execution results. In this work, we present a learning based approach for composing task specific workflows. We present an approach for learning task specific web service compositions from a very small number of observations (one or more) of example service execution sequences (traces) that solve a given goal. The workflows learned by this approach generalize to the tasks justified by the observed execution trace. The generalization captures the repetitive executions of service sequences, conditional branching executions, and repetitions and branching resulting from failures. We evaluate the approach on a complex web services application involving arbitrary number of repetitive executions and failed executions.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2013
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.