{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:41:44Z","timestamp":1776811304143,"version":"3.51.2"},"reference-count":24,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2020,9,30]]},"abstract":"<jats:p>With the rapid growth of massive data in all walks of life, massive data faces enormous challenges such as storage capacity and computing power. In Chinese universities, traditional data analysis of student course cannot meet the growing demand for increasing data size and real-time computation of big data. In this paper, a parallel FP-Growth algorithm based on split is proposed. The established FP-Tree is split into blocks, and the split FP-Trees are equally divided into different nodes. The monitoring point is set up to monitor the operation of other nodes, dynamically migrate tasks and maintain load balancing. The experiment proves that each node has good load balancing with the given support degree, and the improved algorithm has better running performance than the classic FP-Growth algorithm in parallel processing. Finally, the parallel FP-Growth algorithm based on split is implemented on Hadoop to mine association rules between course grades. The mining process includes data preprocessing, mining results and analysis. The association rules between course grades provide suggestions for the way students learn and the way teachers teach.<\/jats:p>","DOI":"10.3233\/jcm-194079","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T10:50:25Z","timestamp":1581418225000},"page":"759-769","source":"Crossref","is-referenced-by-count":10,"title":["Research on association rules of course grades based on parallel FP-Growth algorithm"],"prefix":"10.66113","volume":"20","author":[{"given":"Xinyan","family":"Wang","sequence":"first","affiliation":[{"name":"College of Information, Shanghai Ocean University, Shanghai, China"}]},{"given":"Guie","family":"Jiao","sequence":"additional","affiliation":[{"name":"School of Computer Engineering and Science, Shanghai University, Shanghai, China"},{"name":"College of Information Technology, Shanghai JianQiao University, Shanghai, China"}]}],"member":"55691","reference":[{"key":"10.3233\/JCM-194079_ref1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree Approach","author":"Han","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/JCM-194079_ref2","first-page":"3069","article-title":"Optimization and implementation of parallel FP-Growth algorithm based on Spark","volume":"11","author":"Gu","year":"2018","journal-title":"Journal of Computer Applications"},{"key":"10.3233\/JCM-194079_ref3","first-page":"20","article-title":"Improved FP-Growth algorithm and its distributed parallel implementation","volume":"2","author":"Ma","year":"2016","journal-title":"Journal of Harbin University of Science and Technology"},{"issue":"2","key":"10.3233\/JCM-194079_ref4","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1007\/s11227-018-2297-6","article-title":"A parallel FP-growth algorithm on World Ocean Atlas data with multi-core CPU","volume":"75","author":"Jiang","year":"2019","journal-title":"Journal of Supercomputing"},{"key":"10.3233\/JCM-194079_ref5","first-page":"1","article-title":"Knowledge process of health big data using MapReduce-based associative mining","author":"Choi","year":"2019","journal-title":"Personal and Ubiquitous Computing"},{"issue":"3","key":"10.3233\/JCM-194079_ref6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/3199524.3199528","article-title":"GB-PANDAS: Throughput and heavy-traffic optimality analysis for affinity scheduling","volume":"45","author":"Yekkehkhany","year":"2018","journal-title":"ACM Sigmetrics Performance Evaluation Review"},{"issue":"5","key":"10.3233\/JCM-194079_ref7","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.3724\/SP.J.1016.2013.01047","article-title":"Energy-Efficient Algorithms for Distributed File System HDFS","volume":"36","author":"Liao","year":"2013","journal-title":"Chinese Journal of Computers"},{"key":"10.3233\/JCM-194079_ref8","doi-asserted-by":"crossref","unstructured":"X. Wei et al., Incremental FP-Growth mining strategy for dynamic threshold value and database based on MapReduce, IEEE International Conference on Computer Supported Cooperative Work in Design (2014), 271\u2013276.","DOI":"10.1109\/CSCWD.2014.6846854"},{"issue":"2","key":"10.3233\/JCM-194079_ref9","first-page":"244","article-title":"Data analysis of tyre quality based on improved FP-Growth algorithm","volume":"30","author":"Li","year":"2019","journal-title":"China Mechanical Engineering"},{"key":"10.3233\/JCM-194079_ref10","first-page":"169","article-title":"A novel distributed parallel FP-Growth algorithm based on Hadoop framework","author":"Zhang","year":"2016","journal-title":"Hebei Journal of Industrial Science and Technology"},{"key":"10.3233\/JCM-194079_ref11","doi-asserted-by":"crossref","unstructured":"Y. Cho et al., Analysis of anti-cancer cytokines by Apriori algorithm, decision tree, and SVM, International Conference on Big Data and Smart Computing (2015), 232\u2013237.","DOI":"10.1109\/35021BIGCOMP.2015.7072836"},{"key":"10.3233\/JCM-194079_ref12","first-page":"81","article-title":"Design and parallel implementation of minimum spanning tree based K-means algorithm","author":"Li","year":"2017","journal-title":"Journal of Nanjing University of Posts and Telecommunications (Natural Science Edition)"},{"issue":"9","key":"10.3233\/JCM-194079_ref13","first-page":"1874","article-title":"FDTD parallel algorithm based on distributed platform","volume":"42","author":"Feng","year":"2016","journal-title":"Journal of Beijing University of Aeronautics and Astronautics"},{"key":"10.3233\/JCM-194079_ref14","unstructured":"K.K. Jia and H.B. Liu, An improved FP-Growth algorithm based on SOM partition, Abstracts of the Third International Conference of Pioneering Computer Scientists 727 (2017), 62\u201364."},{"key":"10.3233\/JCM-194079_ref15","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.eswa.2016.02.045","article-title":"Pharmacy robotic dispensing and planogram analysis using association rule mining with prescription data","volume":"57","author":"Khader","year":"2016","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JCM-194079_ref16","doi-asserted-by":"crossref","unstructured":"M. Cheng, K. Xu and X. Gong, Research on audit log association rule mining based on improved Apriori algorithm, IEEE International Conference on Big Data Analysis (2016), 1\u20137.","DOI":"10.1109\/ICBDA.2016.7509792"},{"key":"10.3233\/JCM-194079_ref17","unstructured":"H.Y. Chang et al., A hybrid algorithm for frequent pattern mining using MapReduce framework, 2015 1st International Conference on Computational Intelligence Theory Systems and Applications (CCITSA) (2015), pp. 19\u201322."},{"issue":"2","key":"10.3233\/JCM-194079_ref18","first-page":"382","article-title":"Virtual network embedding algorithm for load balance with various requests","volume":"23","author":"Wang","year":"2014","journal-title":"Chinese Journal of Electronics"},{"issue":"4","key":"10.3233\/JCM-194079_ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCM-190021","article-title":"Load balancing strategy for cloud computing based on dynamic replica technology","volume":"19","author":"Liu","year":"2019","journal-title":"Journal of Computational Methods in Sciences and Engineering"},{"issue":"1","key":"10.3233\/JCM-194079_ref20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCM-191001","article-title":"A novel load balancing strategy based on node load comprehensive measuring under cloud computing environment","volume":"19","author":"Liu","year":"2019","journal-title":"Journal of Computational Methods in Sciences and Engineering"},{"key":"10.3233\/JCM-194079_ref21","first-page":"8","article-title":"The connection rule excavation related algorithm study","author":"Mao","year":"2009","journal-title":"Southwest JiaoTong University"},{"key":"10.3233\/JCM-194079_ref22","unstructured":"Q.M. Xie, A. Yekkehkhany and Y. Lu, Scheduling with multi-level data locality: Throughput and heavy-traffic optimality, In IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications (2016), pp.\u00a01\u20139."},{"key":"10.3233\/JCM-194079_ref23","first-page":"150","article-title":"Research and implementation of parallel FP-Growth algorithm based on Hadoop","author":"Shi","year":"2015","journal-title":"Microelectronics & Computer"},{"key":"10.3233\/JCM-194079_ref24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.eswa.2018.07.010","article-title":"Identifying risk factors for adverse diseases using dynamic rare association rule mining","volume":"113","author":"Borah","year":"2018","journal-title":"Expert Systems with Applications"}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCM-194079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:06:00Z","timestamp":1776809160000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JCM-194079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,30]]},"references-count":24,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jcm-194079","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,30]]}}}