{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T06:18:43Z","timestamp":1777961923997,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,4,12]],"date-time":"2007-04-12T00:00:00Z","timestamp":1176336000000},"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,7]]},"DOI":"10.1007\/s00778-007-0047-0","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T09:04:49Z","timestamp":1176887089000},"page":"947-970","source":"Crossref","is-referenced-by-count":5,"title":["A data mining proxy approach for efficient frequent itemset mining"],"prefix":"10.1007","volume":"17","author":[{"given":"Jeffrey Xu","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guimei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: Depth first generation of long patterns. In: Proceedings of 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001)","DOI":"10.1145\/347090.347114"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, R.C., Aggarwal, C.C., Prasad, V.V.V.: A tree projection algorithm for generation of frequent item sets. J. Parallel Distrib. Comput. 61 (2001)","DOI":"10.1006\/jpdc.2000.1693"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD Conference (1993)","DOI":"10.1145\/170035.170072"},{"key":"47_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases (1994)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently mining long patterns from databases. In: Proceedings of the 1998 ACM SIGMOD Conference (1998)","DOI":"10.1145\/276304.276313"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the 1997 ACM SIGMOD Conference (1997)","DOI":"10.1145\/253260.253325"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Bucila, C., Gehrke, J., Kifer, D., White, W.M.: Dualminer: a dual-pruning algorithm for itemsets with constraints. In: Proceedings of the 8th ACM SIGKDD Conference (2002)","DOI":"10.1145\/775052.775054"},{"key":"47_CR8","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset\u00a0algorithm for transactional databases. In: Proceedings of 2001 International Conference on Data Engineering (2001)"},{"key":"47_CR9","unstructured":"Cong, G., Liu, B.: Speed-up iterative frequent itemset mining with constraint changes. In: Proceedings of the 2002 International Conference on Data Mining (2002)"},{"key":"47_CR10","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)"},{"key":"47_CR11","unstructured":"Grahne, G., Lakshmanan, L.V.S., Wang, X.: Efficient mining of constrained correlated sets. In: Proceedings of the 16th IEEE International Conference on Data Engineering (2000)"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD Conference (2000)","DOI":"10.1145\/342009.335372"},{"key":"47_CR13","unstructured":"Han, J., Wang, J., Lu, Y., Tzvethov, P.: Mining top-k frequent closed patterns without minimum. In: Proceedings of the 2002 IEEE International Conference on Data Mining (2002)"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Leung, C.K.S., Ng, R.T.: Efficient dynamic mining of constrained frequent sets. ACM Trans. Database Systems (TODS) 28(4), (2003)","DOI":"10.1145\/958942.958944"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Ng, R.T., Han, J., Pang, A.: Optimization of constrained frequent set queries with 2-variable constraints. In: Proceedings of the 1999 ACM SIGMOD Conference (1999)","DOI":"10.1145\/304182.304196"},{"key":"47_CR16","unstructured":"Lan, B., Ooi, B.C., Tan, K.L.: Efficient indexing structure for mining frequent patterns. In: Proceedings of the 18th IEEE International Conference on Data Engineering (1994)"},{"key":"47_CR17","unstructured":"Leung, C.S., Ng, R.T., Mannila, H.: A segmentation approach to optimize frequency counting. In: Proceedings of the 18th IEEE International Conference on Data Engineering (2002)"},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"Li, Z., Yu, J.X., Lu, H., Xu, Y., Liu, G.: Data mining proxy: serving large number of users for efficient frequent itemset mining. In: Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining (2004)","DOI":"10.1007\/978-3-540-24775-3_56"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"Lin, D.I., Kedem, Z.M.: Pincer search: A new algorithm for discovering the maximum frequent set. In: Proceedings of 6th International Conference on Extending Database Technology, EDBT (1998)","DOI":"10.1007\/BFb0100980"},{"key":"47_CR20","unstructured":"Lin, J.L., Dunham, M.H.: Mining association rules: anti-skew algorithms. In: Proceedings of the 14th IEEE International Conference on Data Engineering (1998)"},{"key":"47_CR21","unstructured":"Liu, G., Lu, H., Lou, W., Xu, Y., Yu, J.X.: Ascending frequency ordered prefix-tree: efficient mining of frequent itemsets. In: Proceedings of International Conference on Database Systems for Advanced Applications\u201903 (2003)"},{"key":"47_CR22","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by opportunistic projection. In: Proceedings of the 8th KDD Conference (2002)","DOI":"10.1145\/775047.775081"},{"key":"47_CR23","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient algorithms for discovering association rules. In: Proceedings of KDD Workshop (1994)"},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"Morzy, T., Wojciechowski, M., Zakrzewicz, M.: Materialized data mining views. In: Proceedings of European Conference on Principles and Practice of Knowledge Discovery in Databases (2000)","DOI":"10.1007\/3-540-45372-5_7"},{"key":"47_CR25","doi-asserted-by":"crossref","unstructured":"Nag, B., Deshpande, P.M., DeWitt, D.J.: Using a knowledge cache for interactive discovery of association rules. In: Proceedings of the 5th ACM SIGKDD Conference (1999)","DOI":"10.1145\/312129.312238"},{"key":"47_CR26","doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained association rules. In: Proceedings of the 1998 ACM SIGMOD Conference (1998)","DOI":"10.1145\/276304.276307"},{"key":"47_CR27","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 the 1995 ACM SIGMOD Conference (1995)","DOI":"10.1145\/223784.223813"},{"key":"47_CR28","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J.: Can we push more constraints into frequent pattern mining? In: Proceedings of the 6th ACM SIGKDD Conference (2000)","DOI":"10.1145\/347090.347166"},{"key":"47_CR29","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent item sets with convertible constraints. In: Proceedings of the 17th IEEE International Conference on Data Engineering (2001)"},{"key":"47_CR30","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Shiwei Tang, D.Y.: H-mine: Hyper-structure mining of frequent patterns in large databases. In: Proceedings of 2001 IEEE Conference on Data Mining (2001)"},{"key":"47_CR31","unstructured":"Pei, J., Han, J., Mao, R.: Closet: an efficient algorithm for mining frequent closed itemsets. In: Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2000)"},{"key":"47_CR32","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: Proceedings of 21th International Conference on Very Large Data Bases. Morgan Kaufmann (1995)"},{"key":"47_CR33","doi-asserted-by":"crossref","unstructured":"Seno, M., Karypis, G.: Lpminer: An algorithm for finding frequent itemsets using length-decreasing support constraint. In: Proceedings of 1st IEEE Conference on Data Mining (2001)","DOI":"10.21236\/ADA438931"},{"key":"47_CR34","doi-asserted-by":"crossref","unstructured":"Shenoy, P., Haritsa, J.R., Sudarshan, S., Bhalotia, G., Bawa, M., Shah, D.: Turbo-charging vertical mining of large databases. In: Proceedings of the 2000 ACM SIGMOD Conference (2000)","DOI":"10.1145\/342009.335376"},{"key":"47_CR35","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of the 3rd ACM SIGKDD Conference (1997)"},{"key":"47_CR36","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proceedings of the 22th International Conference on Very Large Data Bases (1996)"},{"key":"47_CR37","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-03) (2003)","DOI":"10.1145\/956750.956779"},{"key":"47_CR38","doi-asserted-by":"crossref","unstructured":"Webb, G.I.: Efficient search for association rules. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2000)","DOI":"10.1145\/347090.347112"},{"key":"47_CR39","unstructured":"Xu, Y., Yu, J.X., Liu, G., Lu, H.: From path tree to frequent patterns: A framework for mining frequent patterns. In: Proceedings of IEEE International Conference on Data Mining (2002)"},{"key":"47_CR40","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: Clospan: Mining closed sequential patterns in large datasets. In: Proceedings of the 3rd SAIM International Conference on Data Mining (2003)","DOI":"10.1137\/1.9781611972733.15"},{"key":"47_CR41","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. Knowl. Data Eng. 12(2), (2000)","DOI":"10.1109\/69.846291"},{"key":"47_CR42","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proceedings of the 9th ACM SIGKDD Conference (2003)","DOI":"10.1145\/956750.956788"},{"key":"47_CR43","unstructured":"Zaki, M.J., Hsiao, C.: Charm: An efficient algorithm for closed association rule mining. Tech. rep., Rensselaer Polytechnic Institute (1999)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0047-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-007-0047-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-007-0047-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:05:01Z","timestamp":1559127901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-007-0047-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,12]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s00778-007-0047-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,12]]}}}