{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:09:38Z","timestamp":1729642178564,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/meco.2015.7181920","type":"proceedings-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T12:26:30Z","timestamp":1439468790000},"page":"268-271","source":"Crossref","is-referenced-by-count":1,"title":["Fast algorithm for enumerating frequent itemset pairs in database of transactions"],"prefix":"10.1109","author":[{"given":"Savo","family":"Tomovic","sequence":"first","affiliation":[]},{"given":"Predrag","family":"Stanisic","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Mathematical Tools for Data Mining - Set Theory, Partial Orders, Combinatorics","year":"2008","author":"simovici","key":"ref4"},{"key":"ref3","article-title":"A New Data Structure for Frequent Itemset Mining: TS-Tree","author":"stani\u0161i?","year":"2009","journal-title":"Proceedings of 4th South East European Doctoral Student Conference"},{"key":"ref6","article-title":"Mining the Most k-Frequent Itemsets with TS-Tree","author":"tomovi?","year":"2009","journal-title":"Proceedings of IADIS International Conference on WWW\/Internet 2009"},{"key":"ref5","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":"stani\u0161i?","year":"2010","journal-title":"International Journal of Computers Communication & Control"},{"key":"ref8","article-title":"Adaptive andresource-aware mining of frequent sets","author":"orlando","year":"2002","journal-title":"Proceedings of the 2002 IEEE International Conference on Data Mining IEEE Computer Society"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-44801-2_8","article-title":"Enhancing the apriori algorithm for frequent set counting","volume":"2114","author":"orlando","year":"2001","journal-title":"Proc Int Conf on Data Warehousing and Knowledge Discovery"},{"key":"ref2","article-title":"Apriori Multiple Algorithm for Mining Association Rules","volume":"37","author":"stani\u0161i?","year":"2008","journal-title":"information technology and control"},{"journal-title":"Survey on Frequent Pattern Mining","year":"2003","author":"goethls","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"}],"event":{"name":"2015 4th Mediterranean Conference on Embedded Computing (MECO)","start":{"date-parts":[[2015,6,14]]},"location":"Budva, Montenegro","end":{"date-parts":[[2015,6,18]]}},"container-title":["2015 4th Mediterranean Conference on Embedded Computing (MECO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7164208\/7181853\/07181920.pdf?arnumber=7181920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T13:35:58Z","timestamp":1498224958000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7181920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/meco.2015.7181920","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}