{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:05:04Z","timestamp":1742400304389},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304623"},{"type":"electronic","value":"9783540316527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589990_28","type":"book-chapter","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T06:28:03Z","timestamp":1132986483000},"page":"254-263","source":"Crossref","is-referenced-by-count":12,"title":["Redundant Association Rules Reduction Techniques"],"prefix":"10.1007","author":[{"given":"Mafruz Zaman","family":"Ashrafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Taniar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kate","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Srikant, R.: Mining Association Rules between Sets of Items in Large Databases. In: The proc. ACM SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. In: IEEE Concurrency, pp. 14\u201325 (October-December 1999)","DOI":"10.1109\/4434.806975"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Yu, P.S.: A new Approach to Online Generation of Association Rules. IEEE TKDE\u00a013(4), 527\u2013540","DOI":"10.1109\/69.940730"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Liu, B., Hu, M., Hsu, W.: Multi-Level Organization and Summarization of the Discovered Rules. In: The proc. KDD, pp. 208\u2013217 (2000)","DOI":"10.1145\/347090.347128"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Pruning and Summarize the Discovered Associations. In: The proc. ACM SIGMOD, San Diego, CA, pp. 125\u2013134 (August 1999)","DOI":"10.1145\/312129.312216"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.I.: Finding Interesting Rules from Large Sets of Discovered Association Rules. In: Proc.CIKM, pp. 401\u2013407 (1994)","DOI":"10.1145\/191246.191314"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: Proceeding of the ACM SIGKDD, pp. 34\u201343 (2000)","DOI":"10.1145\/347090.347101"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: The proc. KDD, pp. 337\u2013341 (1999)","DOI":"10.1145\/312129.312274"},{"key":"28_CR9","unstructured":"Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, University of California, Irvine, Dept. of Information and Computer Science (1998), www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers report: Peeling the onion. SIGKDD Explorations\u00a02(2), 86\u201398 (2000), http:\/\/www.ecn.purdue.edu\/KDDCUP\/","DOI":"10.1145\/380995.381033"},{"key":"28_CR11","unstructured":"Goethals, B.: Frequent Pattern Mining Implementations, University of Helsinki-Department of Computer Science, http:\/\/www.cs.helsinki.fi\/u\/goethals\/software\/"},{"key":"28_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic - CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, p. 972. Springer, Heidelberg (2000)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery\u00a09, 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Lecture Notes in Computer Science","AI 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589990_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:09Z","timestamp":1619506089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589990_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304623","9783540316527"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11589990_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}