{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:41:09Z","timestamp":1778272869806,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,11,7]],"date-time":"2007-11-07T00:00:00Z","timestamp":1194393600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00778-007-0078-6","type":"journal-article","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T15:12:33Z","timestamp":1194361953000},"page":"1321-1344","source":"Crossref","is-referenced-by-count":50,"title":["Mining top-k frequent patterns in the presence of the memory constraint"],"prefix":"10.1007","volume":"17","author":[{"given":"Kun-Ta","family":"Chuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiun-Long","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Syan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,7]]},"reference":[{"key":"78_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gionis, A., Mannila, H.: Approximating a collection of frequent sets. In: Proceedings of ACM SIGKDD (2004)","DOI":"10.1145\/1014052.1014057"},{"key":"78_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of VLDB (1994)"},{"key":"78_CR3","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proceedings of PODS (2002)","DOI":"10.1145\/543613.543615"},{"key":"78_CR4","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proceedings of SIGMOD (1997)","DOI":"10.1145\/253260.253325"},{"issue":"2","key":"78_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","volume":"10","author":"M.-S. Chen","year":"1998","unstructured":"Chen M.-S., Park J.-S., Yu P.S. (1998): Efficient data mining for path traversal patterns. IEEE Trans. Knowledge Data Eng. 10(2): 209\u2013221","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"78_CR6","unstructured":"Cheung, Y.L., Fu, A.W.: Mining association rules without support threshold: with and without item constraints. In: TKDE (2004)"},{"key":"78_CR7","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: Proceedings of ICDM (2004)"},{"issue":"2","key":"78_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/1071610.1071611","volume":"30","author":"F. Geerts","year":"2005","unstructured":"Geerts, F., Goethals, B., Bussche, J.V.D. (2005) Tight upper bounds on the number of candidate patterns. ACM Trans. Database Syst. 30(2): 333\u2013363","journal-title":"ACM Trans. Database Syst"},{"key":"78_CR9","unstructured":"Goethals, B.: Survey on frequent pattern mining, online technical report. http:\/\/www.adrem.ua.ac.be\/bibrem\/pubs\/fpm_survey.pdf (2003)"},{"key":"78_CR10","doi-asserted-by":"crossref","unstructured":"Goethals, B.: Memory issues in frequent itemset mining. In: Proceedings of SAC (2004)","DOI":"10.1145\/967900.968012"},{"key":"78_CR11","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: introduction to FIMI03. In: Proceedings of Workshop on Frequent Itemset Mining Implementations (2003)","DOI":"10.1145\/1007730.1007744"},{"key":"78_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD (2000)","DOI":"10.1145\/342009.335372"},{"key":"78_CR13","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. In: DMKD (2004)","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"78_CR14","doi-asserted-by":"crossref","unstructured":"Hipp, J., Guntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining\u2014a general survey and comparison. In: SIGKDD Explorations (2000)","DOI":"10.1145\/360402.360421"},{"key":"78_CR15","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over streaming data. In: Proceedings of VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"78_CR16","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: AAAI Workshop on Knowledge Discovery in Databases (KDD-94) (1994)"},{"key":"78_CR17","unstructured":"Orlando, S., Lucchese, C., Palmerini, P., Perego, R., Silvestri, F.: kDCI: a multi-strategy algorithm for mining frequent sets. In: Proceedings of Workshop on Frequent Itemset Mining Implementations (2004)"},{"key":"78_CR18","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerini, P., Perego, R., Silvestri, F.: Adaptive and resource-aware mining of frequent sets. In: Proceedings of IEEE ICDM (2002)","DOI":"10.1109\/ICDM.2002.1183921"},{"key":"78_CR19","doi-asserted-by":"crossref","unstructured":"Park, J.-S., Chen, M.-S., Yu, P.S.: An effective hash based algorithm for mining association rules. In: Proceedings of ACM SIGMOD (1995)","DOI":"10.1145\/223784.223813"},{"key":"78_CR20","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.-S., Yu, P.S.: Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowl. Data Eng. 9(5), (1997)","DOI":"10.1109\/69.634757"},{"key":"78_CR21","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proceedings of ICDT (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"78_CR22","unstructured":"Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: an efficient algorithm for mining top-k frequent closed itemsets. In: TKDE (2005)"},{"key":"78_CR23","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W., Fu, A.W.: Mining top-k itemsets over a sliding window based on zipfian distribution. In: Proceedings of SIAM SDM (2005)","DOI":"10.1137\/1.9781611972757.52"},{"key":"78_CR24","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Dunham, M.H.: Considering main memory in mining association rules. In: Proceedings of DAWAK (1999)","DOI":"10.1007\/3-540-48298-9_23"},{"key":"78_CR25","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proceedings of VLDB (2004)","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"key":"78_CR26","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: Charm: an efficient algorithm for closed itemset mining. In: Proceedings of SIAM SDM (2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"78_CR27","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: Proceedings of SIGKDD (2001)","DOI":"10.1145\/502512.502572"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0078-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-007-0078-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0078-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:05:03Z","timestamp":1559142303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-007-0078-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,7]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["78"],"URL":"https:\/\/doi.org\/10.1007\/s00778-007-0078-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,7]]}}}