{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:40:01Z","timestamp":1760708401493,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/rivf.2012.6169826","type":"proceedings-article","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T21:51:16Z","timestamp":1332798676000},"page":"1-5","source":"Crossref","is-referenced-by-count":11,"title":["An Efficient Incremental Mining Approach Based on IT-Tree"],"prefix":"10.1109","author":[{"given":"Thien-Phuong","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzung-Pei","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bac","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(03)90058-6"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492094"},{"key":"2","first-page":"487","article-title":"Fast algorithm for mining association rules","author":"agrawal","year":"1994","journal-title":"The International Conference on Very Large Data Bases"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.03.014"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2009.01.015"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.04.009"},{"key":"5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.3233\/IDA-2001-5203","article-title":"A new incremental data mining algorithm using pre-large itemsets","volume":"5","author":"hong","year":"2001","journal-title":"Intelligent Data Analysis"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"9","volume":"3","author":"knuth","year":"1968","journal-title":"The art of computer programming"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.019"}],"event":{"name":"Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)","start":{"date-parts":[[2012,2,27]]},"location":"Ho Chi Minh City, Vietnam","end":{"date-parts":[[2012,3,1]]}},"container-title":["2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6168956\/6169815\/06169826.pdf?arnumber=6169826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T03:21:19Z","timestamp":1561519279000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6169826\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/rivf.2012.6169826","relation":{},"subject":[],"published":{"date-parts":[[2012,2]]}}}