{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:19:30Z","timestamp":1737523170644,"version":"3.33.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,8]]},"DOI":"10.1109\/coginf.2007.4341914","type":"proceedings-article","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T17:45:54Z","timestamp":1191951954000},"page":"385-390","source":"Crossref","is-referenced-by-count":17,"title":["An Algorithm to Improve the Effectiveness of Apriori"],"prefix":"10.1109","author":[{"given":"Dongme","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaohua","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"1785","article-title":"Study of Some Key Techniques in Mining Association Rule","volume":"tp 42","author":"geng","year":"2005","journal-title":"Journal of Computer research and development"},{"key":"ref3","first-page":"150","article-title":"DataMining: Concepts and Techniques[M]","author":"han","year":"2001"},{"key":"ref6","first-page":"27","article-title":"Researching on a mining association rule algorithm based on searching algorithm [D]","author":"huan yu","year":"0","journal-title":"full search library of chinese Academic degree"},{"key":"ref5","first-page":"15","article-title":"A NEW ALGORITHM OF ASSOCIATION RULES MINING-INVERSE DECOMPOSITION ALGORITHM","volume":"22","author":"xingliang","year":"2002","journal-title":"Computer Application"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1360\/jos160215","article-title":"Efficiently Mining of Maximal Frequent Item Sets Based on FP-Tree[J]","volume":"16","author":"yue-jin","year":"2005","journal-title":"Journalof Software"},{"key":"ref7","first-page":"1","article-title":"Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism Decision Support Systems","volume":"42","author":"hu","year":"2006"},{"key":"ref2","first-page":"478","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawa","year":"1994","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref9","first-page":"45","article-title":"A Fast Algorithm for Mining Maximum Frequent Item Sets","volume":"3","author":"hai-sheng","year":"2004","journal-title":"Computer Applications and research"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","article-title":"Mining association rules between sets of items in large databases (C)","author":"agrawa","year":"1993","journal-title":"Proc of the ACM SIGMOD Conf on Management of Data"}],"event":{"name":"6th IEEE International Conference on Cognitive Informatics","start":{"date-parts":[[2007,8,6]]},"end":{"date-parts":[[2007,8,8]]}},"container-title":["6th IEEE International Conference on Cognitive Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4341857\/4341858\/04341914.pdf?arnumber=4341914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T14:15:25Z","timestamp":1737468925000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4341914\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/coginf.2007.4341914","relation":{},"subject":[],"published":{"date-parts":[[2007,8]]}}}