{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T00:49:09Z","timestamp":1725410949875},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/grc.2005.1547372","type":"proceedings-article","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T20:49:09Z","timestamp":1134247749000},"page":"652-659 Vol. 2","source":"Crossref","is-referenced-by-count":2,"title":["Compact transaction database for efficient frequent pattern mining"],"prefix":"10.1109","author":[{"family":"Qian Wan","sequence":"first","affiliation":[]},{"family":"Aijun An","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","article-title":"An efficient algorithm for mining association rules in large databases","author":"savasere","year":"1995","journal-title":"Proceedings of the 21st International Conference on Very Large Data Bases"},{"key":"16","article-title":"Data compression: Methods and theory","author":"storer","year":"1988","journal-title":"Computer Science Press"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/69.634757"},{"key":"14","first-page":"539","article-title":"Search through systematic set enumeration","author":"rymon","year":"1992","journal-title":"Proc Int l Conf Principles of Knowledge Representation and Reasoning"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775081"},{"key":"12","first-page":"181","article-title":"Efficient algorithms for discovering association rules","author":"mannila","year":"1994","journal-title":"AAAI Workshop on Knowledge Discovery in Databases"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"2","article-title":"A tree projection algorithm for generation of frequent itemsets","author":"agarwal","year":"2000","journal-title":"Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347114"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/45072.45074"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253325"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/76894.76896"},{"key":"5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/276305.276313","article-title":"Efficiently mining long patterns from databases","author":"bayardo","year":"1998","journal-title":"Proc ACM SIGMOD Int Conf"},{"key":"4","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agarwal","year":"1994","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"9","article-title":"Discovery of interesting association rules from livelink web log data","author":"huang","year":"2002","journal-title":"Proceedings of IEEE International Conference on Data Mining"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"}],"event":{"name":"2005 IEEE International Conference on Granular Computing","start":{"date-parts":[[2005,7,27]]},"location":"Beijing, China","end":{"date-parts":[[2005,7,27]]}},"container-title":["2005 IEEE International Conference on Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10381\/33011\/01547372.pdf?arnumber=1547372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T01:37:37Z","timestamp":1497663457000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1547372\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/grc.2005.1547372","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}