{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:21:06Z","timestamp":1777695666917,"version":"3.51.4"},"reference-count":46,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2018,6,27]]},"DOI":"10.3233\/ida-173473","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T15:04:26Z","timestamp":1530630266000},"page":"807-827","source":"Crossref","is-referenced-by-count":10,"title":["TFI-Apriori: Using new encoding to optimize the apriori algorithm"],"prefix":"10.1177","volume":"22","author":[{"given":"Ebrahim","family":"Ansari","sequence":"first","affiliation":[{"name":"Department of Computer Sciences and Information Technology, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran"}]},{"given":"M.H.","family":"Sadreddini","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shiraz University, Shiraz, Iran"}]},{"given":"S.M.H.","family":"Mirsadeghi","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences and Information Technology, Institute for Advanced Studies in Basic Sciences, Zanjan, Iran"}]},{"given":"Morteza","family":"Keshtkaran","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shiraz University, Shiraz, Iran"}]},{"given":"Richard","family":"Wallace","sequence":"additional","affiliation":[{"name":"Distributed Systems Architecture Research Group, Complutense University, Madrid, Spain"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-173473_ref1","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993","journal-title":"Proceedings 1993 ACM SIGMOD Intl. Conf. on Management of Data"},{"key":"10.3233\/IDA-173473_ref2","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"Agrawal","year":"1994","journal-title":"Proceedings 20th Intl. Conf. on Very Large Data Bases"},{"key":"10.3233\/IDA-173473_ref3","unstructured":"H. Toivonen, T.M. Vijayaraman, A.P. Buchmann, C. Mohan and N.L. Sarda, Sampling large databases for association rules, in: proc. 22nd International Conference on Very Large Data Bases, 1996, 134\u2013145."},{"key":"10.3233\/IDA-173473_ref4","doi-asserted-by":"crossref","unstructured":"J. Hipp, U. G\u00fcntzer, G. Nakhaeizadeh, Algorithms for association rule mining \u2013 a general survey and comparison, ACM SIGKDD Explorations Newsletter 2(1) (2000), 58\u201364.","DOI":"10.1145\/360402.360421"},{"key":"10.3233\/IDA-173473_ref5","first-page":"432","article-title":"An Efficient Algorithm for Mining Association Rules in Large Databases","author":"Savasere","year":"1995","journal-title":"Proceedings of the 21th International Conference on Very Large Data Bases,"},{"key":"10.3233\/IDA-173473_ref6","first-page":"255","article-title":"Dynamic itemset counting and implication rules for market basket data","author":"Brin","year":"1997","journal-title":"Proceedings 1997 ACM SIGMOD Intl. Conf. on Management of Data"},{"key":"10.3233\/IDA-173473_ref7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent pattern without candidate generation: a frequent pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-173473_ref8","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1145\/775047.775114","article-title":"A new two-phase sampling based algorithm for discovering association rules","author":"Chen","year":"2002","journal-title":"Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining"},{"key":"10.3233\/IDA-173473_ref9","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/ICDM.2002.1183923","article-title":"Efficient progressive sampling for association rules","author":"Parthasarathy","year":"2002","journal-title":"Proceeding of 2002 IEEE International Conference on Data Mining"},{"key":"10.3233\/IDA-173473_ref10","unstructured":"C. Borgelt, Efficient implementations of Apriori and \u00e9clat, in: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI\u201903), volume 90 of CEUR Workshop proceedings, Melbourne, Florida, USA, 19 November 2003."},{"key":"10.3233\/IDA-173473_ref11","first-page":"74","article-title":"Mining all non-derivable frequent itemsets","author":"Calders","year":"2002","journal-title":"Proc. Principles and Practice of Knowledge Discovery in Databases PKDD\u201902"},{"key":"10.3233\/IDA-173473_ref12","doi-asserted-by":"crossref","unstructured":"R. de la Briandais, File searching using variable-length keys, in: Western Joint Computer Conference, March 1959, pp.\u00a0295\u2013298.","DOI":"10.1145\/1457838.1457895"},{"issue":"9","key":"10.3233\/IDA-173473_ref13","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie memory","volume":"3","author":"Fredkin","year":"1960","journal-title":"Communications of the ACM"},{"key":"10.3233\/IDA-173473_ref14","unstructured":"F. Bodon, A Fast Apriori Implementation, IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI\u201903), Melbourne, Florida, USA, 2003."},{"key":"10.3233\/IDA-173473_ref15","unstructured":"F. Bodon, Surprising Results of Trie-based FIM Algorithm, in: B. Goethals, M.J. Zaki and R. Bayardo, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Vol. 90 of CEUR Workshop Proceedings, 2004."},{"key":"10.3233\/IDA-173473_ref17","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","article-title":"Scalable algorithms for association mining","volume":"12","author":"Zaki","year":"2000","journal-title":"IEEE Transaction on Knowledge Data Engineering"},{"key":"10.3233\/IDA-173473_ref18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","article-title":"Frequent pattern mining: current status and future directions","author":"Han","year":"2007","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-173473_ref20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0169-023X(00)00055-0","article-title":"TBAR: an efficient method for association rule mining in relational databases","volume":"37","author":"Berzal","year":"2001","journal-title":"Data & Knowledge Engineering"},{"key":"10.3233\/IDA-173473_ref21","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993","journal-title":"Proceedings 1993 ACM SIGMOD Intl. Conf. on Management of Data"},{"issue":"3","key":"10.3233\/IDA-173473_ref22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0169-023X(95)00024-M","article-title":"Set-oriented data mining in relational databases","volume":"17","author":"Houtsma","year":"1995","journal-title":"Data & Knowledge Engineering"},{"issue":"7","key":"10.3233\/IDA-173473_ref23","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/0895-7177(03)90058-6","article-title":"Trie: An alternative data structure for data mining algorithms","volume":"38","author":"Bodon","year":"2003","journal-title":"Mathematical and Computer Modelling"},{"key":"10.3233\/IDA-173473_ref24","doi-asserted-by":"crossref","unstructured":"J.S. Park, M.-S. Chen and P.S. Yu, Using a Hash-Based Method with Transaction Trimming for Mining Association Rules 9(5) (September 1997), 813\u2013825.","DOI":"10.1109\/69.634757"},{"issue":"1","key":"10.3233\/IDA-173473_ref25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","article-title":"Michael Steinbach, David J. Hand, Dan Steinberg, Top 10 algorithms in data mining","volume":"14","author":"Wu","year":"2008","journal-title":"Knowledge and Information Systems"},{"key":"10.3233\/IDA-173473_ref26","first-page":"265","article-title":"Beyond market baskets: generalizing association rules to correlations","author":"Brin","year":"1997","journal-title":"Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data,"},{"key":"10.3233\/IDA-173473_ref27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/ICDE.1995.380415","article-title":"Mining sequential patterns","author":"Agrawal","year":"1995","journal-title":"Proceedings of the 11th International Conference on Data Engineering"},{"key":"10.3233\/IDA-173473_ref28","first-page":"3","article-title":"Mining sequential patterns: generalizations and performance improvements","author":"Srikant","year":"1996","journal-title":"Proceedings of the Fifth International Conference on Extending Database Technology"},{"key":"10.3233\/IDA-173473_ref29","first-page":"5","article-title":"Scalable association-based text classification","author":"Meretakis","year":"2000","journal-title":"Proceedings of the Ninth International Conference on Information and Knowledge Management"},{"key":"10.3233\/IDA-173473_ref30","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/347090.347114","article-title":"Depth first generation of long patterns","author":"Agarwal","year":"2000","journal-title":"Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"10.3233\/IDA-173473_ref31","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/ICDE.2001.914857","article-title":"MAFIA: a maximal frequent itemset algorithm for transactional databases","author":"Burdick","year":"2001","journal-title":"Proceedings of the 17th International Conference on Data Engineering"},{"key":"10.3233\/IDA-173473_ref32","first-page":"85","article-title":"Efficiently mining long patterns from databases","author":"Bayardo","year":"1998","journal-title":"Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data"},{"key":"10.3233\/IDA-173473_ref33","unstructured":"J. Pei, J. Han and R. Mao, CLOSET: an efficient algorithm for mining frequent closed itemsets, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, pp. 11\u201320."},{"key":"10.3233\/IDA-173473_ref34","doi-asserted-by":"crossref","unstructured":"M.J. Zaki and C.J. Hsiao, CHARM: an efficient algorithm for closed itemset mining, in: Proceedings of the Second SIAM International Conference on Data Mining, 2002.","DOI":"10.1137\/1.9781611972726.27"},{"key":"10.3233\/IDA-173473_ref35","first-page":"653","article-title":"Mining frequent closed itemsets with the frequent pattern list","author":"Tseng","year":"2001","journal-title":"Proceedings of the IEEE International Conference on Data Mining"},{"issue":"2\u20133","key":"10.3233\/IDA-173473_ref36","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.knosys.2004.04.010","article-title":"CBAR: an efficient method for mining association rules","volume":"18","author":"Tsay","year":"2005","journal-title":"Knowledge-Based Systems"},{"issue":"4","key":"10.3233\/IDA-173473_ref37","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","article-title":"BitTableFI: An efficient mining frequent itemsets algorithm","volume":"20","author":"Dong","year":"2007","journal-title":"Knowledge-Based Systems"},{"issue":"7","key":"10.3233\/IDA-173473_ref38","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.is.2007.01.001","article-title":"A new approach to mine frequent patterns using item-transformation methods","volume":"32","author":"Wu","year":"2007","journal-title":"Information Systems"},{"key":"10.3233\/IDA-173473_ref40","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/276305.276313","article-title":"Efficiently mining long patterns from databases","author":"Bayardo","year":"1998","journal-title":"Proceedings of ACM SIGMOD International Conference on Management of Data,"},{"key":"10.3233\/IDA-173473_ref41","unstructured":"B. Goethals and J. Van den Bussche, A priori versus a posteriori filtering of association rules, 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999."},{"key":"10.3233\/IDA-173473_ref42","doi-asserted-by":"crossref","first-page":"5154","DOI":"10.1016\/j.eswa.2010.10.047","article-title":"An Improved frequent pattern growth method for mining association rules","volume":"38","author":"Lin","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-173473_ref43","doi-asserted-by":"crossref","unstructured":"S. Moens, E. Aksehirli and B. Goethals, Frequent Itemset Mining for Big Data, Universiteit Antwerpen, Belgium, IEEE Big Data, 2013.","DOI":"10.1109\/BigData.2013.6691742"},{"issue":"3","key":"10.3233\/IDA-173473_ref44","first-page":"377","article-title":"Distributed frequent itemset mining using trie data structure","volume":"35","author":"Ansari","year":"2008","journal-title":"IAENG International Journal of Computer Science"},{"key":"10.3233\/IDA-173473_ref45","doi-asserted-by":"crossref","unstructured":"G. Pyun, U. Yun and K.H. Ryu, Efficient frequent pattern mining based on Linear Prefix tree Knowledge-Based Systems, vol. 55, 2014, pp. 125\u2013139.","DOI":"10.1016\/j.knosys.2013.10.013"},{"key":"10.3233\/IDA-173473_ref46","unstructured":"Y. Jeya Sheela and S.H. Krishnaveni, A Novel Frequent Pattern Mining Approach with OTSP, 2015."},{"key":"10.3233\/IDA-173473_ref47","unstructured":"K. Syed Kousar Niasi and E. Kannan, Multi agent Approach for Evolving Data Mining in Parallel and Distributed Systems using Genetic Algorithms and Semantic Ontology, 2014."},{"issue":"12","key":"10.3233\/IDA-173473_ref48","first-page":"1353","article-title":"Distributed frequent Itemset Mining using Trie Data Structure","volume":"9","author":"Ansari","year":"2010","journal-title":"World Applied Sciences Journal"},{"key":"10.3233\/IDA-173473_ref49","doi-asserted-by":"crossref","unstructured":"S. Gole and B. Tidke, Frequent Itemset Mining for Big Data in social media using ClustBigFIM algorithm, Pervasive Computing (ICPC) 2015 International Conference on, 2015, pp. 1\u20136.","DOI":"10.1109\/PERVASIVE.2015.7087122"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-173473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:08Z","timestamp":1777454288000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-173473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":46,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/ida-173473","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,27]]}}}