{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T04:30:49Z","timestamp":1772166649639,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2021,12]]},"abstract":"Abstract<\/jats:title>\n \n Process discovery helps companies automatically discover their existing business processes based on the vast, stored event log. The process discovery algorithms have been developed rapidly to discover several types of relations, i.e., choice relations, non-free choice relations with invisible tasks. Invisible tasks in non-free choice, introduced by\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n method, is a type of relationship that combines the non-free choice and the invisible task.\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n proposed rules of ordering relations of two activities for determining invisible tasks in non-free choice. The event log records sequences of activities, so the rules of\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n check the combination of invisible task within non-free choice. The checking processes are time-consuming and result in high computing times of\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . This research proposes Graph-based Invisible Task (GIT) method to discover efficiently invisible tasks in non-free choice. GIT method develops sequences of business activities as graphs and determines rules to discover invisible tasks in non-free choice based on relationships of the graphs. The analysis of the graph relationships by rules of GIT is more efficient than the iterative process of checking combined activities by\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . This research measures the time efficiency of storing the event log and discovering a process model to evaluate GIT algorithm. Graph database gains highest storing computing time of batch event logs; however, this database obtains low storing computing time of streaming event logs. Furthermore, based on an event log with 99 traces, GIT algorithm discovers a process model 42 times faster than \u03b1\n ++<\/jats:sup>\n and 43 times faster than \u03b1\n $<\/jats:sup>\n . GIT algorithm can also handle 981 traces, while \u03b1\n ++<\/jats:sup>\n and \u03b1\n $<\/jats:sup>\n has maximum traces at 99 traces. Discovering a process model by GIT algorithm has less time complexity than that by\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , wherein GIT obtains\n \n \n $$O(n^{3} )$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n n<\/mml:mi>\n 3<\/mml:mn>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n $$\\alpha ^{\\$ }$$<\/jats:tex-math>\n \n \n \u03b1<\/mml:mi>\n $<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n obtains\n \n \n $$O(n^{4} )$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n n<\/mml:mi>\n 4<\/mml:mn>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Those results of the evaluation show a significant improvement of GIT method in term of time efficiency.\n <\/jats:p>","DOI":"10.1186\/s40537-021-00487-x","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T12:04:04Z","timestamp":1629806644000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Improving efficiency for discovering business processes containing invisible tasks in non-free choice"],"prefix":"10.1186","volume":"8","author":[{"given":"Riyanarto","family":"Sarno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kelly Rossa","family":"Sungkono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad","family":"Taufiqulsa\u2019di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendra","family":"Darmawan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Achmad","family":"Fahmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuwat","family":"Triyana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,24]]},"reference":[{"key":"487_CR1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0187-2","author":"AV Mantzaris","year":"2019","unstructured":"Mantzaris AV, Walker TG, Taylor CE, Ehling D. Adaptive network diagram constructions for representing big data event streams on monitoring dashboards. J Big Data. 2019. https:\/\/doi.org\/10.1186\/s40537-019-0187-2.","journal-title":"J Big Data"},{"key":"487_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-018-0162-3","volume":"6","author":"A Ismail","year":"2019","unstructured":"Ismail A, Truong HL, Kastner W. Manufacturing process data analysis pipelines: a requirements analysis and survey. J Big Data. 2019;6:1\u201326. https:\/\/doi.org\/10.1186\/s40537-018-0162-3.","journal-title":"J Big Data"},{"key":"487_CR3","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-020-00291-z","author":"MM Hasan","year":"2020","unstructured":"Hasan MM, Popp J, Ol\u00e1h J. Current landscape and influence of big data on finance. J Big Data. 2020. https:\/\/doi.org\/10.1186\/s40537-020-00291-z.","journal-title":"J Big Data."},{"key":"487_CR4","first-page":"109","volume-title":"Mining invisible tasks in non-free choice constructs","author":"Q Guo","year":"2015","unstructured":"Guo Q, Wen L, Wang J, Yan Z, Yu PS. Mining invisible tasks in non-free choice constructs. Cham: Springer; 2015. p. 109\u201310."},{"key":"487_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0277-1","volume":"7","author":"R Sarno","year":"2020","unstructured":"Sarno R, Sinaga F, Sungkono KR. Anomaly detection in business processes using process mining and fuzzy association rule learning. J Big Data. 2020;7:1\u201319.","journal-title":"J Big Data"},{"key":"487_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1186\/s40537-020-00346-1","volume":"7","author":"K Al Jallad","year":"2020","unstructured":"Al Jallad K, Aljnidi M, Desouki MS. Anomaly detection optimization using big data and deep learning to reduce false-positive. J Big Data. 2020;7:68. https:\/\/doi.org\/10.1186\/s40537-020-00346-1.","journal-title":"J Big Data"},{"key":"487_CR7","doi-asserted-by":"publisher","first-page":"101712","DOI":"10.1016\/j.evalprogplan.2019.101712","volume":"77","author":"EA Eboreime","year":"2019","unstructured":"Eboreime EA, Idika O, Omitiran K, Eboreime O, Ibisomi L. Primary healthcare planning, bottleneck analysis and performance improvement: an evaluation of processes and outcomes in a Nigerian context. Eval Program Plan. 2019;77:101712.","journal-title":"Eval Program Plan"},{"key":"487_CR8","unstructured":"Weijters AJMM, Van Der Aalst WMP. Process mining with the heuristics miner-algorithm. Tech Rep WP. Technische Universiteit Eindhoven. 2006;166:1\u201334."},{"key":"487_CR9","doi-asserted-by":"publisher","unstructured":"Leemans SJJ, Fahland D, van der Aalst WMP. Discovering block-structured process models from incomplete event logs. In: International conference on applications and theory of petri nets and concurrency. 2014;9698:91\u2013110.\u00a0https:\/\/doi.org\/10.1007\/978-3-319-07734-5_6.","DOI":"10.1007\/978-3-319-07734-5_6"},{"key":"487_CR10","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.future.2019.03.048","volume":"98","author":"Z Yan","year":"2019","unstructured":"Yan Z, Sun B, Chen Y, Wen L, Hu L, Wang J, et al. Decomposed and parallel process discovery: a framework and application. Future Gener Comput Syst. 2019;98:392\u2013405.","journal-title":"Future Gener Comput Syst"},{"key":"487_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dss.2017.04.005","volume":"100","author":"SKLM vanden Broucke","year":"2017","unstructured":"vanden Broucke SKLM, De Weerdt J. Fodina: a robust and flexible heuristic process discovery technique. Decis Support Syst. 2017;100:109\u201318.","journal-title":"Decis Support Syst"},{"key":"487_CR12","first-page":"971","volume":"14","author":"SR Hermawan","year":"2018","unstructured":"Hermawan SR. A more efficient deterministic algorithm in process. Int J Innov Comput Inf Control. 2018;14:971\u201395.","journal-title":"Int J Innov Comput Inf Control"},{"key":"487_CR13","first-page":"85","volume":"12","author":"R Sarno","year":"2019","unstructured":"Sarno R, Sungkono KR, Johanes R, Sunaryono D. Graph-based algorithms for discovering a process model containing invisible tasks. Int J Intell Eng Syst. 2019;12:85\u201394.","journal-title":"Int J Intell Eng Syst"},{"key":"487_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-319-23063-4_7","volume-title":"Mining invisible tasks in non-free-choice constructs","author":"Q Guo","year":"2015","unstructured":"Guo Q, Wen L, Wang J, Yan Z, Yu PS. Mining invisible tasks in non-free-choice constructs. Lecture notes in computer science. Cham: Springer International Publishing; 2015. p. 109\u201325."},{"key":"487_CR15","first-page":"127","volume":"13","author":"I Waspada","year":"2020","unstructured":"Waspada I, Sarno R, Sungkono KR. An improved method of parallel model detection for graph-based process model discovery. Int J Intell Eng Syst. 2020;13:127\u201338.","journal-title":"Int J Intell Eng Syst"},{"key":"487_CR16","first-page":"1285","volume":"14","author":"KR Sungkono","year":"2018","unstructured":"Sungkono KR, Sarno R. Constructing control-flow patterns containing invisible task and non-free choice based on declarative model. Int J Innov Comput Inf Control. 2018;14:1285\u201399.","journal-title":"Int J Innov Comput Inf Control"},{"key":"487_CR17","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"WMP van der Aalst","year":"2004","unstructured":"van der Aalst WMP, Weijters T, Maruster L. Workflow mining: discovering process models from event logs. IEEE Trans Knowl Data Eng. 2004;16:1128\u201342.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"487_CR18","unstructured":"De Medeiros AKA, Van Dongen BF, van der Aalst WMP, Weijters AJMM. Process mining: extending the \u03b1-algorithm to mine short loops. Eindhoven University of Technology Eindhoven; 2004. p. 1\u201325."},{"key":"487_CR19","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.datak.2010.06.001","volume":"69","author":"L Wen","year":"2010","unstructured":"Wen L, Wang J, van der Aalst WMP, Huang B, Sun J. Mining process models with prime invisible tasks. Data Knowl Eng. 2010;69:999\u20131021.","journal-title":"Data Knowl Eng"},{"key":"487_CR20","first-page":"290","volume":"11","author":"R Sarno","year":"2016","unstructured":"Sarno R, Sungkono KR. Hidden Markov model for process mining of parallel business processes. Int Rev Comput Softw. 2016;11:290\u2013300.","journal-title":"Int Rev Comput Softw"},{"key":"487_CR21","first-page":"539","volume":"11","author":"R Sarno","year":"2016","unstructured":"Sarno R, Sungkono KR. Coupled hidden Markov model for process mining of invisible prime tasks. Int Rev Comput Softw. 2016;11:539\u201347.","journal-title":"Int Rev Comput Softw"},{"key":"487_CR22","first-page":"85","volume":"12","author":"R Sarno","year":"2019","unstructured":"Sarno R, Sungkono KR, Johanes R, Sunaryono D. Graph-based algorithms for discovering a process model containing invisible tasks. Intell Netw Syst Soc. 2019;12:85\u201394.","journal-title":"Intell Netw Syst Soc"},{"key":"487_CR23","doi-asserted-by":"crossref","unstructured":"Sungkono KR, Sarno R. Patterns of fraud detection using coupled hidden Markov Model. In: 2017 3rd international conference on science in information technology (ICSITech), Bandung. IEEE; 2017. p. 235\u201340.","DOI":"10.1109\/ICSITech.2017.8257117"},{"key":"487_CR24","unstructured":"Russell N, Hofstede AHM, Aalst WMP Van Der, Mulyar N. Workflow control-flow patterns: a revised view. BPM Center Report BPM-06-22. Netherlands; 2006. p. 6\u201322."},{"key":"487_CR25","doi-asserted-by":"crossref","unstructured":"Sarno R, Sungkono KR. Coupled hidden Markov model for process discovery of non-free choice and invisible prime tasks. In: 4th information systems international conference. Elsevier B.V.; 2017. p. 134\u201341.","DOI":"10.1016\/j.procs.2017.12.139"},{"key":"487_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process mining discovery, conformance and enhancement of business processes","author":"WMP Van Der Aalst","year":"2011","unstructured":"Van Der Aalst WMP. Process mining discovery, conformance and enhancement of business processes. Dordrecht: Springer; 2011."},{"key":"487_CR27","doi-asserted-by":"publisher","first-page":"2808","DOI":"10.12928\/telkomnika.v16i6.10568","volume":"16","author":"H Darmawan","year":"2018","unstructured":"Darmawan H, Sarno R, Ahmadiyah AS, Sungkono KR, Wahyuni CS. Anomaly detection based on control-flow pattern of parallel business processes. TELKOMNIKA. 2018;16:2808\u201315.","journal-title":"TELKOMNIKA"},{"key":"487_CR28","doi-asserted-by":"crossref","unstructured":"Buijs JCAM, Van Dongen BF, van Der Aalst WMP. On the role of fitness, precision, generalization and simplicity in process discovery. In: OTM conferences; 2012. p. 305\u201322.","DOI":"10.1007\/978-3-642-33606-5_19"},{"key":"487_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218843014400012","volume":"23","author":"JCAM Buijs","year":"2014","unstructured":"Buijs JCAM, Van Dongen BF, Van Der Aalst WMP. Quality dimensions in process discovery: the importance of fitness, precision, generalization and simplicity. Int J Coop Inf Syst. 2014;23:1\u201339.","journal-title":"Int J Coop Inf Syst"},{"key":"487_CR30","doi-asserted-by":"publisher","unstructured":"van Dongen B. BPI challenge 2012; 2012. https:\/\/doi.org\/10.4121\/uuid:3926db30-f712-4394-aebc-75976070e91f.","DOI":"10.4121\/uuid:3926db30-f712-4394-aebc-75976070e91f"},{"key":"487_CR31","doi-asserted-by":"publisher","unstructured":"van Dongen B. Real-life event logs\u2014hospital log; 2011. https:\/\/doi.org\/10.4121\/uuid:d9769f3d-0ab0-4fb8-803b-0d1120ffcf54.","DOI":"10.4121\/uuid:d9769f3d-0ab0-4fb8-803b-0d1120ffcf54"},{"key":"487_CR32","unstructured":"van Dongen B. BPI challenge 2020: domestic declarations; 2020."},{"key":"487_CR33","first-page":"137","volume":"5","author":"R Sarno","year":"2019","unstructured":"Sarno R, Sungkono KR. A survey of graph-based algorithms for discovering business processes. Int J Adv Intell Inf. 2019;5:137\u201349.","journal-title":"Int J Adv Intell Inf"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-021-00487-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-021-00487-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-021-00487-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T18:49:41Z","timestamp":1673117381000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-021-00487-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,24]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["487"],"URL":"https:\/\/doi.org\/10.1186\/s40537-021-00487-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-71558\/v1","asserted-by":"object"}]},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,24]]},"assertion":[{"value":"4 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"113"}}