{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:23:12Z","timestamp":1760707392195},"reference-count":1,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.2004.1320063","type":"proceedings-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T09:50:22Z","timestamp":1096365022000},"page":"832","source":"Crossref","is-referenced-by-count":2,"title":["On local pruning of association rules using directed hypergraphs"],"prefix":"10.1109","author":[{"family":"Sanjay Chawla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Gaurav Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"On local pruning of association rules with directed hypergraphs","author":"chawla","year":"2003","journal-title":"Technical Report 535"}],"event":{"name":"Proceedings. 20th International Conference on Data Engineering","acronym":"ICDE-04","location":"Boston, MA, USA"},"container-title":["Proceedings. 20th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9217\/29235\/01320063.pdf?arnumber=1320063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T14:15:25Z","timestamp":1489414525000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1320063\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":1,"URL":"https:\/\/doi.org\/10.1109\/icde.2004.1320063","relation":{},"subject":[]}}