{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:24:52Z","timestamp":1758270292889},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10115-004-0176-3","type":"journal-article","created":{"date-parts":[[2004,8,30]],"date-time":"2004-08-30T22:50:04Z","timestamp":1093906204000},"page":"458-475","source":"Crossref","is-referenced-by-count":21,"title":["A high-performance distributed algorithm for mining association rules"],"prefix":"10.1007","volume":"7","author":[{"given":"Assaf","family":"Schuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Trock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,1]]},"reference":[{"key":"176_CRagrawal93mining","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, Washington, DC, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"176_CRAgrawal-parallel","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"Agrawal","year":"1996","unstructured":"Agrawal R, Shafer J (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng 8:962\u2013969","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"176_CRA-Priori","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases (VLDB\u201994), Santiago, Chile, pp 487\u2013499"},{"key":"176_CRhipc00pctree","doi-asserted-by":"crossref","unstructured":"Ananthanarayana VS, Subramanian DK, Murty MN (2000) Scalable, distributed and dynamic mining of association rules. In: Proceedings of HiPC\u201900, Bangalore, India, pp 559\u2013566","DOI":"10.1007\/3-540-44467-X_51"},{"key":"176_CRbrin97dic","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/253262.253325","volume":"6","author":"Brin","year":"1997","unstructured":"Brin S, Motwani R, Ullman J, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. SIGMOD Rec 6:255\u2013264","journal-title":"SIGMOD Rec"},{"key":"176_CRFDM","doi-asserted-by":"crossref","unstructured":"Cheung D, Han J, Ng V, Fu A, Fu Y (1996) A fast distributed algorithm for mining association rules. In: Proceedings of the 1996 international conference on parallel and distributed information systems, Miami Beach, Florida, pp 31\u201344","DOI":"10.1109\/PDIS.1996.568665"},{"key":"176_CRSkewness","doi-asserted-by":"crossref","unstructured":"Cheung D, Xiao Y (1998) Effect of data skewness in parallel mining of association rules. In: 12th Pacific-Asia conference on knowledge discovery and data mining, Melbourne, Australia, pp 48\u201360","DOI":"10.1007\/3-540-64383-4_5"},{"key":"176_CRtour","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"Hagerup","year":"1989","unstructured":"Hagerup T, Rub C (1989\/90) A guided tour of Chernoff bounds. Inf Process Lett 33:305\u2013308","journal-title":"Inf Process Lett"},{"key":"176_CRIDD-parallel","first-page":"352","volume":"12","author":"Han","year":"2000","unstructured":"Han E-HS, Karypis G, Kumar V (2000) Scalable parallel data mining for association rules. IEEE Trans Knowl Data Eng 12:352\u2013377","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"176_CRTaxonomies-Han","unstructured":"Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: Proceedings of the 21st international conference on very large data bases (VLDB\u201995), Zurich, Switzerland, pp 420\u2013431"},{"key":"176_CRno-candidates","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (1999) Mining frequent patterns without candidate generation. Technical Report 99-12, Simon Fraser University","DOI":"10.1145\/335191.335372"},{"key":"176_CRparallel-FP","unstructured":"Iko P, Kitsuregawa M (2003) Parallel fp-growth on PC cluster. In: Seventh Pacific-Asia conference of knowledge discovery and data mining (PAKDD03)"},{"key":"176_CRDSM","unstructured":"Jarai Z, Virmani A, Iftode L (1998) Towards a cost-effective parallel data mining approach. Orlando, Florida"},{"key":"176_CRlin98pincer","doi-asserted-by":"crossref","unstructured":"Lin D-I, Kedem ZM (1998) Pincer search: a new algorithm for discovering the maximum frequent set. In: Extending database technology, pp 105\u2013119","DOI":"10.1007\/BFb0100980"},{"key":"176_CRDHP","doi-asserted-by":"crossref","unstructured":"Park JS, Chen M-S, Yu PS (1995a) An effective hash-based algorithm for mining association rules. In: Proceedings of ACM SIGMOD international conference on management of data, San Jose, CA, pp 175\u2013186","DOI":"10.1145\/223784.223813"},{"key":"176_CRPDM","doi-asserted-by":"crossref","unstructured":"Park JS, Chen M-S, Yu PS (1995b) Efficient parallel data mining for association rules. In: Proceedings of the ACM international conference on information and knowledge management, Baltimore, MD, pp 31\u201336","DOI":"10.1145\/221270.221320"},{"key":"176_CRconstraints-pei","doi-asserted-by":"crossref","unstructured":"Pei J, Han J (2000) Can we push more constraints into frequent pattern mining? In: Proceedings of the ACM SIGKDD conference on knowledge discovery and data mining, Boston, MA, pp 350\u2013354","DOI":"10.1145\/347090.347166"},{"key":"176_CRpartition","unstructured":"Savasere A, Omiecinski E, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st international conference on very large databases (VLDB\u201995), pp 432\u2013444"},{"key":"176_CRDDM","doi-asserted-by":"crossref","unstructured":"Schuster A, Wolff R (2001) Communication-efficient distributed mining of association rules. In: Proceedings of the 2001 ACM SIGMOD international conference on management of data, Santa Barbara, CA, pp 473\u2013484","DOI":"10.1145\/375663.375728"},{"key":"176_CRGEN","unstructured":"Srikant R (1993) Synthetic data generation code for association and sequential patterns. Available from the IBM Quest web site at http:\/\/www.almaden.ibm.com\/cs\/quest\/"},{"key":"176_CRTaxonomies-Sarikant","unstructured":"Srikant R, Agrawal R (1994) Mining generalized association rules. In: Proceedings of the 20th international conference on very large databases (VLDB\u201994), Santiago, Chile, pp 407\u2013419"},{"key":"176_CRquantitative-srikant","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: Jagadish HV, Mumick IS (eds) Proceedings of the 1996 ACM SIGMOD international conference on management of data, Montreal, Quebec, Canada, pp 1\u201312","DOI":"10.1145\/233269.233311"},{"key":"176_CRconstraints-sarikant","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Heckerman D, Mannila H, Pregibon D, Uthurusamy R (eds) Proceedings of the ACM SIGKDD conference on knowledge discovery and data mining. AAAI Press, pp 67\u201373"},{"key":"176_CRthomas00incremental","doi-asserted-by":"crossref","unstructured":"Thomas S, Chakravarthy S (2000) Incremental mining of constrained associations. In: Proceedings of HiPC\u201900, Bangalore, India, pp 547\u2013558","DOI":"10.1007\/3-540-44467-X_50"},{"key":"176_CRtoivonen-sampling","unstructured":"Toivonen H (1996) Sampling large databases for association rules. In: Proceedings of the 22nd international conference on very large databases (VLDB\u201996), pp 134\u2013145"},{"key":"176_CRparallel-no-candidates","doi-asserted-by":"crossref","unstructured":"Zaiane OR, El-Hajj M, Lu P (2001) Fast parallel association rules mining without candidacy generation. In: IEEE 2001 international conference on data mining (ICDM\u20192001), pp 665\u2013668","DOI":"10.1109\/ICDM.2001.989600"},{"key":"176_CRSM-ZAKI","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Ogihara M, Parthasarathy S, Li W (1996) Parallel data mining for association rules on shared-memory multi-processors. In: Proceedings of the Supercomputing\u201996, Pittsburg, PA, pp 17\u201322","DOI":"10.1145\/369028.369117"},{"key":"176_CRzaki97serial","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997a) New algorithms for fast discovery of association rules. Technical Report TR651, Rensselaer Polytechnic Institute","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"176_CRzaki97parallel","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"Zaki","year":"1997","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997b) Parallel algorithms for discovery of association rules. Data Min Knowl Discov 1:343\u2013373","journal-title":"Data Min Knowl Discov"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0176-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-004-0176-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-004-0176-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T09:01:54Z","timestamp":1624611714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-004-0176-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s10115-004-0176-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}