Please use this identifier to cite or link to this item:
|dc.title||COBBLER: Combining column and row enumeration for closed pattern discovery|
|dc.identifier.citation||Pan, F.,Tung, A.K.H.,Cong, G.,Xu, X. (2004). COBBLER: Combining column and row enumeration for closed pattern discovery. Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM 16 : 21-30. ScholarBank@NUS Repository.|
|dc.description.abstract||The problem of mining frequent closed patterns has received considerable attention recently as it promises to have much less redundancy compared to discovering all frequent patterns. Existing algorithms can presently be separated into two groups, feature (column) 1 enumeration and row enumeration. Feature enumeration algorithms like CHARM and CLOSET+ are efficient for datasets with small number of features and large number of rows since the number of feature combinations to be enumerated is small. Row enumeration algorithms like CARPENTER on the other hand are more suitable for datasets (eg. bioinformatics data) with large number of features and small number of rows. Both groups of algorithms, however, will encounter problem for datasets that have large number of rows and features. In this paper, we describe a new algorithm called COBBLER which can efficiently mine such datasets. COBBLER is designed to dynamically switch between feature enumeration and row enumeration depending on the data characteristic in the process of mining. As such, each portion of the dataset can be processed using the most suitable method, making the mining more efficient. Several experiments on real-life and synthetic datasets show that COBBLER is an order of magnitude better than previous closed pattern mining algorithms like CHARM, CLOSET+ and CARPENTER.|
|dc.description.sourcetitle||Proceedings of the International Conference on Scientific and Statistical Database Management, SSDBM|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.