Workflow inference: What to do with one example and no semantics

AAAI Workshop - Technical Report

Volumn WS-07-02, Issue , 2007, Pages 46-51

  Yaman, Fusun ^a   Oates, Tim ^a  

^a University of Marylandw Baltimore County

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SEMANTICS; ACTION SEQUENCES; ATOMIC ACTIONS; GRAMMAR INDUCTION; HUMAN EXPERTS; INPUT/OUTPUT; MODEL MERGING; TECHNICAL REPORTS; WEB SERVICES; WORK-FLOWS;

INFERENCE ENGINES; INFORMATION SERVICES; INFORMATION THEORY; KNOWLEDGE ACQUISITION; MANAGEMENT; MERGERS AND ACQUISITIONS; SEMANTICS;

MERGING;

EID: 51849126399     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Agrawal, R.; Gunopulos, D.; and Leymann, F. 1998. Mining process models from workflow logs. In 6th Int. Conf. on Extending Database Tech. (EDBT '98), 469-483.
2. Bauer, M. A. 1979. Programming by examples. Artificial Intelligence 12(1): 1-21.
3. Berners-Lee, T.; Hendler, J.; and Lassila, O. 2001. The Semantic Web. Scientific American 284(5):34-43.
4. Chartrand, G.; Kubicki, G.; and Schultz, M. 1998. Graph similarity and distance in graphs. Aequationes Mathematicae 20(1): 129-145.
5. Cook, J. E., and Wolf, A. L. 1998. Discovering models of software processes from event-based data. ACM Trans. Softw. Eng. Methodol. 7(3).
6. Du, Z.; Huai, J.; Liu, Y.; Hu, C.; and Lei, L. 2005. Ipr: Automated interaction process reconciliation. In IEEE Int. Conf. on Web Intelligence (WI'05), 450-456.
7. Lau, T. A., and Weld, D. S. 1999. Programming by demonstration: An inductive learning formulation. In Intelligent User Interfaces, 145-152.
8. Mahleko, B.; Wombacher, A.; and Fankhauser, P. 2005. A grammar-based index for matching business processes. In IEEE Int. Conf. on Web Services (ICWS 2005, 21-30.
9. Messmer, B. T., and Bunke, H. 1998. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans, on Patt. Analysis and Mack Intell. 20(5):493-504.
10. Mohri,M. 2003. Edit-distance of weighted automata: General definitions and algorithms. Int. J. Found. Comput. Sci. 14(6):957-982.
11. Nejati, N.; Langley, P.; and Konik, T. 2006. Learning hierarchical task networks by observation. In ICML '06, 665-672.
12. Oates, T.; Desai, D.; and Bhat, V. 2002. Learning k-reversible context-free grammars from positive structural examples. In ICML, 459-465.
13. Sirin, E.; Parsia, B.; Wu, D.; Hendler, J.; and Nau, D. 2004. HTN planning for web service composition using SHOP2. Journal of Web Semantics 1(4):377-396.
14. van der Aalst, W. M. P., and Basten, T. 2002. Inheritance of workflows: an approach to tackling problems related to change. Theor. Comput. Sci. 270(1-2):125-203.
15. Weijters, T., and van der Aalst, W. 2001. Process mining: Discovering workflow models from event-based data. In 13th Belgium-Netherlands Conf. on AI (BNAIC'01).
16. Winner, E., and Veloso, M. M. 2003. Distill: Learning domain-specific planners by example. In 20th Int. Conf. on Machine Learning (ICML 2003), 800-807.