{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T23:14:40Z","timestamp":1775344480511,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3224217","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T18:23:47Z","timestamp":1669314227000},"page":"123301-123315","source":"Crossref","is-referenced-by-count":3,"title":["Mining High Utility Time Interval Sequences Using MapReduce Approach: Multiple Utility Framework"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1368-4993","authenticated-orcid":false,"given":"Sumalatha","family":"Saleti","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, SRM University AP, Guntur, Amaravati, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0183-4093","authenticated-orcid":false,"given":"T. Jaya","family":"Lakshmi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, SRM University AP, Guntur, Amaravati, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-2591","authenticated-orcid":false,"given":"Mohd Wazih","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Adama Science and Technology University, Adama, Ethiopia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.09.013"},{"key":"ref32","first-page":"9","article-title":"Mining high-utility itemsets with multiple minimum utility thresholds","author":"lin","year":"2015","journal-title":"Proc 8th Int Conf Comput Sci Softw Eng"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2981962"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-021-06298-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05767-0_21"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2478\/cait-2019-0032"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.12.012"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44403-1_5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.02.022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2420557"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2976662"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-021-03448-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.20965\/jaciii.2016.p1018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63579-8_17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3362070"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"},{"key":"ref27","first-page":"1","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf Very Large Data Bases"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347167"},{"key":"ref6","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"fournier-viger","year":"2017","journal-title":"Data Sci Pattern Recognit"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/956755.956788"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05767-0_13"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1259-2"},{"key":"ref2","first-page":"223","article-title":"SPIRIT: Sequential pattern mining with regular expression constraints","author":"garofalakis","year":"1999","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.10.1510.0066"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112967"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79457-6_8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.847741"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0957-4174(03)00075-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-021-05936-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.10.004"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09961173.pdf?arnumber=9961173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T15:56:58Z","timestamp":1669996618000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9961173\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3224217","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}