{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:25:50Z","timestamp":1725495950933},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77018-3_45","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T02:46:39Z","timestamp":1196045199000},"page":"457-468","source":"Crossref","is-referenced-by-count":5,"title":["GC-Tree: A Fast Online Algorithm for Mining Frequent Closed Itemsets"],"prefix":"10.1007","author":[{"given":"Junbo","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ShanPing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"45_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1147234.1147248","volume":"8","author":"S. Ben Yahia","year":"2006","unstructured":"Ben Yahia, S., Hamrouni, T., Mephu Nguifo, E.: Frequent closed itemset based algorithms: a thorough structural and analytical survey. ACM SIGKDD Explorations Newsletter\u00a08(1), 93\u2013104 (2006)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Lin, C.-H., Chiu, D.-Y., Wu, Y.-H., Chen, A.L.P.: Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window. In: Proc. of SDM Conf. (2005)","DOI":"10.1137\/1.9781611972757.7"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Jiang, N., Gruenwald, L.: CFI-Stream: mining closed frequent itemsets in data streams. In: Proc. of KDD Conf., pp. 592\u2013597 (2006)","DOI":"10.1145\/1150402.1150473"},{"key":"45_CR4","unstructured":"Lucchese, C., Orlando, S., Perego, R.: DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets. In: Proc. of FIMI Conf., (2004)"},{"issue":"1","key":"45_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C. Lucchese","year":"2006","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Fast and Memory Efficient Mining of Frequent Closed Itemsets. IEEE Journal Transactions of Knowledge and Data Engineering (TKDE)\u00a018(1), 21\u201336 (2006)","journal-title":"IEEE Journal Transactions of Knowledge and Data Engineering (TKDE)"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: Proc. of KDD Conf., (2003)","DOI":"10.1145\/956750.956779"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An Efficient algorithm for closed itemsets mining. In: Proc. of SIAM ICDM Conf. (2002)","DOI":"10.1137\/1.9781611972726.27"},{"issue":"42","key":"45_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0169-023X(02)00057-5","volume":"2","author":"G. Stumme","year":"2002","unstructured":"Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. Journal of Knowledge and Data Engineering(KDE)\u00a02(42), 189\u2013222 (2002)","journal-title":"Journal of Knowledge and Data Engineering(KDE)"},{"key":"45_CR9","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. Technical Report 01-1, Computer Science Dept., Rensselaer Polytechnic Institute (March 2001)"},{"key":"45_CR10","unstructured":"Lucchese, C., Orlando, S., Palmerini, P., Perego, R., Silvestri, F.: KDCI: a multistrategy algorithm for mining frequent sets. In: Proc. of ICDM Conf., (2003)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerini, P., Perego, R., Silvestri, F.: Adaptive and resource-aware mining of frequent sets. In: Proc. of ICDM Conf., (2002)","DOI":"10.1109\/ICDM.2002.1183921"},{"key":"45_CR12","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1998)"},{"key":"45_CR13","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An efficient algorithm for mining frequent closed itemsets. In: Proc. of DMKD Conf. (May 2000)"},{"key":"45_CR14","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Int\u2019l. Conf. on Very Large Databases (1994)"}],"container-title":["Lecture Notes in Computer Science","Emerging Technologies in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77018-3_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:53:41Z","timestamp":1619506421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77018-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770169"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77018-3_45","relation":{},"subject":[]}}