{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T17:33:43Z","timestamp":1768412023654,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"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":[[2007,4,3]]},"DOI":"10.1007\/s10115-006-0032-8","type":"journal-article","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T07:34:11Z","timestamp":1159947251000},"page":"287-311","source":"Crossref","is-referenced-by-count":113,"title":["CanTree: a canonical-order tree for incremental frequent-pattern mining"],"prefix":"10.1007","volume":"11","author":[{"given":"Carson Kai-Sang","family":"Leung","sequence":"first","affiliation":[]},{"given":"Quamrul I.","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Zhan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tariqul","family":"Hoque","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"32_CR1","first-page":"207","volume-title":"Proceedings of the SIGMOD 1993","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Buneman P, Jajodia S (eds) Proceedings of the SIGMOD 1993. ACM Press, New York, pp 207\u2013216"},{"key":"32_CR2","first-page":"487","volume-title":"Proceedings of the VLDB 1994","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Bocca JB, Jarke M, Zaniolo C (eds) Proceedings of the VLDB 1994. Morgan Kaufmann, San Francisco, CA, pp 487\u2013499"},{"key":"32_CR3","first-page":"287","volume-title":"Proceedings of the SIGKDD 1999","author":"NF Ayan","year":"1999","unstructured":"Ayan NF, Tansel AU, Arkun E (1999) An efficient algorithm to update large itemsets with early pruning. In: Fayyad U, Chaudhuri S, Madigan D (eds) Proceedings of the SIGKDD 1999. ACM Press, New York, pp 287\u2013291 Chairmen: Fayyad U, Chaudhuri S, Madigan D Proceedings Chair: Shim K"},{"key":"32_CR4","first-page":"85","volume-title":"Proceedings of the SIGMOD 1998","author":"RJ Bayardo","year":"1998","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: Haas LM, Tiwary A (eds) Proceedings of the SIGMOD 1998. ACM Press, New York, pp 85\u201393"},{"key":"32_CR5","volume-title":"UCI repository of machine learning databases","author":"CL Blake","year":"1998","unstructured":"Blake CL, Merz CJ (1998) UCI repository of machine learning databases. University of California \u2013 Irvine, Irvine, CA"},{"issue":"2","key":"32_CR6","first-page":"131","volume":"8","author":"F Bonchi","year":"2005","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2005) Efficient breadth-first mining of frequent pattern with monotone constraints. KAIS 8(2):131\u2013153","journal-title":"KAIS"},{"key":"32_CR7","first-page":"35","volume-title":"Proceedings of the ICDM 2004","author":"F Bonchi","year":"2004","unstructured":"Bonchi F, Lucchese C (2004) On closed constrained frequent pattern mining. In: Rastogi R, Morik K, Bramer M, Wu X (eds) Proceedings of the ICDM 2004. IEEE Computer Society Press, Los Alamitos, CA, pp 35\u201342"},{"key":"32_CR8","first-page":"265","volume-title":"Proceedings of the SIGMOD 1997","author":"S Brin","year":"1997","unstructured":"Brin S, Motwani R, Silverstein C (1997) Beyond market baskets: generalizing association rules to correlations. In: Peckham J (ed) Proceedings of the SIGMOD 1997. ACM Press, New York, pp 265\u2013276"},{"key":"32_CR9","first-page":"42","volume-title":"Proceedings of the SIGKDD 2002","author":"C Bucila","year":"2002","unstructured":"Bucila C, Gehrke J, Kifer D, White WM (2002) DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Za\u00efane OR, Goebel R, Hand D, et al (eds) Proceedings of the SIGKDD 2002. ACM Press, New York, pp 42\u201351"},{"key":"32_CR10","first-page":"106","volume-title":"Proceedings of the ICDE 1996","author":"DW Cheung","year":"1996","unstructured":"Cheung DW, Han J, Ng VT, Wong CY (1996) Maintenance of discovered association rules in large databases: an incremental updating technique. In: Su SYW (ed) Proceedings of the ICDE 1996. IEEE Computer Society Press, Los Alamitos, CA, pp 106\u2013114"},{"key":"32_CR11","first-page":"185","volume-title":"Proceedings of the DASFAA 1997","author":"DW Cheung","year":"1997","unstructured":"Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules. In: Topor RW, Tanaka K (eds) Proceedings of the DASFAA 1997. World Scientific, Singapore, pp 185\u2013194"},{"key":"32_CR12","first-page":"111","volume-title":"Proceedings of the IDEAS 2003","author":"W Cheung","year":"2003","unstructured":"Cheung W, Za\u00efane OR (2003) Incremental mining of frequent patterns without candidate generation or support constraint. In: Desai BC, Ng W (eds) Proceedings of the IDEAS 2003. IEEE Computer Society Press, Los Alamitos, CA, pp 111\u2013116"},{"issue":"2","key":"32_CR13","first-page":"202","volume":"7","author":"M Coatney","year":"2005","unstructured":"Coatney M, Parthasarathy S (2005) MotifMiner: efficient discovery of common substructures in biochemical molecules. KAIS 7(2):202\u2013223","journal-title":"KAIS"},{"key":"32_CR14","first-page":"13","volume-title":"Proceedings of the SIGMOD 1996","author":"T Fukuda","year":"1996","unstructured":"Fukuda T, Morimoto Y, Morishita S, Tokuyama T (1996) Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. In: Jagadish HV, Mumick IS (eds) Proceedings of the SIGMOD 1996. ACM Press, New York, pp 13\u201323"},{"key":"32_CR15","first-page":"138","volume-title":"Proceedings of the SIGKDD 2004","author":"K Gade","year":"2004","unstructured":"Gade K, Wang J, Karypis G (2004) Efficient closed pattern mining in the presence of tough block constraints. In: Kim W, Kohavi R, Gehrke J, DuMouchel W (eds) Proceedings of the SIGKDD 2004. ACM Press, New York, pp 138\u2013147"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Goethals B, Zaki MJ (2003) Advances in frequent itemset mining implementations: introduction to FIMI'03. In: Goethals B, Zaki MJ (eds) Proceedings of the FIMI 2003. Available via CEUR-WS.org","DOI":"10.1145\/1007730.1007744"},{"key":"32_CR17","first-page":"1","volume-title":"Proceedings of the SIGMOD 2000","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen W, Naughton JF, Bernstein PA (eds) Proceedings of the SIGMOD 2000. ACM Press, New York, pp 1\u201312"},{"issue":"1","key":"32_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowledge Dis 8(1):53\u201387","journal-title":"Data Min Knowledge Dis"},{"key":"32_CR19","first-page":"145","volume-title":"Proceedings of the SIGMOD 1999","author":"C Hidber","year":"1999","unstructured":"Hidber C (1999) Online association rule mining. In: Delis A, Faloutsos C, Ghandeharizadeh S (eds) Proceedings of the SIGMOD 1999. ACM Press, New York, pp 145\u2013156"},{"key":"32_CR20","first-page":"629","volume-title":"Proceedings of the ICDM 2002","author":"H Huang","year":"2002","unstructured":"Huang H, Wu X, Relue R (2002) Association analysis with one scan of databases. In: Kumar V, Tsumoto S, Zhong N, et al (eds) Proceedings of the ICDM 2002. IEEE Computer Society Press, Los Alamitos, CA, pp 629\u2013632 In: Kumar V, Tsumoto S, Zhong N, Yu PS, Wu X (eds)"},{"key":"32_CR21","first-page":"417","volume-title":"Proceedings of the DASFAA 2004","author":"J-L Koh","year":"2004","unstructured":"Koh J-L, Shieh S-F (2004) An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: Lee Y-J, Li J, Whang K-Y, Lee D (eds) Proceedings of the DASFAA 2004. Springer-Verlag, Berlin Heidelberg New York, pp 417\u2013424"},{"issue":"4","key":"32_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/958942.958944","volume":"28","author":"LVS Lakshmanan","year":"2003","unstructured":"Lakshmanan LVS, Leung CK-S, Ng RT (2003) Efficient dynamic mining of constrained frequent sets. ACM TODS 28(4):337\u2013389","journal-title":"ACM TODS"},{"key":"32_CR23","first-page":"49","volume-title":"Proceedings of the IDEAS 2004","author":"CK-S Leung","year":"2004","unstructured":"Leung CK-S (2004) Interactive constrained frequent-pattern mining system. In: Bernardino J, Desai BC (eds) Proceedings of the IDEAS 2004. IEEE Computer Society Press, Los Alamitos, CA, pp 49\u201358"},{"key":"32_CR24","first-page":"274","volume-title":"Proceedings of the ICDM 2005","author":"CK-S Leung","year":"2005","unstructured":"Leung CK-S, Khan QI, Hoque T (2005) CanTree: a tree structure for efficient incremental mining of frequent patterns. In: Han J, Wah BW, Raghavan V, et al (eds) Proceedings of the ICDM 2005. IEEE Computer Society Press, Los Alamitos, CA, pp 274\u2013281 In: Han J, Wah BW, Raghavan V, Wu X, Rastogi R (eds)"},{"issue":"1","key":"32_CR25","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/568574.568581","volume":"4","author":"CK-S Leung","year":"2002","unstructured":"Leung CK-S, Lakshmanan LVS, Ng RT (2002) Exploiting succinct constraints using FP-trees. SIGKDD Explorat 4(1):40\u201349","journal-title":"SIGKDD Explorat"},{"key":"32_CR26","first-page":"583","volume-title":"Proceedings of the ICDE 2002","author":"CK-S Leung","year":"2002","unstructured":"Leung CK-S, Ng RT, Mannila H (2002) OSSM: a segmentation approach to optimize frequency counting. In: Agrawal R, Dittrich K, Ngu AHH (eds) Proceedings of the ICDE 2002. IEEE Computer Society Press, Los Alamitos, CA, pp 583\u2013592"},{"key":"32_CR27","first-page":"13","volume-title":"Proceedings of the SIGMOD 1998","author":"RT Ng","year":"1998","unstructured":"Ng RT, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. In: Haas LM, Tiwary A (eds) Proceedings of the SIGMOD 1998. ACM Press, New York, pp 13\u201324"},{"key":"32_CR28","first-page":"257","volume-title":"Proceedings of the DaWaK 2003","author":"K-L Ong","year":"2003","unstructured":"Ong K-L, Ng WK, Lim E-P (2003) FSSM: fast construction of the optimized segment support map. In: Kambayashi Y, Mohania MK, W\u00f6ss W (eds) Proceedings of the DaWaK 2003. Springer-Verlag, Berlin Heidelberg New York, pp 257\u2013266"},{"issue":"5","key":"32_CR29","first-page":"813","volume":"9","author":"JS Park","year":"1997","unstructured":"Park JS, Chen M-S, Yu PS (1997) Using a hash-based method with transaction trimming for mining association rules. IEEE TKDE 9(5):813\u2013825","journal-title":"IEEE TKDE"},{"key":"32_CR30","first-page":"433","volume-title":"Proceedings of the ICDE 2001","author":"J Pei","year":"2001","unstructured":"Pei J, Han J, Lakshmanan LVS (2001) Mining frequent itemsets with convertible constraints. In: Buchmann A, Georgakopoulos D (eds) Proceedings of the ICDE 2001. IEEE Computer Society Press, Los Alamitos, CA, pp 433\u2013442"},{"key":"32_CR31","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Gunopulos D, Rastogi R (eds) Proceedings of the DMKD 2000, pp 21\u201330 (the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery) is Available via www.cs.ucr.edu\/~dg\/DMKD.html"},{"key":"32_CR32","unstructured":"Pietracaprina A, Zandolin D (2003) Mining frequent itemsets using Patricia tries. In: Goethals B, Zaki MJ (eds) Proceedings of the FIMI 2003. Available via CEUR-WS.org"},{"key":"32_CR33","first-page":"343","volume-title":"Proceedings of the SIGMOD 1998","author":"S Sarawagi","year":"1998","unstructured":"Sarawagi S, Thomas S, Agrawal R (1998) Integrating association rule mining with relational database systems: alternatives and implications. In: Haas LM, Tiwary A (eds) Proceedings of the SIGMOD 1998. ACM Press, New York, pp 343\u2013354"},{"issue":"2","key":"32_CR34","first-page":"158","volume":"7","author":"W-G Teng","year":"2005","unstructured":"Teng W-G, Hsieh M-J, Chen M-S (2005) A statistical framework for mining substitution rules. KAIS 7(2):158\u2013178","journal-title":"KAIS"},{"key":"32_CR35","first-page":"1","volume-title":"Proceedings of the SIGMOD 1998","author":"D Tsur","year":"1998","unstructured":"Tsur D, Ullman JD, Abiteboul S, et al (1998) Query flocks: a generalization of association-rule mining. In: Haas LM, Tiwary A (eds) Proceedings of the SIGMOD 1998. ACM Press, New York, pp 1\u201312 Tsur D, Ullman JD, Abiteboul S, Clifton C, Motwani R, Nestorov S, Rosenthal A (1998)"},{"issue":"4","key":"32_CR36","first-page":"438","volume":"7","author":"P Tzvetkov","year":"2005","unstructured":"Tzvetkov P, Yan X, Han J (2005) TSP: mining top-k closed sequential patterns. KAIS 7(4):438\u2013457","journal-title":"KAIS"},{"issue":"2","key":"32_CR37","first-page":"203","volume":"6","author":"W Wang","year":"2004","unstructured":"Wang W, Yang J, Yu P (2004) WAR: weighted association rules for item intensities. KAIS 6(2):203\u2013229","journal-title":"KAIS"},{"key":"32_CR38","first-page":"457","volume-title":"Proceedings of the SDM 2002","author":"MJ Zaki","year":"2002","unstructured":"Zaki MJ, Hsiao C-J (2002) CHARM: an efficient algorithm for closed itemset mining. In: Grossman RL, Han J, Kumar V, et al (eds) Proceedings of the SDM 2002. SIAM, Philadelphia, PA, pp 457\u2013473"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0032-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-006-0032-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0032-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:15Z","timestamp":1559124615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-006-0032-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,5]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,4,3]]}},"alternative-id":["32"],"URL":"https:\/\/doi.org\/10.1007\/s10115-006-0032-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,5]]}}}