{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:41:24Z","timestamp":1759938084670,"version":"3.44.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2001,10,26]],"date-time":"2001-10-26T00:00:00Z","timestamp":1004054400000},"content-version":"vor","delay-in-days":786,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1016\/s0020-0255(99)00035-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"251-268","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["New algorithms for efficient mining of association rules"],"prefix":"10.1016","volume":"118","author":[{"given":"Li","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(99)00035-3_BIB1","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo. Fast discovery of association rules, in: Advances in Knowledge Discovery and Data Mining, ch. 12, AAAI\/MIT Press, Cambridge, MA, 1996"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami, Mining associations between sets of items in massive databases. in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, May 1993, pp. 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB3","doi-asserted-by":"crossref","unstructured":"R. Agrawal, J.C. Shafer, Parallel mining of association rules, IEEE Transactions on Knowledge and Data Engineering 8 (6) 1996","DOI":"10.1109\/69.553164"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB4","doi-asserted-by":"crossref","unstructured":"D.W. Cheung, Y. Xiao, Effect of data skewness in parallel mining of association rules, in: Proceedings of the Second Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), Melbourne, Australia, April 1998, pp. 48\u201360","DOI":"10.1007\/3-540-64383-4_5"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB5","doi-asserted-by":"crossref","unstructured":"D.-I. Lin, Z.M. Kedem, Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set, EDBT'98, March 1998","DOI":"10.1007\/BFb0100980"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB6","unstructured":"H. Mannila, H. Toivonen, A. Inkeri Verkamo, Efficient algorithms for discovering association rules, AAAI Workshop on Knowledge Discovery in Databases (KDD-94), July 1994, pp. 181\u2013192"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB7","doi-asserted-by":"crossref","unstructured":"G.D. Mulligan, D.G. Corneil, Corrections to Bierstone's algorithm for generating cliques, J. Association of Computing Machinery 19 (2) (1972) 244\u2013247","DOI":"10.1145\/321694.321698"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB8","doi-asserted-by":"crossref","unstructured":"J.S. Park, M.-S. Chen, P.S. Yu, An effective hash-based algorithm for mining association rules, in: Proceedings of the 1995 ACM-SIGMOD International Conference on Management of Data, San Jose, CA, May 1995","DOI":"10.1145\/223784.223813"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB9","unstructured":"J.S. Park, M.-S. Chen, P.S. Yu, Efficient parallel data mining for association rules, ACM CIKM '95, Baltimore, MD"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB10","unstructured":"A. Savasere, E. Omiecinski, St. Navathe, An efficient algorithm for mining association rules in large databases, in: Proceedings of the 21st VLDB Conference, Zurich, Switzerland, 1995"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB11","doi-asserted-by":"crossref","unstructured":"M.J. Zaki, S. Parthasarathy, M. Ogihara, W. Li, New parallel algorithms for fast discovery of association rules, in: Data Mining and Knowledge Discovery: Special Issue on Scalable High-Performance Computing for KDD, vol. 1, No. 4, December 1997, pp. 343\u2013373","DOI":"10.1023\/A:1009773317876"},{"key":"10.1016\/S0020-0255(99)00035-3_BIB12","unstructured":"M.J. Zaki, S. Parthasarathy, M. Ogihara, W. Li, New Algorithms for Fast Discovery of Association Rules, Technical Report URCS TR 651, University of Rochester, 1997"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T04:32:27Z","timestamp":1758083547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":12,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["S0020025599000353"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00035-3","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[1999,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New algorithms for efficient mining of association rules","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0255(99)00035-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}