{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T04:40:11Z","timestamp":1742704811667,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291654"},{"type":"electronic","value":"9783642291661"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29166-1_3","type":"book-chapter","created":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T13:48:57Z","timestamp":1331732937000},"page":"28-39","source":"Crossref","is-referenced-by-count":3,"title":["Cardinality Statistics Based Maximal Frequent Itemsets Mining"],"prefix":"10.1007","author":[{"given":"Meera M.","family":"Dhabu","sequence":"first","affiliation":[]},{"given":"Parag S.","family":"Deshpande","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Aggarwal, C., Prasad, V.V.V.: Depth First Generation of Long Patterns. In: 7th Int\u2019l Conference on Knowledge Discovery and Data Mining (August 2000)","DOI":"10.1145\/347090.347114"},{"key":"3_CR2","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.: Fast Discovery of Association Rules. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. AAAI Press, Menlo Park (1996)"},{"key":"3_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 1994 Int. Conf. Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 487\u2013499 (September 1994)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. Int. Conf. Data Engineering (ICDE 1995), Taipei, Taiwan, pp. 3\u201314 (March 1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations\u00a02(2) (December 2000)","DOI":"10.1145\/380995.381017"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J.: Efficiently Mining Long Patterns from Databases. In: ACM SIGMOD Conf. Management of Data (June 1998)","DOI":"10.1145\/276304.276313"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Proc. of the ACM-SIGMOD Conf. on Management of Data, pp. 255\u2013264 (1997)","DOI":"10.1145\/253262.253325"},{"key":"3_CR8","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In: Intl. Conf. on Data Engineering (April 2001)"},{"key":"3_CR9","unstructured":"Gouda, K., Zaki, Z.J.: Efficiently Mining Maximal Frequent Itemsets. In: 1st IEEE Int\u2019l Conf. on Data Mining (November 2001)"},{"key":"3_CR10","unstructured":"Grahne, G., Zhu, J.: High Performance Mining of Maximal Frequent Itemsets. In: 6th International Workshop on High Performance Data Mining (May 2003)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-62222-5_47","volume-title":"Database Theory - ICDT \u201997","author":"D. Gunopulos","year":"1996","unstructured":"Gunopulos, D., Mannila, H., Saluja, S.: Discovering All the Most Specific Sentences by Randomized Algorithms Extended Abstract. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol.\u00a01186, pp. 215\u2013229. Springer, Heidelberg (1996)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Dong, G., Yin, Y.: Efficient Mining of Partial Periodic Patterns in Time Series Database. In: Proc. Int. Conf. Data Engineering, Sydney, Australia, pp. 106\u2013115 (April 1999)","DOI":"10.1109\/ICDE.1999.754913"},{"key":"3_CR13","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers (2009)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD 2000), Dallas, TX (2000)","DOI":"10.1145\/342009.335372"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Lin, D.I., Kedem, Z.M.: Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. In: 6th Intl. Conf. Extending Database Technology (March 1998)","DOI":"10.1007\/BFb0100980"},{"key":"3_CR16","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Efficient Algorithms for Discovering Association Rules. In: Proc. AAAI 1994 Workshop Knowledge Discovery in Databases (KDD 1994), Seattle, WA, pp. 181\u2013192 (July 1994)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An Effective Hash Based Algorithm for Mining Association Rules. In: Proc. of the 1995 ACM-SIGMOD Conf. on Management of Data, pp. 175\u2013186 (1996)","DOI":"10.1145\/568271.223813"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"3_CR19","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proc. 2000 ACM-SIGMOD Int. Workshop on Data Mining and Knowledge Discovery (DMKD 2000), Dallas, TX (May 2000)"},{"key":"3_CR20","unstructured":"Rymon, R.: Search through Systematic Set Enumeration. In: Proc. of Third Int\u2019l Conf. on Principles of Knowledge Representation and Reasoning, pp. 539\u2013550 (1992)"},{"key":"3_CR21","unstructured":"UCI Machine Learning Repositor, http:\/\/archive.ics.uci.edu\/ml\/datasets\/Mushroom"},{"key":"3_CR22","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. of the 21st Conf. on Very Large Data-Bases, pp. 432\u2013444 (1995)"},{"key":"3_CR23","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An Efficient Algorithm for Closed Itemset Mining"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating Non-Redundant Association Rules. In: 6th ACM SIGKDD Int\u2019l Conf. Knowledge Discovery and Data Mining (August 2000)","DOI":"10.1145\/347090.347101"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proc. of the Third Int\u2019l Conf. on Knowledge Discovery in Databases and Data Mining, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"3_CR26","unstructured":"Zou, Q., Chu, W.W., Lu, B.: Smartminer: A Depth First Algorithm Guided by Tail Information for Mining Maximal Frequent Itemsets. In: 2nd IEEE Int\u2019l Conf. on Data Mining (November 2002)"}],"container-title":["Communications in Computer and Information Science","Information Systems, Technology and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29166-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T04:01:57Z","timestamp":1742702517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29166-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291654","9783642291661"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29166-1_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}