{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:46:41Z","timestamp":1725500801699},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454854"},{"type":"electronic","value":"9783540454878"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11875581_75","type":"book-chapter","created":{"date-parts":[[2006,9,25]],"date-time":"2006-09-25T12:23:29Z","timestamp":1159187009000},"page":"620-628","source":"Crossref","is-referenced-by-count":3,"title":["Mining the K-Most Interesting Frequent Patterns Sequentially"],"prefix":"10.1007","author":[{"given":"Quang Tran","family":"Minh","sequence":"first","affiliation":[]},{"given":"Shigeru","family":"Oyanagi","sequence":"additional","affiliation":[]},{"given":"Katsuhiro","family":"Yamazaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proc. Of VLDB 1994, Santiago, Chille, September 1994, pp. 487\u2013499 (1994)"},{"key":"75_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":"75_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":"75_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":"75_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":"75_CR6","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm from mining frequent closed itemsets. In: proc. of DMKD (2000)"},{"key":"75_CR7","unstructured":"Fu, A.W., Kwong, R.W., Tang, J.: Mining N most interesting itemsets. In: proc. Of ISMIS 2000 (2000)"},{"key":"75_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":"75_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)"},{"key":"75_CR10","doi-asserted-by":"crossref","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)","DOI":"10.1109\/TKDE.2005.81"},{"key":"75_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":"75_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/11811305_48","volume-title":"Advanced Data Mining and Applications","author":"T.M. Quang","year":"2006","unstructured":"Quang, T.M., Oyanagi, S., Yamazaki, K.: ExMiner: An efficient algorithm for mining top-K frequent patterns. In: Li, X., Za\u00efane, O.R., Li, Z.-h. (eds.) ADMA 2006. LNCS (LNAI), vol.\u00a04093, pp. 436\u2013447. Springer, Heidelberg (2006)"},{"key":"75_CR13","unstructured":"IBM Quest Data Mining Project. Quest synthetic data generation, http:\/\/almaden.ibm.com\/software\/quest\/Resources\/index.shtml"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875581_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:48:21Z","timestamp":1605642501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875581_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454854","9783540454878"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11875581_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}