{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:47:40Z","timestamp":1648849660436},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","funder":[{"name":"PAC::LFO","award":["MTM2014-55262-P","MTM2014-55421-P"],"award-info":[{"award-number":["MTM2014-55262-P","MTM2014-55421-P"]}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovacion","doi-asserted-by":"crossref","award":["2014SGR 890"],"award-info":[{"award-number":["2014SGR 890"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p> The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the \u201cessential\u201d or \u201crepresentative\u201d rules. A previously known algorithm for mining representative rules relies on an incorrect mathematical claim, and can be seen to miss part of its intended output; in previous work, two of the authors of the present paper have offered a complete but, often, somewhat slower alternative. Here, we extend this alternative to the case of closure-based redundancy. The empirical validation shows that, in this way, we can improve on the original time efficiency, without sacrificing completeness. <\/jats:p>","DOI":"10.1142\/s0129054120400109","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T01:55:02Z","timestamp":1580435702000},"page":"143-156","source":"Crossref","is-referenced-by-count":1,"title":["Closed-Set-Based Discovery of Representative Association Rules"],"prefix":"10.1142","volume":"31","author":[{"given":"Cristina","family":"T\u00eern\u0103uc\u0103","sequence":"first","affiliation":[{"name":"Department of Mathematics, Statistics and Computation, Universidad de Cantabria, Av. de los Castros 48, Santander 39005, Spain"}]},{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Universitat Polit\u00e8cnica de Catalunya, C. Jordi Girona 1-3, Omega 005, Barcelona 08034, Spain"}]},{"given":"Domingo","family":"G\u00f3mez-P\u00e9rez","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Statistics and Computation, Universidad de Cantabria, Av. de los Castros 48, Santander 39005, Spain"}]}],"member":"219","published-online":{"date-parts":[[2020,1,29]]},"reference":[{"key":"S0129054120400109BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/69.940730"},{"issue":"2","key":"S0129054120400109BIB003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-6(2:4)2010","volume":"6","author":"Balc\u00e1zar J. L.","year":"2010","journal-title":"Logical Methods in Computer Science"},{"key":"S0129054120400109BIB004","series-title":"Revue des Nouvelles Technologies de l\u2019Information","first-page":"635","volume-title":"Actes de Extraction et gestion des connaissances (EGC)","volume":"20","author":"Balc\u00e1zar J. L.","year":"2011"},{"key":"S0129054120400109BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312241"},{"key":"S0129054120400109BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132958"},{"key":"S0129054120400109BIB009","first-page":"5","volume":"95","author":"Guigues J.","year":"1986","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"S0129054120400109BIB010","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"S0129054120400109BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69115-4_30"},{"key":"S0129054120400109BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44816-0_35"},{"key":"S0129054120400109BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45728-3_8"},{"key":"S0129054120400109BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-005-0266-z"},{"key":"S0129054120400109BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39963-1_52"},{"key":"S0129054120400109BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24651-0_30"},{"key":"S0129054120400109BIB017","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000040429.96086.c7"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120400109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T01:55:42Z","timestamp":1580435742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120400109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":14,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1142\/S0129054120400109"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120400109","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}