{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:58:57Z","timestamp":1758265137713,"version":"3.38.0"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1109\/tkde.2006.88","type":"journal-article","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T02:05:28Z","timestamp":1146708328000},"page":"764-769","source":"Crossref","is-referenced-by-count":6,"title":["Closed constrained gradient mining in retail databases"],"prefix":"10.1109","volume":"18","author":[{"family":"Jianyong Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jiawei Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jian Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024076020895"},{"key":"ref2","first-page":"321","article-title":"Mining Multi-Dimensional Constrained Gradients in Data Cubes","volume-title":"Proc. 2001 Int\u2019l Conf. Very Large Data Bases (VLDB \u201901)","author":"Dong"},{"article-title":"DCI-CLOSED: A Fast and Memory Efficient Algorithm to Mine Frequent Itemsets","volume-title":"Proc. 2004 ICDM Int\u2019l Workshop Frequent Itemset Mining Implementations (FIMI \u201904)","author":"Lucchese","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276307"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914856"},{"article-title":"LCM ver. 2: Efficient Mining Algorithms for Frequent\/Closed\/Maximal Itemsets","volume-title":"Proc. 2004 ICDM Int\u2019l Workshop Frequent Itemset Mining Implementations (FIMI \u201904)","author":"Uno","key":"ref7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183996"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/34135\/01626231.pdf?arnumber=1626231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T05:33:19Z","timestamp":1741843999000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1626231\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":10,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2006.88","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}