{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:25Z","timestamp":1750221025538,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319581293"},{"type":"electronic","value":"9783319581309"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58130-9_1","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T14:28:51Z","timestamp":1493216931000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Incremental Mining Algorithm for Dynamic Databases"],"prefix":"10.1007","author":[{"given":"Lydia Nahla","family":"Driff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"key":"1_CR1","unstructured":"Jiewai, H., Kamber, M.: Data Mining: Concepts and Techniques. Morgann Kaufmann, San Francisco (2011)"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Information overload. Nature 460, 551 (2009). doi: 10.1038\/460551a . Accessed 29 July 2009","DOI":"10.1038\/460551a"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Leung, C.K.-S., Khan, Q.I., Li, Z., Hoque, T.: CanTree: a canonical-order tree for incremental frequent pattern mining. Knowl. Inf. Syst. 11(3), 287\u2013311 (2007)","DOI":"10.1007\/s10115-006-0032-8"},{"key":"1_CR4","unstructured":"Rakesh, A., Ramakrishnan, S.: Fast algorithms for mining association rules. In: 20th International Conference on Very Large Data Bases, Chile, pp. 487\u2013499 (1994)"},{"key":"1_CR5","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Pascal: un algorithme d\u2019extraction des motifs fr\u00e9quents, pp. 65\u201395. Techniques et Sciences Informatiques, Editions Herm\u00e8s (2002)"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Han, J.L., Plank, A.W.: Background for association rules and cost estimate of selected mining algorithms. In: 5th International CIKM, USA, pp. 73\u201380 (1996)","DOI":"10.1145\/238355.238440"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Zhang, S., Zhang, J., Zhang, C.: EDUA an efficient algorithm for dynamic database mining. Inf. Sci. 177, 2756\u20132767 (2007)","DOI":"10.1016\/j.ins.2007.01.034"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Jiemin, Z., Defu, Z., Leung, S.C.H., Xiyue, Z.: An efficient algorithm for frequent itemsets in data mining. In: ICSSSM, Hong Kong, pp. 1\u20136. IEEE (2010)","DOI":"10.1109\/ICSSSM.2010.5530116"},{"key":"1_CR9","unstructured":"Khan, Z., Faujdar, N., Singh, P., Abbas, T.: Modified Bitapriori algorithm: an intelligent approach for mining frequent Ite-Set. In: International Conference on Advance in Signal Processing and Communication, India, pp. 813\u2013819 (2013)"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. In: Proceedings of 1995 ACM SIGMOD International Conference on Management of Dai, San Jose, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large database: an incremental updating technique. In: Proceedings of 12th IEEE International Conference on Data Engineering, pp. 106\u2013114 (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"1_CR12","unstructured":"Suresh, P., Nithya, K.N., Murugan, K.: Improved generation of frequent item sets using apriori algorithm. IJARCCE Int. J. Adv. Res. Comput. Commun. Eng. 4(10) (2015)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for mining discovered association rules. In: Proceedings of International Conference on Database System for Advanced Applications, pp. 185\u2013194 (1997)","DOI":"10.1142\/9789812819536_0020"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Lee, C., Lin, C.R., Chen, M.S.: Sliding-window filtering: an efficient algorithm for incremental mining. In: Proceedings of International Conference on Information and Knowledge Management, CIKM01, pp. 263\u2013270 (2001)","DOI":"10.1145\/502585.502630"},{"key":"1_CR15","unstructured":"Thusaranon, P., Kreesuradej, W.: A probability\u2011based incremental association rule discovery. In: 19th International Symposium on Artificial Life and Robotics, Oita, pp. 22\u201324. Department of Information System, Information Technology Faculty Dhurakij Pundit University, Thailand (2014)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Yao, Y.Y.: Three-way decision\u00a0with probabilistic rough sets. Inf. Sci. 180, 341\u2013353. Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada (2010)","DOI":"10.1016\/j.ins.2009.09.021"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Wen, P., Li, Y., Polkowski, L., Yao, Y.Y., Tsumoto, S. (eds.): Rough Sets and Knowledge Technology: 4th International Conference, RSKT 2009. LNCS, vol. 5589, pp. 642\u2013649. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02962-2"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Yao, Y.Y: Decision-theoretic rough set models. In: Yao, J., Lingras, P., Wu, W.-Z., Szczuka, M.S., Cercone, N.J., \u015al\u0229zak, D. (eds.) RSKT 2007. LNCS (LNAI), vol. 4481, pp. 1\u201312. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72458-2_1"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","volume":"20","author":"J Dong","year":"2007","unstructured":"Dong, J., Han, M.: BitTableFI an efficient mining frequent itemsets algorithm. Knowl. Based Syst. 20(4), 329\u2013335 (2007)","journal-title":"Knowl. Based Syst."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Niknafs, A., Parsa, S.: A neural network approach for updating ranked association rules, based on data envelopment analysis. J. Artif. Intell. 4, 279\u2013287 (2011). Department of Computer Engineering, Shahid Bahonar University of Kerman, Iran, Asian Network for Scientific Information, Iran","DOI":"10.3923\/jai.2011.279.287"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Hegland, M.: The apriori algorithm \u2013 a tutorial. In: Mathematics and Computation in Imaging Science and Information Processing, vol. 11, pp. 209\u2013262. World Scientific Publishing (2007)","DOI":"10.1142\/9789812709066_0006"}],"container-title":["Lecture Notes in Computer Science","Mining Intelligence and Knowledge Exploration"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58130-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:35:12Z","timestamp":1750206912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58130-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319581293","9783319581309"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58130-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}