{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:21:28Z","timestamp":1737004888983,"version":"3.33.0"},"reference-count":24,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Artificial Intelligence"],"published-print":{"date-parts":[[2007,2,8]]},"DOI":"10.1080\/08839510601115544","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T03:09:42Z","timestamp":1175224182000},"page":"57-79","source":"Crossref","is-referenced-by-count":3,"title":["ON DATA STRUCTURES FOR ASSOCIATION RULE DISCOVERY"],"prefix":"10.1080","volume":"21","author":[{"given":"Xiaowei","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shichao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengqi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Agarwal , R. , C. Aggarwal , and V. Prasad . 2000 . Depth first generation of long patterns . InProceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 108 \u2013 118 , Boston , Massachusetts , USA.","DOI":"10.1145\/347090.347114"},{"key":"CIT0002","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"Agarwal R.","year":"2000","journal-title":"Journal of Parallel and Distributed Computing, Special Issue on High Performance Data Mining"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Agrawal , R. , T. Imielinski , and A. Swami . 1993 . Mining association rules between sets of items in large databases. InProceedings of ACM SIGMOD International Conference on Management of Data(SIGMOD'93) , pages 207 \u2013 216 , Washington , D.C. USA .","DOI":"10.1145\/170036.170072"},{"key":"CIT0004","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1996"},{"volume-title":"The Design and Analysis of Computer Algorithms","year":"1976","author":"Aho A.","key":"CIT0005"},{"volume-title":"UCI Repository of Machine Learning Databases","year":"1998","author":"Blake C.","key":"CIT0006"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Brin , S. , R. Motwani , and C. Silverstein . 1997 . Beyond market baskets: Generalizing association rules to correlations . InProceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'97), pages 265 \u2013 276 , Tucson , Arizona , USA .","DOI":"10.1145\/253262.253327"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Brin , S. , R. Motwani , J. Ullman , and S. Tsur . 1997 . Dynamic itemset counting and implication rules for market basket data . InProceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'97), pages 255 \u2013 264 , Tucson , Arizona , USA .","DOI":"10.1145\/253262.253325"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Burdick , D. , M. Calimlim , and J. Gehrke . 2001 . MAFIA: A maximal frequent itemset algorithm for transactional databases . InProceedings of the 17th International Conference on Data Engineering, pages 443 \u2013 452 , Heidelberg , Germany .","DOI":"10.1109\/ICDE.2001.914857"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"El-Hajj , M. and O. Zaane . 2003 . Inverted matrix: Efficient discovery of frequent items in large datasets in the context of interactive mining . InProceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington D.C. , USA .","DOI":"10.1145\/956750.956766"},{"key":"CIT0011","unstructured":"Han , J. and Y. Fu . 1995 . Discovery of multiple level association rules from large databases . InProceedings of 21st International Conference on Very Large Databases (VLDB'95), pages 420 \u2013 431 , Zurich , Switzerland ."},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"Han , J. , J. Pei , and Y. Yin . 2000 . Mining frequent patterns without candidate generation . InProceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), pages 1 \u2013 12 , Dallas , Texas , USA .","DOI":"10.1145\/335191.335372"},{"key":"CIT0013","unstructured":"Huang , H.,X. Wu, andR. Relue.2002.Association analysis with one scan of databases. InProceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), pages629\u2013631, Maebashi City , Japan."},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Liu , J. , Y. Pan , K. Wang , and J. Han . 2002 . Mining frequent item sets by opportunistic projection . InProceedings of the Eighth ACM SIGKDD, pages 229 \u2013 238 , Edmonton , Alberta , Canada .","DOI":"10.1145\/775079.775081"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Park , J. , M. Chen , and P. Yu . 1995 . An effective hash based algorithm for mining association rules . InProceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'95), pages 175 \u2013 186 , San Jose , California , USA .","DOI":"10.1145\/223784.223813"},{"key":"CIT0016","unstructured":"Pei , J. , J. Han , H. Lu , S. Nishio , S. Tang , and D. Yang . 2001 . H-Mine: Hyper-structure mining of frequent patterns in large databases . InProceedings of the 2001 IEEE International Conference on Data Mining (ICDM'01), pages 441 \u2013 448 , San Jose , California , USA ."},{"key":"CIT0017","unstructured":"Savasere , A. , E. Omiecinski , and S. Navathe . 1995 . An efficient algorithm for mining association rules in large databases . InProceedings of the 21st International Conference on Very Databases (VLDB'95), pages 432 \u2013 444 , Zurich , Switzerland ."},{"key":"CIT0018","unstructured":"Sucahyo , Y. and R. Gopalan . 2003 . CT-ITL: Efficient frequent item set mining using a compressed prefix tree with pattern growth . InProceedings of the 14th Australasion Database Conference (ADC2003), pages 95 \u2013 104 , Adelaide , Australia ."},{"key":"CIT0019","doi-asserted-by":"crossref","unstructured":"Tan , P. , V. Kumar , and J. Srivastava . 2002 . Selecting the right interestingness measure for association patterns . InProceedings of the 8th International Conference on Knowledge Discovery and Data Mining, pages 32 \u2013 41 , Edmonton , Alberta , Canada .","DOI":"10.1145\/775052.775053"},{"key":"CIT0020","unstructured":"Toivonen , H. 1996 . Sampling large databases for association rules . InProceedings of the 22nd International Conference on Very Large Databases (VLDB'96), pages 134 \u2013 145 , Mumbay , India ."},{"key":"CIT0021","unstructured":"Xu , Y. , J. Yu , G. Liu , and H. Lu . 2002 . From path tree to frequent patterns: A framework for Mining Frequent Patterns . InProceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), pages 514 \u2013 521 , Maebashi City , Japan ."},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"Yan , X. , C. Zhang , and S. Zhang . 2003 . A database-independent approach of mining association rules with genetic algorithm . InProceedings of the Fourth International Conference on Intelligent Data Engineering and Automeated Learning(IDEAL) , pages 882 \u2013 886 , Hong Kong .","DOI":"10.1007\/978-3-540-45080-1_123"},{"key":"CIT0023","doi-asserted-by":"crossref","unstructured":"Yan , X. , C. Zhang , and S. Zhang . 2004 . Identifying software component association with genetic algorithm .International Journal of Software Engineering and Knowledge Engineering: Special Issue on Data Mining for Software Engineering and Knowledge Engineering, (accepted, forthcoming) .","DOI":"10.1142\/S0218194004001695"},{"key":"CIT0024","unstructured":"Zaki , M. , S. Parthasarathy , M. Ogihara , and W. Li . 1997 . New algorithms for fast discovery of association rules . InProceedings of the 3rd International Conference on Knowledge Discovery in Databases (KDD'97), pages 283 \u2013 286 , Newport Beach , California , USA ."}],"container-title":["Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/08839510601115544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T08:52:05Z","timestamp":1736931125000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/08839510601115544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,8]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,2,8]]}},"alternative-id":["10.1080\/08839510601115544"],"URL":"https:\/\/doi.org\/10.1080\/08839510601115544","relation":{},"ISSN":["0883-9514","1087-6545"],"issn-type":[{"type":"print","value":"0883-9514"},{"type":"electronic","value":"1087-6545"}],"subject":[],"published":{"date-parts":[[2007,2,8]]}}}