{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:48Z","timestamp":1761597048709},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T00:00:00Z","timestamp":1192838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s10618-007-0084-8","type":"journal-article","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T13:25:24Z","timestamp":1192800324000},"page":"221-249","source":"Crossref","is-referenced-by-count":13,"title":["Effective elimination of redundant association rules"],"prefix":"10.1007","volume":"16","author":[{"given":"James","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiping","family":"Ke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,20]]},"reference":[{"issue":"4","key":"84_CR1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1109\/69.940730","volume":"13","author":"CC Aggarwal","year":"2001","unstructured":"Aggarwal CC and Yu PS (2001). A new approach to online generation of association rules. IEEE Trans Knowl Data Eng 13(4): 527\u2013540","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"84_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: Proceedings of the ACM conference on the management of data (SIGMOD)","DOI":"10.1145\/170035.170072"},{"key":"84_CR3","doi-asserted-by":"crossref","unstructured":"Bastide Y, Pasquier N, Taouil R, Stumme G, Lakhal L (2000) Mining minimal non-redundant association rules using frequent closed itemsets. In: Computational Logic, pp 972\u2013986","DOI":"10.1007\/3-540-44957-4_65"},{"key":"84_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo R (1998) Efficiently mining long patterns from databases. In: Proceedings of the ACM conference on the management of data (SIGMOD), pp 85\u201393","DOI":"10.1145\/276304.276313"},{"issue":"1","key":"84_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J-F Boulicaut","year":"2003","unstructured":"Boulicaut J-F, Bykowski A and Rigotti C (2003). Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Disc (DMKD) 7(1): 5\u201322","journal-title":"Data Min Knowl Disc (DMKD)"},{"key":"84_CR6","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proceedings of the European conference on principles of data mining and knowledge discovery (PKDD), pp 74\u201385","DOI":"10.1007\/3-540-45681-3_7"},{"issue":"2","key":"84_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1132956.1132958","volume":"38","author":"A Ceglar","year":"2006","unstructured":"Ceglar A and Roddick JF (2006). Association mining. ACM Comput Surv (CSUR) 38(2): 5","journal-title":"ACM Comput Surv (CSUR)"},{"key":"84_CR8","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Ng W (2006) \u03b4-Tolerance closed frequent itemsets. In: Proceedings of the 6th IEEE international conference on data mining (ICDM)","DOI":"10.1109\/ICDM.2006.1"},{"key":"84_CR9","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Ng W (2007a) FG-Index: towards verification-free query processing on graph databases. In: Proceedings of the 26th ACM conference on the management of data (SIGMOD), pp 857\u2013872","DOI":"10.1145\/1247480.1247574"},{"key":"84_CR10","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Ng W (2007b) Maintaining frequent closed itemsets over a sliding window. J Intell Inform Syst (JIIS) (to appear)","DOI":"10.1007\/s10844-007-0042-3"},{"key":"84_CR11","unstructured":"FIMI Dataset Repository (2003) The FIMI frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/data\/ , Accessed on May 2006"},{"key":"84_CR12","doi-asserted-by":"crossref","unstructured":"Fonseca BM, Golgher PB, P\u00f4ssas B, Ribeiro-Neto BA, Ziviani N (2005) Concept-based interactive query expansion. In: Proceedings of the ACM CIKM international conference on information and knowledge management, pp 696\u2013703","DOI":"10.1145\/1099554.1099726"},{"key":"84_CR13","unstructured":"Geurts K, Wets G, Brijs T, Vanhoof K (2003) Profiling high frequency accident locations using association rules. In: Proceedings of the 82nd annual transportation research board, p 18"},{"key":"84_CR14","doi-asserted-by":"crossref","unstructured":"Goethals B, Muhonen J, Toivonen H (2005) Mining non-derivable association rules. In: Proceedings of the SIAM international conference on data mining (SDM)","DOI":"10.1137\/1.9781611972757.22"},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"Jeudy B, Boulicaut J-F (2002) Using condensed representations for interactive association rule mining. In: Proceedings of the 6th European conferences on principles and practice of knowledge discovery in databases (PKDD), pp 225\u2013236","DOI":"10.1007\/3-540-45681-3_19"},{"key":"84_CR16","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M (1998) Representative association rules and minimum condition maximum consequence association rules. In: Proceedings of the European conference on principles of data mining and knowledge discovery (PKDD), pp 361\u2013369","DOI":"10.1007\/BFb0094839"},{"issue":"1","key":"84_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.dss.2005.05.004","volume":"43","author":"N Kumar","year":"2007","unstructured":"Kumar N, Gangopadhyay A and Karabatis G (2007). Supporting mobile decision making with association rules and multi-layered caching. Decis Support Syst 43(1): 16\u201330","journal-title":"Decis Support Syst"},{"key":"84_CR18","doi-asserted-by":"crossref","unstructured":"Li G, Hamilton HJ (2004) Basic association rules. In: Proceedings of the SIAM international conference on data mining (SDM)","DOI":"10.1137\/1.9781611972740.16"},{"key":"84_CR19","unstructured":"Li W, Han J, Pei J (2001) Cmar: accurate and efficient classification based on multiple class- association rules. In: ICDM \u201901: Proceedings of the 2001 IEEE international conference on data mining, Washington, DC, USA, pp 369\u2013376. IEEE Computer Society. ISBN 0-7695-1119-8"},{"key":"84_CR20","doi-asserted-by":"crossref","unstructured":"Liu B, Hsu W, Ma Y (2001) Identifying non-actionable association rules. In: Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/502512.502560"},{"key":"84_CR21","doi-asserted-by":"crossref","unstructured":"M\u00f6rchen F, Ultsch A (2007) Efficient mining of understandable patterns from multivariate interval time series. Data Min Knowl Disc (DMKD) 15(2):107\u2013296","DOI":"10.1007\/s10618-007-0070-1"},{"issue":"1","key":"84_CR22","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 and Apte MM (2007). Association rules mining using heavy itemsets. Data Knowl Eng 61(1): 93\u2013113","journal-title":"Data Knowl Eng"},{"key":"84_CR23","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the international conference on database theory (ICDT)","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"84_CR24","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 and Lakhal L (2005). Generating a condensed representation for association rules. J Intell Inform Syst (JIIS) 24(1): 29\u201360","journal-title":"J Intell Inform Syst (JIIS)"},{"issue":"3","key":"84_CR25","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1016\/j.asoc.2006.10.008","volume":"7","author":"FA Thabtah","year":"2007","unstructured":"Thabtah FA and Cowling PI (2007). A greedy classification algorithm based on association rule. Appl Soft Comput 7(3): 1102\u20131111","journal-title":"Appl Soft Comput"},{"issue":"3","key":"84_CR26","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/B:DAMI.0000023675.04946.f1","volume":"8","author":"Q Yang","year":"2004","unstructured":"Yang Q, Li T and Wang K (2004). Building association-rule based sequential classifiers for web- document prediction. Data Min Knowl Disc (DMKD) 8(3): 253\u2013273","journal-title":"Data Min Knowl Disc (DMKD)"},{"key":"84_CR27","doi-asserted-by":"crossref","unstructured":"Yin X, Han J (2003) Cpar: classification based on predictive association rules. In: Proceedings of the SDM","DOI":"10.1137\/1.9781611972733.40"},{"issue":"3","key":"84_CR28","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"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-007-0084-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-007-0084-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-007-0084-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:40Z","timestamp":1559244580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-007-0084-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,20]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s10618-007-0084-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,20]]}}}