{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:30:54Z","timestamp":1764977454295,"version":"3.46.0"},"reference-count":22,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T00:00:00Z","timestamp":1447977600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Association rules provide important knowledge that can be extracted from transactional databases. Owing to the massive exchange of information nowadays, databases become dynamic and change rapidly and periodically: new transactions are added to the database and\/or old transactions are updated or removed from the database. Incremental mining was introduced to overcome the problem of maintaining previously generated association rules in dynamic databases. In this paper, we propose an efficient algorithm (IMIDB) for incremental itemset mining in large databases. The algorithm utilizes the trie data structure for indexing dynamic database transactions. Performance comparison of the proposed algorithm to recently cited algorithms shows that a significant improvement of about two orders of magnitude is achieved by our algorithm. Also, the proposed algorithm exhibits linear scalability with respect to database size.<\/jats:p>","DOI":"10.1515\/jisys-2015-0107","type":"journal-article","created":{"date-parts":[[2015,11,20]],"date-time":"2015-11-20T10:04:14Z","timestamp":1448013854000},"page":"69-85","source":"Crossref","is-referenced-by-count":0,"title":["IMIDB: An Algorithm for Indexed Mining of Incremental Databases"],"prefix":"10.1515","volume":"26","author":[{"given":"Mohammed M.","family":"Fouad","sequence":"first","affiliation":[{"name":"Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia"},{"name":"Faculty of Computers and Information Sciences, Ain Shams University, Cairo 11566, Egypt"}]},{"given":"Mostafa G.M.","family":"Mostafa","sequence":"additional","affiliation":[{"name":"Faculty of Computers and Information Sciences, Ain Shams University, Cairo 11566, Egypt"}]},{"given":"Abdulfattah S.","family":"Mashat","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia"}]},{"given":"Tarek F.","family":"Gharib","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia"},{"name":"Faculty of Computers and Information Sciences, Ain Shams University, Cairo 11566, Egypt"}]}],"member":"374","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"2025120523280701432_j_jisys-2015-0107_ref_001_w2aab3b7d297b1b6b1ab2ab1Aa","unstructured":"R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in: Proc. Int. Conf. Very Large Data Bases VLDB\u201994, pp. 487\u2013499, Morgan Kaufmann, Santiago de Chile, Chile, 1994."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_002_w2aab3b7d297b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"F. Bodon, A trie-based APRIORI implementation for mining frequent item sequences, in: Proc. 1st Int. Workshop Open Source Data Mining OSDM\u201905, pp. 56\u201365, ACM, Chicago, IL, USA, 2005.","DOI":"10.1145\/1133905.1133913"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_003_w2aab3b7d297b1b6b1ab2ab3Aa","unstructured":"R. Chan, Q. Yang and Y. D. Shen, Mining high utility itemsets, in: Proc. 3rd IEEE Int. Conf. Data Mining, pp. 19\u201326, IEEE Computer Society, Melbourne, FL, USA, 2003."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_004_w2aab3b7d297b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"C. H. Chang and S. H. Yang, Enhancing SWF for incremental association mining by itemset maintenance, in: Proc. 7th Pacific-Asia Conf. Knowledge Discovery and Data Mining PAKDD\u201903, pp. 301\u2013212, Springer-Verlag Berlin, Seoul, Korea, 2003.","DOI":"10.1007\/3-540-36175-8_30"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_005_w2aab3b7d297b1b6b1ab2ab5Aa","doi-asserted-by":"crossref","unstructured":"C. C. Change, Y. C. Li and J. S. Lee, An efficient algorithm for incremental mining of association rules, in: Proc. 15th Int. Workshop Research Issues in Data Engineering: Stream Data Mining and Applications RIDE-SDMA\u201905, pp. 1\u20138, IEEE Computer Society, Tokyo, Japan, 2005.","DOI":"10.1109\/RIDE.2005.4"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_006_w2aab3b7d297b1b6b1ab2ab6Aa","doi-asserted-by":"crossref","unstructured":"D. W. Cheung, J. Han, V. T. Ng and C. Y. Wong, Maintenance of discovered association rules in large databases: an incremental updating approach, in: Proc. 12th IEEE Int. Conf. Data Engineering, pp. 106\u2013114, IEEE Computer Society, Chicago, IL, USA, 1996.","DOI":"10.1109\/ICDE.1996.492094"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_007_w2aab3b7d297b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"D. W. Cheung, S. D. Lee and B. Kao, A general incremental technique for maintaining discovered association rules, in: Proc. 5th Int. Conf. Database Systems for Advanced Applications, pp. 185\u2013194, World Scientific, Melbourne, FL, USA, 1997.","DOI":"10.1142\/9789812819536_0020"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_008_w2aab3b7d297b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"J. Ding and S. Yau, TCOM, an innovative data structure for mining association rules among infrequent items, Comput. Math. Appl.57 (2009), 290\u2013301.","DOI":"10.1016\/j.camwa.2008.09.044"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_009_w2aab3b7d297b1b6b1ab2ab9Aa","unstructured":"Frequent Itemset Mining Dataset Repository, Available at: http:\/\/fimi.ua.ac.be\/data\/, Accessed 28 June, 2014."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_010_w2aab3b7d297b1b6b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"T. F. Gharib, M. Taha and H. Nassar, An efficient technique for incremental updating of association rules, Int. J. Hybrid Intell. Syst.5 (2008), 45\u201353.","DOI":"10.3233\/HIS-2008-5104"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_011_w2aab3b7d297b1b6b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"T. F. Gharib, H. Nassar, M. Taha and A. Abraham, An efficient algorithm for incremental mining of temporal association rules, Data Knowl. Eng.69 (2010), 800\u2013815.","DOI":"10.1016\/j.datak.2010.03.002"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_012_w2aab3b7d297b1b6b1ab2ac12Aa","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, Y. Yin and R. Mao, Mining frequent patterns without candidate generation: a frequent-pattern tree approach, Data Mining Knowl. Discov.8 (2004), 53\u201387.","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_013_w2aab3b7d297b1b6b1ab2ac13Aa","doi-asserted-by":"crossref","unstructured":"T. P. Hong, J. W. Lin and Y. L. Wu, A fast updated frequent pattern tree, in: Proc. IEEE Int. Conf. Systems, Man, Cybernet., pp. 2167\u20132172, IEEE Computer Society, Taipei, Taiwan, 2006.","DOI":"10.1109\/ICSMC.2006.385182"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_014_w2aab3b7d297b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"T. P. Hong, C. W. Lin and Y. L. Wu, Incrementally fast updated frequent pattern trees, Expert Syst. Appl.34 (2008), 2424\u20132435.","DOI":"10.1016\/j.eswa.2007.04.009"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_015_w2aab3b7d297b1b6b1ab2ac15Aa","unstructured":"IBM Synthetic Dataset Generator, Available at: http:\/\/miles.cnuce.cnr.it\/~palmeri\/datam\/DCI\/, Accessed 28 June, 2014."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_016_w2aab3b7d297b1b6b1ab2ac16Aa","unstructured":"D. K. Knuth, The Art of Computer Programming, vol. 3. Addison-Wesley, Redwood City, CA, 1968."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_017_w2aab3b7d297b1b6b1ab2ac17Aa","doi-asserted-by":"crossref","unstructured":"C. H. Lee, C. R. Lin and M. S. Chen, Sliding-window filtering: an efficient algorithm for incremental mining, in: Proc. Int. Conf. Information and Knowledge Management, pp. 263\u2013270, ACM, Atlanta, GA, USA, 2001.","DOI":"10.1145\/502585.502630"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_018_w2aab3b7d297b1b6b1ab2ac18Aa","doi-asserted-by":"crossref","unstructured":"C. W. Lin, T. P. Hong and W. H. Lu, The pre-FUFP algorithm for incremental mining, Expert Syst. Appl.36 (2009), 9498\u20139505.","DOI":"10.1016\/j.eswa.2008.03.014"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_019_w2aab3b7d297b1b6b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"C. W. Lin, G. C. Lan and T. P. Hong, An incremental mining algorithm for high utility itemsets, Expert Syst. Appl.39 (2012), 7173\u20137180.","DOI":"10.1016\/j.eswa.2012.01.072"},{"key":"2025120523280701432_j_jisys-2015-0107_ref_020_w2aab3b7d297b1b6b1ab2ac20Aa","unstructured":"T. S. Prakash and P. Thangaraj, IMine: index support for item set mining in item set extraction, in: Proc. Int. Conf. Advanced Computer Technology ICACT, pp. 11\u201314, IEEE Computer Society, Phoenix Park, Korea, 2011."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_021_w2aab3b7d297b1b6b1ab2ac21Aa","unstructured":"The Apache Hadoop Project, Available at: https:\/\/hadoop.apache.org\/, Accessed online 1 June, 2015."},{"key":"2025120523280701432_j_jisys-2015-0107_ref_022_w2aab3b7d297b1b6b1ab2ac22Aa","doi-asserted-by":"crossref","unstructured":"H. Yao and H. J. Hamilton, Mining itemset utilities from transaction databases, Data Knowl. Eng.59 (2006), 603\u2013626.","DOI":"10.1016\/j.datak.2005.10.004"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/26\/1\/article-p69.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0107\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0107\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:28:16Z","timestamp":1764977296000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0107\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,20]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,11,20]]},"published-print":{"date-parts":[[2017,1,1]]}},"alternative-id":["10.1515\/jisys-2015-0107"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2015-0107","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2015,11,20]]}}}