{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:44:58Z","timestamp":1730223898938,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/grc.2011.6122653","type":"proceedings-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T17:03:07Z","timestamp":1326301387000},"page":"533-538","source":"Crossref","is-referenced-by-count":2,"title":["Efficient construction and usefulness of hyper-rectangle greedy covers"],"prefix":"10.1109","author":[{"given":"Koji","family":"Ouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1979.4310223"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0002-x"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.131"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.183"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"2","first-page":"161","article-title":"Extraction of generalized rules with automated attribute abstraction","volume":"6","author":"shidara","year":"2005","journal-title":"Foundations of Data Mining and Knowledge Discovery Studies in Computational Intelligence 6"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(95)00107-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"7","article-title":"LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets","author":"uno","year":"0","journal-title":"IEEE ICDM'04 Workshop FIMI'04 2004"},{"key":"6","article-title":"Detailed description of an algorithm for enumeration of maximal frequent sets with irredundant dualization","author":"uno","year":"0","journal-title":"Online CEUR Workshop Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations 2003"},{"key":"5","first-page":"723","article-title":"The set covering machine","volume":"3","author":"marchand","year":"2003","journal-title":"The Journal of Machine Learning Research"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/21.44035"},{"journal-title":"C4 5 Programs for Machine Learning","year":"1993","author":"quinlan","key":"9"},{"journal-title":"UCI repository of machine learning databases","year":"1998","author":"blake","key":"8"}],"event":{"name":"2011 IEEE International Conference on Granular Computing (GrC-2011)","start":{"date-parts":[[2011,11,8]]},"location":"Kaohsiung, Taiwan","end":{"date-parts":[[2011,11,10]]}},"container-title":["2011 IEEE International Conference on Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6112290\/6122548\/06122653.pdf?arnumber=6122653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T12:02:34Z","timestamp":1490097754000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6122653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/grc.2011.6122653","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}