{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:59:53Z","timestamp":1744163993246,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_20","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"161-165","source":"Crossref","is-referenced-by-count":16,"title":["Mining Negative Rules Using GRD"],"prefix":"10.1007","author":[{"given":"Dhananjay R.","family":"Thiruvady","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoff I.","family":"Webb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S. (eds.) SIGMOD, Washington, D.C, 26-28, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"20_CR2","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases, University of California, Irvine, Dept. of Information and Computer Sciences (1998), http:\/\/www.ics.uci.edu\/~mlearn\/mlrepository.html"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: SIGMOD, pp. 265\u2013276 (1997)","DOI":"10.1145\/253260.253327"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, R., Motwani, P., Ullman, J., Yang, C.: Finding interesting associations without supporting pruning. In: Proc. ICDE (2000)","DOI":"10.1109\/69.908981"},{"key":"20_CR5","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD archive. University of California, Irvine, Dept. of Information and Computer Sciences (1999), http:\/\/www.ics.uci.edu\/"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.B.: Mining for strong negative associations in a large database of customer transactions. In: ICDE, pp. 494\u2013502 (1998)","DOI":"10.1109\/ICDE.1998.655812"},{"issue":"2-3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-739X(97)00019-8","volume":"13","author":"R. Srikant","year":"1997","unstructured":"Srikant, R., Agrawal, R.: Mining generalized association rules. Future Generation Computer Systems\u00a013(2-3), 161\u2013180 (1997)","journal-title":"Future Generation Computer Systems"},{"key":"20_CR8","first-page":"67","volume-title":"Proc. KDD","author":"R. Srikant","year":"1997","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R. (eds.) Proc. KDD, 14-17, pp. 67\u201373. AAAI Press, Menlo Park (1997)"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"G.I. Webb","year":"1995","unstructured":"Webb, G.I.: OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research\u00a03, 431\u2013465 (1995)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"G.: I Webb. Efficient search for association rules. KDD, 99\u2013107 (2000)","DOI":"10.1145\/347090.347112"},{"key":"20_CR11","unstructured":"G. I Webb and S. Zhang. Beyond association rules: Generalized rule discovery. In Knowledge Discovery and Data Mining. Kluwer Academic Publishers, 14\u201317 (unpublished manuscript)"},{"key":"20_CR12","unstructured":"Wu, X., Zhang, C., Zhang, S.: Mining both positive and negative rules. In: ICML, pp. 658\u2013665 (2002)"},{"key":"20_CR13","unstructured":"Zaki, M., Gouda, K.: Fast vertical mining using diffsets. Technical Report 01-1, Rensselaer Polytechnic Institute (2001)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. KDD, 401\u2013406 (2001)","DOI":"10.1145\/502512.502572"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T18:04:40Z","timestamp":1740506680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}