{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:07:51Z","timestamp":1725559671716},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278948"},{"type":"electronic","value":"9783540318774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527503_10","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:17:23Z","timestamp":1279477043000},"page":"67-74","source":"Crossref","is-referenced-by-count":2,"title":["Finding All Frequent Patterns Starting from the Closure"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"El-Hajj","sequence":"first","affiliation":[]},{"given":"Osmar R.","family":"Za\u00efane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: Mafia: A maximal frequent itemset algorithm for transactional databases. In: ICDE, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Za\u00efane, 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. Springer, Heidelberg (2003)"},{"key":"10_CR3","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: FIMI 2003, Workshop on Frequent Itemset Mining Implementations (November 2003)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: 2000 ACM SIGMOD Intl. Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"10_CR5","unstructured":"IBM Almaden Quest synthetic data generation code, \n                    \n                      http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: International Conference on Database Theory (ICDT), January 1999, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"10_CR7","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 Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC, USA (2003)","DOI":"10.1145\/956750.956779"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Zaki, M., Hsiao, C.-J.: ChARM: An efficient algorithm for closed itemset mining. In: 2nd SIAM International Conference on Data Mining (April 2002)","DOI":"10.1137\/1.9781611972726.27"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: 7th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, pp. 401\u2013406 (2001)","DOI":"10.1145\/502512.502572"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527503_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:02Z","timestamp":1619506082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527503_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278948","9783540318774"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11527503_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}