{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:44:23Z","timestamp":1730281463730,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/meco.2014.6862711","type":"proceedings-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T16:14:10Z","timestamp":1406736850000},"page":"260-263","source":"Crossref","is-referenced-by-count":1,"title":["Upper bounds on the number of candidate itemsets in Apriori like algorithms"],"prefix":"10.1109","author":[{"given":"Savo","family":"Tomovic","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Natural Sciences University of Montenegro Podgorica, Montenegro"}]},{"given":"Predrag","family":"Stani\u0161i\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Natural Sciences University of Montenegro Podgorica, Montenegro"}]}],"member":"263","reference":[{"key":"3","article-title":"Apriori multiple algorithm for mining association rules","volume":"37","author":"stanii","year":"2008","journal-title":"information technology and control"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"1","article-title":"Frequent Itemset Mining as Set Intersection Problem","author":"stanii","year":"2013","journal-title":"MECO 2013 Budva Montenegro"},{"key":"7","article-title":"Mining the most k-frequent itemsets with ts-Tree","volume":"2009","author":"tomovi","year":"2009","journal-title":"Proceedings of the IADIS International Conference WWW\/Internet"},{"key":"6","doi-asserted-by":"crossref","first-page":"567","DOI":"10.15837\/ijccc.2010.4.2515","article-title":"A new rymon tree based procedure for mining statistically significant frequent Itemsets","volume":"5","author":"stanii","year":"2010","journal-title":"International Journal of Computers Communication &Control"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-201-2","author":"simovici","year":"2008","journal-title":"Mathematical Tools for Data Mining-Set Theory"},{"key":"4","article-title":"A new data structure for frequent itemset mining: Ts-Tree","author":"stanii","year":"2009","journal-title":"Proceedings of 4th South East European Doctoral Student Conference"}],"event":{"name":"2014 3rd Mediterranean Conference on Embedded Computing (MECO)","start":{"date-parts":[[2014,6,15]]},"location":"Budva, Montenegro","end":{"date-parts":[[2014,6,19]]}},"container-title":["2014 3rd Mediterranean Conference on Embedded Computing (MECO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6851984\/6862649\/06862711.pdf?arnumber=6862711","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:40:17Z","timestamp":1710268817000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6862711\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/meco.2014.6862711","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}