{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:29:42Z","timestamp":1766136582588,"version":"3.37.3"},"reference-count":10,"publisher":"Wiley","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["XDJK2009C027","2013001287"],"award-info":[{"award-number":["XDJK2009C027","2013001287"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science & Technology Project","award":["XDJK2009C027","2013001287"],"award-info":[{"award-number":["XDJK2009C027","2013001287"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2015]]},"abstract":"<jats:p>Association rules mining is an important technology in data mining. FP-Growth (frequent-pattern growth) algorithm is a classical algorithm in association rules mining. But the FP-Growth algorithm in mining needs two times to scan database, which reduces the efficiency of algorithm. Through the study of association rules mining and FP-Growth algorithm, we worked out improved algorithms of FP-Growth algorithm\u2014Painting-Growth algorithm and N (not) Painting-Growth algorithm (removes the painting steps, and uses another way to achieve). We compared two kinds of improved algorithms with FP-Growth algorithm. Experimental results show that Painting-Growth algorithm is more than 1050 and N Painting-Growth algorithm is less than 10000 in data volume; the performance of the two kinds of improved algorithms is better than that of FP-Growth algorithm.<\/jats:p>","DOI":"10.1155\/2015\/910281","type":"journal-article","created":{"date-parts":[[2015,3,15]],"date-time":"2015-03-15T21:01:34Z","timestamp":1426453294000},"page":"1-6","source":"Crossref","is-referenced-by-count":28,"title":["Research of Improved FP-Growth Algorithm in Association Rules Mining"],"prefix":"10.1155","volume":"2015","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2787-9276","authenticated-orcid":true,"given":"Yi","family":"Zeng","sequence":"first","affiliation":[{"name":"Faculty of Computer and Information Science, Southwest University, Chongqing 400715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiqun","family":"Yin","sequence":"additional","affiliation":[{"name":"Faculty of Computer and Information Science, Southwest University, Chongqing 400715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangyue","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Computer and Information Science, Southwest University, Chongqing 400715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Faculty of Computer and Information Science, Southwest University, Chongqing 400715, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"3","key":"1","first-page":"8","volume":"17","year":"2005","journal-title":"Journal of Anhui Institute of Mechanical & Electrical Engineering: Natural Science"},{"issue":"5","key":"2","first-page":"629","volume":"44","year":"2005","journal-title":"Journal of Xiamen University (Natural Science)"},{"issue":"7","key":"3","first-page":"1506","year":"2010","journal-title":"Computer Engineering and Design"},{"key":"4","first-page":"76","volume":"1","year":"2010","journal-title":"Journal of Yangtze University (Natural Science Edition): Science & Engineering"},{"issue":"4","key":"5","first-page":"491","volume":"29","year":"2009","journal-title":"Journal of Xi'an University of Science and Technology"},{"issue":"6","key":"6","first-page":"47","volume":"35","year":"2008","journal-title":"Applied Science and Technology"},{"key":"7","first-page":"34","volume":"12","year":"2013","journal-title":"Information Technology"},{"issue":"4","key":"8","first-page":"9","volume":"17","year":"2008","journal-title":"Journal of Pingdingshan Institute of Technology"},{"issue":"12","key":"9","first-page":"223","volume":"40","year":"2013","journal-title":"Computer Science"},{"year":"2001","key":"10"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2015\/910281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2015\/910281.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2015\/910281.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T01:29:27Z","timestamp":1589506167000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/sp\/2015\/910281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":10,"alternative-id":["910281","910281"],"URL":"https:\/\/doi.org\/10.1155\/2015\/910281","relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"type":"print","value":"1058-9244"},{"type":"electronic","value":"1875-919X"}],"subject":[],"published":{"date-parts":[[2015]]}}}