{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:25Z","timestamp":1740548065916,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229377"},{"type":"electronic","value":"9783540300762"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30076-2_33","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T17:11:40Z","timestamp":1284657100000},"page":"331-340","source":"Crossref","is-referenced-by-count":2,"title":["A Tree Partitioning Method for Memory Management in Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Shakil","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Frans","family":"Coenen","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Leng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R., Aggarwal, C., Prasad, V.: Depth First Generation of Long Patterns. In: Proc. of the ACM KDD Conference on Management of Data, Boston, pp. 108\u2013118 (2000)","DOI":"10.1145\/347090.347114"},{"key":"33_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th VLDB Conference, Santiago, Santiago, Chile, September 1994, pp. 487\u2013499 (1994)"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently Mining Long Pattern from Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data, pp. 85\u201393 (1998)","DOI":"10.1145\/276305.276313"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. In: Proc. of the 15th Int\u2019l Conference on Data Engineering (1999)","DOI":"10.1109\/ICDE.1999.754924"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.R.: Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint. In: Proc. IDEAS 2003 Symposium, pp. 111\u2013116 (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"33_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44794-6_5","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"F. Coenen","year":"2001","unstructured":"Coenen, F., Goulbourne, G., Leng, P.: Computing Association Rules using Partial Totals. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol.\u00a02168, pp. 54\u201366. Springer, Heidelberg (2001)"},{"key":"33_CR7","first-page":"53","volume-title":"Research and Development in Intelligent Systems XVIII (Proc ES 2001 Conference, Cambridge)","author":"F. Coenen","year":"2002","unstructured":"Coenen, F., Leng, P.: Optimising Association rule Algorithms using Itemset Ordering. In: Bramer, M., Coenen, F., Preece, A. (eds.) Research and Development in Intelligent Systems XVIII (Proc ES 2001 Conference, Cambridge), pp. 53\u201366. Springer, London (2002)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-45228-7_37","volume-title":"Data Warehousing and Knowledge Discovery","author":"M. El-Hajj","year":"2003","unstructured":"El-Hajj, M., Zaiane, O.R.: Non Recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2003. LNCS, vol.\u00a02737, pp. 371\u2013380. Springer, Heidelberg (2003)"},{"key":"33_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0950-7051(00)00055-1","volume":"13","author":"G. Goulbourne","year":"2000","unstructured":"Goulbourne, G., Coenen, F., Leng, P.: Algorithms for Computing Association Rules Using a Partial-Support Tree. J. Knowledge-Based System\u00a013, 141\u2013149 (2000) (also Proc ES 1999)","journal-title":"J. Knowledge-Based System"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of the ACM SIGMOD Conference on Management of Data, Dallas, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"33_CR11","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proc ACM SIGMOD Workshop on Data Mining and Knowledge Discovery, pp. 11\u201320 (2000)"},{"key":"33_CR12","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. of the 21th VLDB Conference, Zurich, Swizerland, pp. 432\u2013444 (1995)"},{"key":"33_CR13","unstructured":"Toivonen, H.: Sampling Large Databases for Association Rules. In: Proc. of the 22th VLDB Conference, Mumbai, India, pp. 1\u201312 (1996)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for fast discovery of association rules. Technical report 651, University of Rochester, Computer Science Department, New York (July 1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30076-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T21:50:36Z","timestamp":1740520236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30076-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229377","9783540300762"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30076-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}