{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:10:42Z","timestamp":1729671042923,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdm.2002.1183996","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"514-521","source":"Crossref","is-referenced-by-count":0,"title":["From path tree to frequent patterns: a framework for mining frequent patterns"],"prefix":"10.1109","author":[{"family":"Yabo Xu","sequence":"first","affiliation":[]},{"given":"J.X.","family":"Yu","sequence":"additional","affiliation":[]},{"family":"Guimei Liu","sequence":"additional","affiliation":[]},{"family":"Hongjun Lu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"ref3","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf on Very large Data Bases"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335376"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754968"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-47887-6_34","article-title":"Top down fp-growth for association rule mining","author":"wang","year":"2002","journal-title":"Proc of the Pacific and Asia Conf on Knowledge Discovery and Data Mining"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914857"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref7","article-title":"Mining frequent patterns by pattern-growth: Methodology and implications","author":"han","year":"2001","journal-title":"ACM SIGKDD Explorations"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","article-title":"A tree projection algorithm for generation of frequent item sets","volume":"61","author":"agarwal","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref9","article-title":"H-mine:hyper-structure mining of frequent patterns in large databases","author":"pei","year":"2001","journal-title":"The 2001 IEEE International Conference on Data Mining"},{"key":"ref1","first-page":"108","article-title":"Depth first generation of long patterns","author":"agarwal","year":"2001","journal-title":"Proc 6th ACM SIGKDD Int l Conf Knowledge Discovery and Data Mining"}],"event":{"name":"2002 IEEE International Conference on Data Mining. ICDM 2002","acronym":"ICDM-02","location":"Maebashi City, Japan"},"container-title":["2002 IEEE International Conference on Data Mining, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8435\/26564\/01183996.pdf?arnumber=1183996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:46:35Z","timestamp":1497566795000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1183996\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icdm.2002.1183996","relation":{},"subject":[]}}