{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T06:19:28Z","timestamp":1673417968429},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Info. Know. Mgmt."],"published-print":{"date-parts":[[2004,12]]},"abstract":"<jats:p> Association rule mining (ARM) is the data-mining process for finding all association rules in datasets matching user-defined measures of interest such as support and confidence. Usually, ARM proceeds by mining all frequent itemsets \u2014 a step known to be very computationally intensive \u2014 from which rules are then derived in a straight forward manner. In general, mining all frequent itemsets prunes the space by using the downward closure (or anti-monotonicity) property of support which states that no itemset can be frequent unless all of its subsets are frequent. A large number of papers have addressed the problem of ARM but not many of them have focused on scalability over very large datasets (i.e. when datasets contain a very large number of transactions). In this paper, we propose a new model for representing data and mining frequent itemsets that is based on the P-tree technology for compression and faster logical operations over vertically structured data and on set enumeration trees for fast itemset enumeration. Experimental results presented hereinafter show big improvements for our approach over large datasets when compared to other contemporary approaches in the literature. <\/jats:p>","DOI":"10.1142\/s0219649204000912","type":"journal-article","created":{"date-parts":[[2004,11,30]],"date-time":"2004-11-30T06:50:55Z","timestamp":1101797455000},"page":"317-329","source":"Crossref","is-referenced-by-count":3,"title":["A Scalable Vertical Model for Mining Association Rules"],"prefix":"10.1142","volume":"03","author":[{"given":"Imad","family":"Rahal","sequence":"first","affiliation":[{"name":"Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA"}]},{"given":"Dongmei","family":"Ren","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA"}]},{"given":"William","family":"Perrizo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Operations  Research, North Dakota State University, Fargo, North Dakota, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320125"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90211-9"},{"key":"rf16","volume-title":"Simulation Modeling and Analysis","author":"Law A.","year":"2000"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"}],"container-title":["Journal of Information &amp; Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219649204000912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:31:24Z","timestamp":1565134284000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219649204000912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":4,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1142\/S0219649204000912"],"URL":"https:\/\/doi.org\/10.1142\/s0219649204000912","relation":{},"ISSN":["0219-6492","1793-6926"],"issn-type":[{"value":"0219-6492","type":"print"},{"value":"1793-6926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}