{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:44:05Z","timestamp":1752551045508},"reference-count":10,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0950-7051(00)00055-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:40:45Z","timestamp":1027636845000},"page":"141-149","source":"Crossref","is-referenced-by-count":37,"title":["Algorithms for computing association rules using a partial-support tree"],"prefix":"10.1016","volume":"13","author":[{"given":"G.","family":"Goulbourne","sequence":"first","affiliation":[]},{"given":"F.","family":"Coenen","sequence":"additional","affiliation":[]},{"given":"P.","family":"Leng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0950-7051(00)00055-1_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami, Mining Association Rules Between Sets of Items in Large Databases, SIGMOD-93, May 1993, pp. 207\u2013216.","DOI":"10.1145\/170036.170072"},{"key":"10.1016\/S0950-7051(00)00055-1_BIB2","unstructured":"R. Agrawal, R. Srikant, Fast Algorithms for Mining Association Rules, in: Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994, pp. 487\u2013499."},{"key":"10.1016\/S0950-7051(00)00055-1_BIB3","unstructured":"M. Houtsma, A. Swami, Set-oriented mining of association rules, Research Report RJ 9567, IBM Almaden Research Centre, San Jose, CA, 1993."},{"key":"10.1016\/S0950-7051(00)00055-1_BIB4","unstructured":"A. Savasere, E. Omiecinski, S. Navathe, An efficient algorithm for mining association rules in large databases, in: Proceedings of the 21st VLDB Conference, Zurich, Switzerland, 1995, pp. 432\u2013444."},{"key":"10.1016\/S0950-7051(00)00055-1_BIB5","unstructured":"H. Toivonen, Sampling large databases for association rules, in: Proceedings of the 22nd VLDB Conference, Bombay, India, 1996."},{"key":"10.1016\/S0950-7051(00)00055-1_BIB6","doi-asserted-by":"crossref","unstructured":"M.J. Zaki, S. Parthasarathy, M. Ogihara, W. Li, New Algorithms for fast discovery of association rules, Technical report 651, University of Rochester, Computer Science Department, Rochester, NY, 1997.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"10.1016\/S0950-7051(00)00055-1_BIB7","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo, Efficiently mining long patterns from databases, in: Proceedings of the ACM-SIGMOD International Conference on Management of Data, 1998, pp. 85\u201393.","DOI":"10.1145\/276304.276313"},{"key":"10.1016\/S0950-7051(00)00055-1_BIB8","unstructured":"R. Rymon, Search Through Systematic Set Enumeration, in: Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pp. 539\u2013550."},{"key":"10.1016\/S0950-7051(00)00055-1_BIB9","unstructured":"F. Coenen, Partial Support, Department of Computer Science, University of Liverpool, Working Paper 4, http:\/\/www.csc.liv.ac.uk\/~graham_g\/kdfm.html, 1999."},{"key":"10.1016\/S0950-7051(00)00055-1_BIB10","unstructured":"F. Coenen, Partial Support Using a Partial Support Tree, Department of Computer Science, University of Liverpool, Working Paper 5, http:\/\/www.csc.liv.ac.uk\/~graham_g\/kdfm.html, 1999."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705100000551?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705100000551?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:20:11Z","timestamp":1580858411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705100000551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0950705100000551"],"URL":"https:\/\/doi.org\/10.1016\/s0950-7051(00)00055-1","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}