{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:21:40Z","timestamp":1730208100788,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/cit.2008.4594653","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:40:13Z","timestamp":1218667213000},"page":"77-82","source":"Crossref","is-referenced-by-count":0,"title":["Mining Top-K Closed Itemsets Using Best-First Search"],"prefix":"10.1109","author":[{"given":"Panida","family":"Songram","sequence":"first","affiliation":[]},{"given":"Veera","family":"Boonjing","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","first-page":"460","article-title":"an fp-tree approach for mining n-most interesting itemsets","author":"cheng","year":"2002","journal-title":"Proc of the SPIE Conference on Data Mining"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/TKDE.2004.44"},{"key":"11","first-page":"16","article-title":"an efficient algorithm for enumerating closed patterns in transaction databases","author":"uno","year":"2004","journal-title":"Proc of the 7th International Conference on Discovery Science Padova Italy 2-5"},{"year":"0","key":"12"},{"year":"0","key":"3"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/TKDE.2006.10"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1007\/978-3-540-75488-6_29"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1007\/s10115-004-0175-4"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"6","first-page":"211","article-title":"mining top-k frequent closed patterns without minimum support","author":"han","year":"2002","journal-title":"Proc of the 2002 IEEE International Conference on Data Mining"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/TKDE.2005.81"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/11731139_50"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1109\/ICDM.2003.1250939"},{"key":"8","first-page":"398","article-title":"discovering frequent closed itemsets for association rules","volume":"1540","author":"pasquier","year":"1999","journal-title":"LNCS"}],"event":{"name":"2008 8th IEEE International Conference on Computer and Information Technology","start":{"date-parts":[[2008,7,8]]},"location":"Sydney, NSW","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 8th IEEE International Conference on Computer and Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586225\/4594630\/04594653.pdf?arnumber=4594653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T06:32:18Z","timestamp":1555050738000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4594653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cit.2008.4594653","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}