{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:40:05Z","timestamp":1736073605951,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292449"},{"type":"electronic","value":"9783540316657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564126_75","type":"book-chapter","created":{"date-parts":[[2005,11,4]],"date-time":"2005-11-04T10:24:55Z","timestamp":1131099895000},"page":"701-708","source":"Crossref","is-referenced-by-count":2,"title":["An Incremental Algorithm for Mining Generators Representation"],"prefix":"10.1007","author":[{"given":"Lijun","family":"Xu","sequence":"first","affiliation":[]},{"given":"Kanglin","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"75_CR2","doi-asserted-by":"crossref","unstructured":"Ayan, N., Tansel, A., Arkun, E.: An efficient algorithm to update large itemsets with early pruning. In: Proc. of the 5th ACM-SIGKDD, pp. 287\u2013291 (1999)","DOI":"10.1145\/312129.312252"},{"key":"75_CR3","doi-asserted-by":"crossref","unstructured":"Cheung, D., Han, J., Ng, V., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: Proc. of the 12th Data Engineering, pp. 106\u2013114 (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"Cheung, D., Lee, S., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Proc. of the 5th Database Systems for Advanced Applications, pp. 1\u20134 (1997)","DOI":"10.1142\/9789812819536_0020"},{"key":"75_CR5","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: Proc. ICDM 2004, pp. 59\u201366 (2004)"},{"key":"75_CR6","unstructured":"Feldman, R., Aumann, Y., Amir, A., Mannila, H.: Efficient algorithms for discovering frequent sets in incremental databases. In: Proc. of ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pp. 59\u201366 (1997)"},{"key":"75_CR7","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.: Efficiently mining maximal frequent itemsets. In: Proc. of ICDM 2001, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"75_CR8","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Concise representations of association rules. In: Proc. of the ESF Exploratory Workshop on Pattern Detection and Discovery, pp. 92\u2013109 (2002)","DOI":"10.1007\/3-540-45728-3_8"},{"key":"75_CR9","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: Proc. of BDA 1998, pp. 177\u2013196 (1998)"},{"key":"75_CR10","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proc. of VLDB 1996, pp. 134\u2013145 (1996)"},{"key":"75_CR11","unstructured":"Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An efficient algorithm for the incremental updation of association rules. In: Proc. of KDD 1997, pp. 263\u2013266 (1997)"},{"key":"75_CR12","doi-asserted-by":"crossref","unstructured":"Veloso, A., Meira Jr., W., de Carvalho, M.B., P\u00f4ssas, B., Parthasarathy, S., Zaki, M.: Mining frequent itemsets in evolving databases. In: Proc. of SIAM 2002 (2002)","DOI":"10.1137\/1.9781611972726.29"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564126_75.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:01:40Z","timestamp":1736071300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564126_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292449","9783540316657"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11564126_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}