{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:01:10Z","timestamp":1753887670086,"version":"3.41.2"},"reference-count":32,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T00:00:00Z","timestamp":1611964800000},"content-version":"vor","delay-in-days":29,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The teaching management department carries all the work related to teaching in the whole school. A scientific, efficient, and complete teaching management system cannot only help the teaching management department improve work efficiency and quality but also greatly reduce many problems caused by manual labour risk. This paper designs and implements a teaching management system based on an improved association rule algorithm. First, aiming at the low efficiency of the Apriori algorithm for mining association rules, an association rule model based on interest is proposed. Second, use the MapReduce calculation model to partition the transaction database, then use the improved Apriori optimization algorithm for mining, and finally merge the mining results to obtain frequent itemsets. Through experiments, the optimized algorithm has greatly improved selection mining and computing time than traditional algorithms.<\/jats:p>","DOI":"10.1155\/2021\/6688463","type":"journal-article","created":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T23:50:06Z","timestamp":1612050606000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimization of Teaching Management System Based on Association Rules Algorithm"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2633-0628","authenticated-orcid":false,"given":"Qing","family":"Niu","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,1,30]]},"reference":[{"key":"e_1_2_8_1_2","doi-asserted-by":"publisher","DOI":"10.3968\/11394"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.12691\/jbms-7-3-2"},{"key":"e_1_2_8_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tele.2019.01.007"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2016.2568756"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10758-019-09408-7"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.077"},{"key":"e_1_2_8_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.11.013"},{"key":"e_1_2_8_8_2","unstructured":"AgrawalR.andSrikantR. Fast algorithms for mining association rules in large databases Proceedings of the 20th International Conference on Very Large Data Bases September 1994 Santiago Chile 487\u2013499."},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.17706\/jcp.14.1.52-62"},{"key":"e_1_2_8_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-019-01222-4"},{"key":"e_1_2_8_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2016.11.036"},{"key":"e_1_2_8_12_2","doi-asserted-by":"publisher","DOI":"10.1504\/ijhpcn.2017.10005138"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/23270012.2017.1373261"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13673-020-00247-5"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-1963-4"},{"key":"e_1_2_8_16_2","doi-asserted-by":"publisher","DOI":"10.1504\/ijwgs.2020.109475"},{"key":"e_1_2_8_17_2","doi-asserted-by":"publisher","DOI":"10.12928\/telkomnika.v17i6.10064"},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.25165\/j.ijabe.20191205.4881"},{"key":"e_1_2_8_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.psep.2018.11.019"},{"key":"e_1_2_8_20_2","first-page":"65","article-title":"EHUSM: mining high utility sequences with a pessimistic utility model","volume":"4","author":"Truong T.","year":"2020","journal-title":"Data Science and Pattern Recognition"},{"key":"e_1_2_8_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01743-y"},{"key":"e_1_2_8_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.10.010"},{"key":"e_1_2_8_23_2","doi-asserted-by":"crossref","unstructured":"LiuM.andQuJ. Mining high utility itemsets without candidate generation Proceedings of the 21st ACM International Conference on Information and Knowledge Management October 2012 Maui HI USA 55\u201364.","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_2_8_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tele.2018.11.007"},{"key":"e_1_2_8_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2019.08.080"},{"key":"e_1_2_8_26_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-55609-6"},{"key":"e_1_2_8_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.11.006"},{"key":"e_1_2_8_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.03.016"},{"key":"e_1_2_8_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2017.2743075"},{"key":"e_1_2_8_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.04.001"},{"key":"e_1_2_8_31_2","first-page":"43","article-title":"Implementation of apriori algorithm in determining the level of printing needs","volume":"8","author":"Simanjorang R. M.","year":"2020","journal-title":"Infokum"},{"key":"e_1_2_8_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2420-8"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6688463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/6688463.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6688463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T21:50:58Z","timestamp":1723240258000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6688463"}},"subtitle":[],"editor":[{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6688463"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6688463","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-12-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6688463"}}