{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:43:11Z","timestamp":1742798591689},"reference-count":18,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdm.2003.1250932","type":"proceedings-article","created":{"date-parts":[[2004,4,23]],"date-time":"2004-04-23T18:38:15Z","timestamp":1082745495000},"page":"291-298","source":"Crossref","is-referenced-by-count":14,"title":["A high-performance distributed algorithm for mining association rules"],"prefix":"10.1109","author":[{"given":"A.","family":"Schuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Trock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"105","article-title":"Pincer search: A new algorithm for discovering the maximum frequent set","author":"lin","year":"1998","journal-title":"Extending Database Technology"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223813"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/221270.221320"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347166"},{"key":"ref14","first-page":"432","article-title":"An efficient algorithm for mining association rules in large databases","author":"savasere","year":"1995","journal-title":"The VLDB Journal"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375728"},{"key":"ref16","first-page":"407","article-title":"Mining generalized association rules","author":"srikant","year":"1994","journal-title":"Proc 20th Int l Conf Very Large Databases (VLDB 94)"},{"key":"ref17","first-page":"134","article-title":"Sampling large databases for association rules","author":"toivonen","year":"1996","journal-title":"The VLDB Journal"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989600"},{"key":"ref4","first-page":"559","article-title":"Scalable, distributed and dynamic mining of association rules","author":"ananthanarayana","year":"2000","journal-title":"Proceedings of HiPC'00"},{"key":"ref3","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc 20th Int l Conf Very Large Databases (VLDB 94)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/PDIS.1996.568665"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253325"},{"key":"ref8","article-title":"Mining frequent patterns without candidate generation","author":"han","year":"1999","journal-title":"Technical Report 99&#x2013;12"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90214-I"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/69.553164"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref9","article-title":"Towards a cost-effective parallel data mining approach","author":"jarai","year":"1998","journal-title":"Workshop on High Performance Data Mining (held in conjunction with IPPS'98)"}],"event":{"name":"Third IEEE International Conference on Data Mining","acronym":"ICDM-03","location":"Melbourne, FL, USA"},"container-title":["Third IEEE International Conference on Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8854\/27998\/01250932.pdf?arnumber=1250932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T19:13:01Z","timestamp":1489432381000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icdm.2003.1250932","relation":{},"subject":[]}}