메뉴 건너뛰기




Volumn , Issue , 2010, Pages 41-46

Heuristics miner for time intervals

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS PROCESS; BUSINESS SCENARIO; PROCESS MINING; TIME INTERVAL; WORKFLOW MODELS;

EID: 84887001939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (29)

References (9)
  • 2
    • 0038002768 scopus 로고    scopus 로고
    • Rediscovering workflow models from event-based data using Little Thumb
    • A. Weijters and W. M. P. van der Aalst. Rediscovering workflow models from event-based data using Little Thumb. Integrated Computer-Aided Engineering, 10(2):151-162, 2003.
    • (2003) Integrated Computer-Aided Engineering , vol.10 , Issue.2 , pp. 151-162
    • Weijters, A.1    van der Aalst, W.M.P.2
  • 4
    • 0348230609 scopus 로고    scopus 로고
    • Discovering models of behavior for concurrent workflows
    • Jonathan E. Cook, Zhidian Du, Chongbing Liu, and Alexander L.Wolf. Discovering models of behavior for concurrent workflows. Computers in Industry, 53(3):297-319, 2004.
    • (2004) Computers In Industry , vol.53 , Issue.3 , pp. 297-319
    • Cook, J.E.1    Zhidian, D.2    Liu, C.3    Wolf, A.L.4
  • 7
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • James F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.11 , pp. 832-843
    • Allen, J.F.1
  • 8
    • 0027694565 scopus 로고
    • Complexity and algorithms for reasoning about time: A graph-theoretic approach
    • Martin Charles Golumbic and Ron Shamir. Complexity and algorithms for reasoning about time: a graph-theoretic approach. J. ACM, 40(5):1108-1133, 1993.
    • (1993) J. ACM , vol.40 , Issue.5 , pp. 1108-1133
    • Golumbic, M.C.1    Shamir, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.