{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T18:24:33Z","timestamp":1729621473366,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icmla.2004.1383531","type":"proceedings-article","created":{"date-parts":[[2005,4,6]],"date-time":"2005-04-06T11:12:58Z","timestamp":1112785978000},"page":"328-335","source":"Crossref","is-referenced-by-count":0,"title":["Mining frequent closed itemsets for large data"],"prefix":"10.1109","author":[{"family":"Huaiguo Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mephu Nguifo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","article-title":"CHARM: An efficient algorithm for closed itemset mining","volume":"99","author":"zaki","year":"1999","journal-title":"Technical Report"},{"key":"11","first-page":"21","article-title":"CLOSET: An efficient algorithm for mining frequent closed itemsets","author":"pei","year":"2000","journal-title":"ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021571501451","article-title":"Freesets: A condensed representation of boolean data for the approximation of frequency queries","volume":"7","author":"boulicaut","year":"2003","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"Proc 1994 Int'l Conf Very Large Data Bases (VLDB"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2"},{"key":"5","first-page":"373","article-title":"How well go lattice algorithms on currently used machine learning testbeds?","author":"fu","year":"2004","journal-title":"4e?mes journe?es d'Extraction et de Gestion des Connaissances"},{"key":"4","first-page":"537","article-title":"Partitioning large data to scale up lattice-based algorithm","author":"fu","year":"2003","journal-title":"Proc Of ICTAI"},{"journal-title":"JETAI Special Issue on Concept Lattice for KDD","year":"2002","author":"mephu nguifo","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1080\/09528130210164170"}],"event":{"name":"2004 International Conference on Machine Learning and Applications, 2004.","location":"Louisville, Kentucky, USA"},"container-title":["2004 International Conference on Machine Learning and Applications, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9504\/30147\/01383531.pdf?arnumber=1383531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T14:02:15Z","timestamp":1497621735000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1383531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icmla.2004.1383531","relation":{},"subject":[]}}