{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T22:52:19Z","timestamp":1770331939663,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T00:00:00Z","timestamp":1391472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10115-014-0732-4","type":"journal-article","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T15:10:25Z","timestamp":1391440225000},"page":"127-156","source":"Crossref","is-referenced-by-count":22,"title":["An effective association rule mining scheme using a new generic basis"],"prefix":"10.1007","volume":"43","author":[{"given":"Jayakrushna","family":"Sahoo","sequence":"first","affiliation":[]},{"given":"Ashok Kumar","family":"Das","sequence":"additional","affiliation":[]},{"given":"A.","family":"Goswami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,4]]},"reference":[{"key":"732_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data (SIGMOD \u201993), pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"732_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases (VLDB \u201994), pp 487\u2013499"},{"key":"732_CR3","unstructured":"Bache K, Lichman M (2012) UCI machine learning repository ( http:\/\/archive.ics.uci.edu\/ml ). University of California, School of Information and Computer Science, Irvine, CA"},{"issue":"2","key":"732_CR4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y Bastide","year":"2000","unstructured":"Bastide Y, Taouil R, Pasquier N, Stumme G, Lakhal L (2000) Mining frequent patterns with counting inference. SIGKDD Explor Newsl 2(2):66\u201375","journal-title":"SIGKDD Explor Newsl"},{"issue":"2","key":"732_CR5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s10115-005-0201-1","volume":"9","author":"F Bonchi","year":"2006","unstructured":"Bonchi F, Lucchese C (2006) On condensed representations of constrained frequent patterns. Knowl Inf Syst 9(2):180\u2013201","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"732_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"JF Boulicaut","year":"2003","unstructured":"Boulicaut JF, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of Boolean data for the approximation of frequency queries. Data Min Knowl Disc 7(1):5\u201322","journal-title":"Data Min Knowl Disc"},{"key":"732_CR7","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the 1997 ACM SIGMOD international conference on management of data (SIGMOD \u201997), pp 255\u2013264","DOI":"10.1145\/253260.253325"},{"issue":"1","key":"732_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10618-006-0054-6","volume":"14","author":"T Calders","year":"2007","unstructured":"Calders T, Goethals B (2007) Non-derivable itemset mining. Data Min Knowl Disc 14(1):171\u2013206","journal-title":"Data Min Knowl Disc"},{"key":"732_CR9","doi-asserted-by":"crossref","unstructured":"Casali A, Cicchetti R, Lakhal L (2005) Essential patterns: a perfect cover of frequent patterns. In: Proceedings of the 7th international conference on data warehousing and knowledge, discovery (DaWaK\u201905), pp 428\u2013437","DOI":"10.1007\/11546849_42"},{"issue":"2","key":"732_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10618-007-0084-8","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) Effective elimination of redundant association rules. Data Min Knowl Disc 16(2):221\u2013249","journal-title":"Data Min Knowl Disc"},{"issue":"4","key":"732_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","volume":"20","author":"J Dong","year":"2007","unstructured":"Dong J, Han M (2007) BitTableFI: an efficient mining frequent itemsets algorithm. Knowl Based Syst 20(4):329\u2013335","journal-title":"Knowl Based Syst"},{"key":"732_CR12","unstructured":"Fournier-Viger P, Gomariz A, Soltani A, Gueniche T (2012) SPMF: open-source data mining platform. http:\/\/www.philippe-fournier-viger.com\/spmf\/"},{"key":"732_CR13","unstructured":"Frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/data\/"},{"key":"732_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal concept analysis","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R, Wille R (1999) Formal concept analysis. Springer, Berlin"},{"issue":"10","key":"732_CR15","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"732_CR16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1142\/S0129054108005681","volume":"19","author":"T Hamrouni","year":"2008","unstructured":"Hamrouni T, Yahia SB, Nguifo EM (2008) Succinct minimal generators: theoretical foundations and applications. Int J Found Comput Sci 19(2):271\u2013296","journal-title":"Int J Found Comput Sci"},{"key":"732_CR17","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data (SIGMOD \u201900), pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"732_CR18","doi-asserted-by":"crossref","unstructured":"Jin R, Xiang Y, Liu L (2009) Cartesian contour: a concise representation for a collection of frequent sets. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201909), pp 417\u2013426","DOI":"10.1145\/1557019.1557069"},{"key":"732_CR19","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M (1998) Representative association rules. In: Wu X, Kotagiri R, Korb KB (eds) Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD \u201998). Lecture notes in computer science 1394. Springer, Berlin, pp 198\u2013209","DOI":"10.1007\/3-540-64383-4_17"},{"issue":"3","key":"732_CR20","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","volume":"14","author":"DI Lin","year":"2002","unstructured":"Lin DI, Kedem ZM (2002) Pincer-search: an efficient algorithm for discovering the maximum frequent set. IEEE Trans Knowl Data Eng 14(3):553\u2013566","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"732_CR21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10115-007-0111-5","volume":"17","author":"G Liu","year":"2008","unstructured":"Liu G, Li J, Wong L (2008) A new concise representation of frequent itemsets using generators and a positive border. Knowl Inf Syst 17(1):35\u201356","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"732_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"732_CR23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/276305.276307","volume":"27","author":"RT Ng","year":"1998","unstructured":"Ng RT, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. SIGMOD Rec 27(2):13\u201324","journal-title":"SIGMOD Rec"},{"issue":"1","key":"732_CR24","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.datak.2006.04.009","volume":"61","author":"GK Palshikar","year":"2007","unstructured":"Palshikar GK, Kale MS, Apte MM (2007) Association rules mining using heavy itemsets. Data Knowl Eng 61(1):93\u2013113","journal-title":"Data Knowl Eng"},{"key":"732_CR25","doi-asserted-by":"crossref","unstructured":"Park JS, Chen M-S, Yu PS (1995) An effective hash-based algorithm for mining association rules. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data (SIGMOD \u201995), pp 175\u2013186","DOI":"10.1145\/223784.223813"},{"issue":"1","key":"732_CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"732_CR27","doi-asserted-by":"crossref","unstructured":"PYR Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th international conference on database theory (ICDT \u201999), pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"732_CR28","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N Pasquier","year":"2005","unstructured":"Pasquier N, Taouil R, Bastide Y, Stumme G, Lakhal L (2005) Generating a condensed representation for association rules. J Intell Inf Syst 24(1):29\u201360","journal-title":"J Intell Inf Syst"},{"key":"732_CR29","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD workshop on research issues in, data mining and knowledge discovery, pp 21\u201330"},{"key":"732_CR30","unstructured":"Pei J, Han J, Lu H, Nishio S, Tang S, Yang D (2001) H-mine: hyper-structure mining of frequent patterns in large databases. In: Proceedings of the 2001 IEEE international conference on data mining (ICDM \u201901), pp 441\u2013448"},{"issue":"5","key":"732_CR31","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s10115-003-0133-6","volume":"6","author":"J Pei","year":"2004","unstructured":"Pei J, Dong G, Zou W, Han J (2004) Mining condensed frequent-pattern bases. Knowl Inf Syst 6(5):570\u2013594","journal-title":"Knowl Inf Syst"},{"key":"732_CR32","doi-asserted-by":"crossref","unstructured":"Singh NG, Singh SR, Mahanta AK (2005) CloseMiner: discovering frequent closed itemsets using frequent closed tidsets. In: Proceedings of the fifth IEEE international conference on data mining (ICDM \u201905), pp 633\u2013636","DOI":"10.1109\/ICDM.2005.41"},{"issue":"4","key":"732_CR33","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/IDA-2008-12402","volume":"12","author":"W Song","year":"2008","unstructured":"Song W, Yang B, Xu Z (2008) Index-CloseMiner: an improved algorithm for mining frequent closed itemset. Intell Data Anal 12(4):321\u2013338","journal-title":"Intell Data Anal"},{"key":"732_CR34","unstructured":"Srikant R, Vu Q, Agrawal R (1997) Mining association rules with item constraints. In: Proceedings of the 3rd international conference on knowledge discovery in databases and data mining, pp 67\u201373"},{"issue":"8","key":"732_CR35","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/S0306-4379(03)00061-9","volume":"29","author":"PSM Tsai","year":"2004","unstructured":"Tsai PSM, Chen CM (2004) Mining interesting association rules from customer databases and transaction databases. Inf Syst 29(8):685\u2013696","journal-title":"Inf Syst"},{"issue":"8","key":"732_CR36","doi-asserted-by":"crossref","first-page":"7196","DOI":"10.1016\/j.eswa.2012.01.062","volume":"39","author":"B Vo","year":"2012","unstructured":"Vo B, Hong TP, Le B (2012) DBV-Miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196\u20137206","journal-title":"Expert Syst Appl"},{"key":"732_CR37","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201903), pp 236\u2013245","DOI":"10.1145\/956750.956779"},{"issue":"6","key":"732_CR38","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.datak.2011.02.003","volume":"70","author":"Y Xu","year":"2011","unstructured":"Xu Y, Li Y, Shaw G (2011) Reliable representations for association rules. Data Knowl Eng 70(6):555\u2013575","journal-title":"Data Knowl Eng"},{"issue":"4","key":"732_CR39","doi-asserted-by":"crossref","first-page":"633","DOI":"10.3233\/IDA-2009-0384","volume":"13","author":"SB Yahia","year":"2009","unstructured":"Yahia SB, Gasmi G, Nguifo EM (2009) A new generic basis of \u201cfactual\u201d and \u201cimplicative\u201d association rules. Intell Data Anal 13(4):633\u2013656","journal-title":"Intell Data Anal"},{"key":"732_CR40","unstructured":"Yen SJ, Lee YS (2002) Mining interesting association rules: a data mining language. In: Proceedings of the 6th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD \u201902), pp 172\u2013176"},{"key":"732_CR41","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. Technical report, University of Rochester, Rochester, NY","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"732_CR42","unstructured":"Zaki MJ (April 2002) Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemset mining. In: Grossman R, Han J, Kumar V, Mannila H, Motwani R (eds) Proceedings of the second SIAM international conference on data mining. Arlington, VA, pp 457\u2013473"},{"key":"732_CR43","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining (KDD \u201903), pp 326\u2013335"},{"issue":"3","key":"732_CR44","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki MJ (2004) Mining non-redundant association rules. Data Min Knowl Disc 9(3):223\u2013248","journal-title":"Data Min Knowl Disc"},{"issue":"4","key":"732_CR45","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0732-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0732-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0732-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T04:26:56Z","timestamp":1565152016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0732-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,4]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["732"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0732-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,4]]}}}