{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:54:51Z","timestamp":1730224491653,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/grc.2009.5255112","type":"proceedings-article","created":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T20:32:54Z","timestamp":1253910774000},"page":"274-277","source":"Crossref","is-referenced-by-count":0,"title":["Mining opened frequent itemsets to generate maximal Boolean association rules"],"prefix":"10.1109","author":[{"given":"Baoqing","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Chong","family":"Han","sequence":"additional","affiliation":[]},{"given":"Lingsheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"88","article-title":"the structure of the set of all boolean association rules","volume":"36","author":"jiang","year":"2006","journal-title":"Journal of Henan University (Natural Sciences Edition)"},{"key":"2","first-page":"398","article-title":"discovering frequent closed itemsets for association rules","author":"pasquier","year":"1999","journal-title":"Proceedings of the 7th International Conference on Database Theory Volume 1540 of Lecture Notes in Computer Science"},{"journal-title":"Fast Discovery of Association Rules","year":"1996","author":"agrawal","key":"1"},{"key":"7","first-page":"39","article-title":"the algorithm of generating maximal boolean association rules","volume":"40","author":"ma","year":"2008","journal-title":"Journal of Zhengzhou University (Natural Sciences Edition)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/GRC.2008.4664764"},{"key":"5","first-page":"373","article-title":"association inference in asso-ciation rules mining (in chinese)","volume":"10","author":"wang","year":"2001","journal-title":"Journal of Yunnan University of the Nationalities (Natural Sciences Edition)"},{"key":"4","first-page":"65","article-title":"mining the smallest association rule set based on cover operations (in chinese)","volume":"69","author":"ma","year":"2005","journal-title":"Computer Engineering and Science 27"}],"event":{"name":"2009 IEEE International Conference on Granular Computing (GRC)","start":{"date-parts":[[2009,8,17]]},"location":"Nanchang, China","end":{"date-parts":[[2009,8,19]]}},"container-title":["2009 IEEE International Conference on Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5234367\/5254998\/05255112.pdf?arnumber=5255112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:40:46Z","timestamp":1489812046000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5255112\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/grc.2009.5255112","relation":{},"subject":[],"published":{"date-parts":[[2009,8]]}}}