{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:22:42Z","timestamp":1761862962726},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/hpcs.2010.5547082","type":"proceedings-article","created":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T18:21:20Z","timestamp":1282155680000},"page":"521-528","source":"Crossref","is-referenced-by-count":26,"title":["Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses"],"prefix":"10.1109","author":[{"given":"B","family":"Negrevergne","sequence":"first","affiliation":[]},{"given":"A","family":"Termier","sequence":"additional","affiliation":[]},{"given":"J","family":"Me\u0301haut","sequence":"additional","affiliation":[]},{"given":"T","family":"Uno","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"721","article-title":"gspan: Graph-based substructure pattern mining","author":"van","year":"2002","journal-title":"ICDM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.13"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687706"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","article-title":"An efficient algorithm for enumerating closed patterns in transaction databases","author":"uno","year":"2004","journal-title":"Discovery Science"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2363.2433"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133916"},{"key":"ref16","first-page":"1","article-title":"An output-polynomial time algorithm for mining frequent closed attribute trees","author":"arimura","year":"2005","journal-title":"ILP"},{"key":"ref17","first-page":"724","article-title":"A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence","year":"2009","journal-title":"Algorithms and Computation"},{"journal-title":"Fimi repository website","year":"2003","author":"goethals","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref6","article-title":"Découverte d'itemsets fréquents fermés sur architecture multicoeurs","author":"negrevergne","year":"2010","journal-title":"Extraction et Gestion des Connaissances EGC'04"},{"key":"ref5","article-title":"Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets","author":"uno","year":"2004","journal-title":"FIMI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009773317876"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/69.553164"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"VLDB"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.15"}],"event":{"name":"Simulation (HPCS 2010)","start":{"date-parts":[[2010,6,28]]},"location":"Caen","end":{"date-parts":[[2010,7,2]]}},"container-title":["2010 International Conference on High Performance Computing & Simulation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5538704\/5547051\/05547082.pdf?arnumber=5547082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T02:46:18Z","timestamp":1559443578000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5547082\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/hpcs.2010.5547082","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}