iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/RIVF55975.2022.10013891
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:53:58Z","timestamp":1730292838861,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T00:00:00Z","timestamp":1671494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T00:00:00Z","timestamp":1671494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100014809","name":"Technology Agency of the Czech Republic","doi-asserted-by":"publisher","award":["FW01010381"],"id":[{"id":"10.13039\/100014809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,20]]},"DOI":"10.1109\/rivf55975.2022.10013891","type":"proceedings-article","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T13:54:15Z","timestamp":1674050055000},"page":"167-172","source":"Crossref","is-referenced-by-count":2,"title":["Mining Top-K High Utility Itemsets Using Bio-Inspired Algorithms with a Diversity within Population Framework"],"prefix":"10.1109","author":[{"given":"Nam Ngoc","family":"Pham","sequence":"first","affiliation":[{"name":"Tomas Bata University,Faculty of Applied Informatics,Zlín,Czech Republic"}]},{"given":"Zuzana Kominkova","family":"Oplatkova","sequence":"additional","affiliation":[{"name":"Tomas Bata University,Faculty of Applied Informatics,Zlín,Czech Republic"}]},{"given":"Huy Minh","family":"Huynh","sequence":"additional","affiliation":[{"name":"Tomas Bata University,Faculty of Applied Informatics,Zlín,Czech Republic"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[{"name":"HUTECH University,Ho Chi Minh City,Vietnam"}]}],"member":"263","reference":[{"key":"ref10","first-page":"253","article-title":"An efficient algorithm for high utility itemset mining","author":"tseng","year":"0","journal-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27060-9_44"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33858-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2750919"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2014.891839"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2016.07.006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2819162"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31087-4_63"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-140683"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942594"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"1215","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf on Very large Data Bases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.11.001"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","article-title":"Efficient Algorithms for Mining Top-K High Utility Itemsets","volume":"28","author":"wu","year":"2016","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"ref22","first-page":"107946","article-title":"An efficient method for mining sequential patterns with indices","author":"huynh","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63007-2_27"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/COMPENG50184.2022.9905433"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.04.016"}],"event":{"name":"2022 RIVF International Conference on Computing and Communication Technologies (RIVF)","start":{"date-parts":[[2022,12,20]]},"location":"Ho Chi Minh City, Vietnam","end":{"date-parts":[[2022,12,22]]}},"container-title":["2022 RIVF International Conference on Computing and Communication Technologies (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10013784\/10013785\/10013891.pdf?arnumber=10013891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T16:54:36Z","timestamp":1676912076000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10013891\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,20]]},"references-count":24,"URL":"http:\/\/dx.doi.org\/10.1109\/rivf55975.2022.10013891","relation":{},"subject":[],"published":{"date-parts":[[2022,12,20]]}}}