Please use this identifier to cite or link to this item:
|Title:||Mining frequent closed patterns in microarray data||Authors:||Cong, G.
|Issue Date:||2004||Citation:||Cong, G.,Tan, K.-L.,Tung, A.K.H.,Pan, F. (2004). Mining frequent closed patterns in microarray data. Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 : 363-366. ScholarBank@NUS Repository.||Abstract:||Microarray data typically contains a large number of columns and a small number of rows, which poses a great challenge for existing frequent (closed) pattern mining algorithms that discover patterns in item enumeration space. In this paper, we propose two new algorithms that explore the row enumeration space to mine frequent closed patterns. Several experiments on real-life gene expression data show that the new algorithms are faster than existing algorithms, including CLOSET, CHARM, CLOSET+ and CARPENTER. © 2004 IEEE.||Source Title:||Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004||URI:||http://scholarbank.nus.edu.sg/handle/10635/41486||ISBN:||0769521428|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 24, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.