{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:34:54Z","timestamp":1725543294157},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540370253"},{"type":"electronic","value":"9783540370260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11811305_48","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T09:30:33Z","timestamp":1153906233000},"page":"436-447","source":"Crossref","is-referenced-by-count":16,"title":["ExMiner: An Efficient Algorithm for Mining Top-K Frequent Patterns"],"prefix":"10.1007","author":[{"given":"Tran Minh","family":"Quang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Oyanagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuhiro","family":"Yamazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proc. of VLDB 1994, Santiago, Chille, pp. 487\u2013499 (1994)"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD Conference on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Bayard, R.J.: Efficiently mining long patterns from databases. In: Proc. of ACM SIGMOD Conference on Management of Data, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"key":"48_CR4","unstructured":"Grahne, G., Zhu, J.: High performance mining of maxima frequent itemsets. In: Proc. of SIAM 2003 workshop on High Performance Data Mining (2003)"},{"key":"48_CR5","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-tree in mining frequent itemsets. In: Proc. of IEEE ICDM workshop on Frequent Itemsets Mining Implementations (2003)"},{"key":"48_CR6","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm from mining frequent closed itemsets. In: Proc. of DMKD (2000)"},{"key":"48_CR7","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Foundations of Intelligent Systems","author":"A.W. Fu","year":"2000","unstructured":"Fu, A.W., Kwong, R.W., Tang, J.: Mining N most interesting itemsets. In: Ohsuga, S., Ra\u015b, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol.\u00a01932, Springer, Heidelberg (2000)"},{"key":"48_CR8","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proc. of IEEE ICDM Conference on Data Mining (2002)"},{"key":"48_CR9","unstructured":"Ly, S., Hong, S., Paul, P., Rodney, T.: Finding the N largest itemsets. In: Proc. Int. Conf. on Data Mining, Rio de Janeiro, Brazil, pp. 211\u2013222 (1998)"},{"issue":"5","key":"48_CR10","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An efficient algorithm for mining top-k frequent closed itemsets. Proc. of IEEE Knowledge and Data Engineering\u00a017(5), 652\u2013663 (2005)","journal-title":"Proc. of IEEE Knowledge and Data Engineering"},{"key":"48_CR11","unstructured":"Hirate, Y., Iwahashi, E., Yamana, H.: TF2P-growth: An efficient algorithm for mining frequent patterns without any thresholds. In: Proc. of ICDM (2004)"},{"key":"48_CR12","unstructured":"IBM Quest Data Mining Project. Quest synthetic data generation, \n                    \n                      http:\/\/almaden.ibm.com\/software\/quest\/Resources\/index.shtml"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11811305_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T14:37:38Z","timestamp":1552315058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11811305_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540370253","9783540370260"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11811305_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}