{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T04:41:30Z","timestamp":1777524090082,"version":"3.51.4"},"reference-count":41,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"1","license":[{"start":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T00:00:00Z","timestamp":1517443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Methods in Sciences and Engineering"],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p>This paper proposes a frequent itemset mining algorithm based on the divide and conquer strategy in composite granular computing. In order to construct composite information granules (CIGs) and find the frequent patterns, an iterative approach is used in this algorithm. First, create atomic information granules. Next, atomic composite information granules are generated by atomic information granules. Then, through the intersect operation between atomic composite information granules and prune action, the frequent 2-CIGs that will be used to construct frequent 3-CIGs will be constructed, and so on, until no more frequent CIGs can be found. When creating CIGs, this method will improve the computing speed by logical operation in binary. It can avoid scanning database frequently and avoid using complex data structure, so it will reduce the I\/O overhead and save a lot of memory space. And it also can optimize the generation of candidate CIGs and compress the transaction database dynamically. The experimental results show that this algorithm has good performance and has low computational complexity and high efficiency.<\/jats:p>","DOI":"10.3233\/jcm-180786","type":"journal-article","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T13:49:37Z","timestamp":1517320177000},"page":"247-257","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["A frequent itemset mining algorithm based on composite granular computing"],"prefix":"10.66113","volume":"18","author":[{"given":"Hongjuan","family":"Wu","sequence":"first","affiliation":[{"name":"Chongqing Three Gorges University","place":["China"]}]},{"given":"Yulu","family":"Liu","sequence":"additional","affiliation":[{"name":"Chongqing Three Gorges University","place":["China"]}]},{"given":"Pei","family":"Yan","sequence":"additional","affiliation":[{"name":"Chongqing Three Gorges University","place":["China"]}]},{"given":"Gang","family":"Fang","sequence":"additional","affiliation":[{"name":"Chongqing Three Gorges University","place":["China"]}]},{"given":"Jing","family":"Zhong","sequence":"additional","affiliation":[{"name":"Chongqing Three Gorges University","place":["China"]}]}],"member":"55691","published-online":{"date-parts":[[2018,2]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"Piatestsky-ShapiroG. (ed.) Knowledge discovery in databases AAAI\/MIT Press 1991."},{"issue":"1","key":"e_1_3_3_3_2","first-page":"1","article-title":"Prediction of surface water supply sources for the district of columbia using least squares support vector machines (LS-SVM) method","volume":"4","author":"Zhang N.","year":"2015","unstructured":"ZhangN. KamahaR. and BeheraP., Prediction of surface water supply sources for the district of columbia using least squares support vector machines (LS-SVM) method, Advances in Computer Science an International Journal 4(1) (2015), 1\u20139.","journal-title":"Advances in Computer Science an International Journal"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.3233\/JCM-2009-0238"},{"issue":"4","key":"e_1_3_3_5_2","first-page":"253","article-title":"Investigating the prognostic accuracy of standardized data mining algorithms in intensive care unit","volume":"8","author":"Gortzis L.G.","year":"2008","unstructured":"GortzisL.G. SakellaropoulosF. IliasI. et al., Investigating the prognostic accuracy of standardized data mining algorithms in intensive care unit, Journal of Computational Methods in Sciences and Engineering 8(4) (2008), 253\u2013262.","journal-title":"Journal of Computational Methods in Sciences and Engineering"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-013-0265-4"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218194009004325"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.3233\/JCM-2012-0442"},{"key":"e_1_3_3_10_2","unstructured":"AgrawalR. and SrikantR. Fast algorithms for mining association rules in: Proc. 20th VLDB Conf. Santiago Chile 1994 pp. 487\u2013499."},{"key":"e_1_3_3_11_2","first-page":"4715","article-title":"A new perfect hashing and pruning algorithm for mining association rule","volume":"2011","author":"Najadat H.","year":"2011","unstructured":"NajadatH. ShatnawiA. and ObiedatG., A new perfect hashing and pruning algorithm for mining association rule, Communications of the Ibima 2011 (2011), 4715\u20134725.","journal-title":"Communications of the Ibima"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.14257\/ijdta.2016.9.1.15"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213013500176"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/CJECE.2014.2343258"},{"key":"e_1_3_3_15_2","unstructured":"YaoY. Granular computing: basic issues and possible solutions in: Proc. 5th Joint Conf. on Information Sciences Atlantic NJ USA 2000 pp. 186\u2013189."},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"PedryczW. Granular computing: an introduction in: Proc. 20th NAFIPS Int. Conf. Vancouver BC 2001 pp. 1349\u20131354.","DOI":"10.1109\/NAFIPS.2001.943745"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2013.02.005"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2012.03.009"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10231-016-0608-1"},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","unstructured":"PedryczW. Granular computing: analysis and design of intelligent systems CRC Press 2013.","DOI":"10.1201\/b14862"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48912-6_5"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.08.037"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2361772"},{"key":"e_1_3_3_24_2","doi-asserted-by":"crossref","unstructured":"ChenG. ZhongN. and YaoY. A hypergraph model of granular computing in: Proc. IEEE International Conference on Granular Computing 2008 pp. 130\u2013135.","DOI":"10.1109\/GRC.2008.4664749"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.01.023"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.223"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2009.2013334"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","unstructured":"LiX. FangL. LuZ. ZhangJ. and ZhaoH. A line flow granular computing approach for economic dispatch with line constraints IEEE Trans. on Power Systems 2017 DOI: 10.1109\/TPWRS.2017.2665583.","DOI":"10.1109\/TPWRS.2017.2665583"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","unstructured":"KokV.J. and ChanC.S. GrCS: Granular computing-based crowd segmentation IEEE Trans. on Cybernetics 2016 DOI: 10.1109\/TCYB.2016.2538765.","DOI":"10.1109\/TCYB.2016.2538765"},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","unstructured":"RoselinR. and ThangavelK. Mammogram image segmentation using granular computing based on rough entropy in: Int. Conf. on Pattern Recognition Informatics and Medical Engineering (PRIME) 21\u201323 March 2012 pp. 318\u2013323.","DOI":"10.1109\/ICPRIME.2012.6208365"},{"key":"e_1_3_3_31_2","unstructured":"YaoY. and ZhongN. Potential applications of granular computing in knowledge discovery and data mining in: Proc. of World Multiconference on Systemics Cybernetics and Informatics 1999 pp. 573\u2013580."},{"key":"e_1_3_3_32_2","unstructured":"YaoY. Modeling data mining with granular computing in: Proc. COMPSAC 2001 Conf. Chicago IL 2001 pp. 638\u2013643."},{"issue":"25","key":"e_1_3_3_33_2","first-page":"165","article-title":"Granular computing approach to finding association rules in relational database","author":"Qiu T.","year":"2010","unstructured":"QiuT. ChenX. LiuQ. and HuangH., Granular computing approach to finding association rules in relational database, International Journal of Intelligent Systems (25) (2010), 165\u2013179.","journal-title":"International Journal of Intelligent Systems"},{"issue":"11","key":"e_1_3_3_34_2","first-page":"234","article-title":"Algorithm of mining association rules based on rough sets and transaction itemsets combination","volume":"38","author":"Wang M.","year":"2011","unstructured":"WangM. JiangY. WangY. et al., Algorithm of mining association rules based on rough sets and transaction itemsets combination, Computer Science 38(11) (2011), 234\u2013239.","journal-title":"Computer Science"},{"issue":"8","key":"e_1_3_3_35_2","first-page":"86","article-title":"Association rules mining algorithm based on granular computing","volume":"35","author":"Zhang Y.","year":"2009","unstructured":"ZhangY. and YanQ., Association rules mining algorithm based on granular computing, Computer Engineering 35(8) (2009), 86\u201388.","journal-title":"Computer Engineering"},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","unstructured":"XuJ. LiuL. ZhengG. et al. Decision rule acquisition algorithm based on association-characteristic information granular computing in: IEEE International Conference on Granular Computing San Jose CA USA 14\u201316 Aug 2010 pp. 812\u2013816.","DOI":"10.1109\/GrC.2010.38"},{"issue":"4","key":"e_1_3_3_37_2","first-page":"443","article-title":"Frequent spatiotemporal association patterns mining based on granular computing","volume":"37","author":"Fang G.","year":"2013","unstructured":"FangG. and WuY., Frequent spatiotemporal association patterns mining based on granular computing, Informatica 37(4) (2013), 443\u2013453.","journal-title":"Informatica"},{"issue":"8","key":"e_1_3_3_38_2","first-page":"72","article-title":"An improved Apriori algorithm based on transactional granule","volume":"34","author":"Ju Y.","year":"2015","unstructured":"JuY. YuH. and HeJ., An improved Apriori algorithm based on transactional granule, Journal of Luoyang Normal University 34(8) (2015), 72\u201374.","journal-title":"Journal of Luoyang Normal University"},{"key":"e_1_3_3_39_2","doi-asserted-by":"crossref","unstructured":"TsaiL.M. LinS.J. and YangD.L. Efficient mining of generalized negative association rules in: IEEE International Conference on Granular Computing Washington DC 2010 pp. 471\u2013476.","DOI":"10.1109\/GrC.2010.148"},{"issue":"20","key":"e_1_3_3_40_2","first-page":"130","article-title":"Frequent closed itemsets mining based on granular computing","volume":"50","author":"Fang G.","year":"2014","unstructured":"FangG. WangJ. YingH. and TangX., Frequent closed itemsets mining based on granular computing, Computer Engineering and Applications 50(20) (2014), 130\u2013134.","journal-title":"Computer Engineering and Applications"},{"key":"e_1_3_3_41_2","unstructured":"TanP. and SteinbachM. Introduction to data mining Posts & Telecom Press Beijing 2011."},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213014500092"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCM-180786","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCM-180786","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCM-180786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:07:21Z","timestamp":1776809241000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCM-180786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.3233\/JCM-180786"],"URL":"https:\/\/doi.org\/10.3233\/jcm-180786","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}